Quasi-Kernel Polynomials and Convergence Results for Quasi-Minimal Residual Iterations
- 1 January 1992
- book chapter
- Published by Springer Nature
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- Quasi-kernel polynomials and their use in non-Hermitian matrix iterationsJournal of Computational and Applied Mathematics, 1992
- A Completed Theory of the Unsymmetric Lanczos Process and Related Algorithms, Part ISIAM Journal on Matrix Analysis and Applications, 1992
- Iterative solution of linear systemsActa Numerica, 1992
- QMR: a quasi-minimal residual method for non-Hermitian linear systemsNumerische Mathematik, 1991
- Chebyshev polynomials are not always optimalJournal of Approximation Theory, 1991
- On the constrained Chebyshev approximation problem on ellipsesJournal of Approximation Theory, 1990
- On a class of Chebyshev approximation problems which arise in connection with a conjugate gradient type methodNumerische Mathematik, 1986
- Necessary and Sufficient Conditions for the Existence of a Conjugate Gradient MethodSIAM Journal on Numerical Analysis, 1984
- Methods of conjugate gradients for solving linear systemsJournal of Research of the National Bureau of Standards, 1952
- 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