Quasi-kernel polynomials and their use in non-Hermitian matrix iterations
- 1 November 1992
- journal article
- Published by Elsevier in Journal of Computational and Applied Mathematics
- Vol. 43 (1-2) , 135-158
- https://doi.org/10.1016/0377-0427(92)90263-w
Abstract
No abstract availableKeywords
This publication has 17 references indexed in Scilit:
- A Transpose-Free Quasi-Minimal Residual Algorithm for Non-Hermitian Linear SystemsSIAM Journal on Scientific Computing, 1993
- An Implementation of the Look-Ahead Lanczos Algorithm for Non-Hermitian MatricesSIAM Journal on Scientific Computing, 1993
- A Hybrid GMRES Algorithm for Nonsymmetric Linear SystemsSIAM Journal on Matrix Analysis and Applications, 1992
- A Completed Theory of the Unsymmetric Lanczos Process and Related Algorithms, Part ISIAM Journal on Matrix Analysis and Applications, 1992
- QMR: a quasi-minimal residual method for non-Hermitian linear systemsNumerische Mathematik, 1991
- Necessary and Sufficient Conditions for the Existence of a Conjugate Gradient MethodSIAM Journal on Numerical Analysis, 1984
- An Algorithm for Generalized Matrix Eigenvalue ProblemsSIAM Journal on Numerical Analysis, 1973
- Methods of conjugate gradients for solving linear systemsJournal of Research of the National Bureau of Standards, 1952
- The principle of minimized iterations in the solution of the matrix eigenvalue problemQuarterly of Applied Mathematics, 1951
- An iteration method for the solution of the eigenvalue problem of linear differential and integral operatorsJournal of Research of the National Bureau of Standards, 1950