A Robust GMRES-Based Adaptive Polynomial Preconditioning Algorithm for Nonsymmetric Linear Systems
- 1 March 1994
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Scientific Computing
- Vol. 15 (2) , 427-439
- https://doi.org/10.1137/0915029
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- On the convergence behavior of the restarted GMRES algorithm for solving nonsymmetric linear systemsNumerical Linear Algebra with Applications, 1994
- GMRES/CR and Arnoldi/Lanczos as Matrix Approximation ProblemsSIAM Journal on Scientific Computing, 1994
- Max-Min Properties of Matrix Factor NormsSIAM Journal on Scientific Computing, 1994
- Parallelizable restarted iterative methods for nonsymmetric linear systems. part I: TheoryInternational Journal of Computer Mathematics, 1992
- Topics in Matrix AnalysisPublished by Cambridge University Press (CUP) ,1991
- Necessary and sufficient conditions for the simplification of generalized conjugate-gradient algorithmsLinear Algebra and its Applications, 1987
- Orthogonal Error MethodsSIAM Journal on Numerical Analysis, 1987
- A Hybrid Chebyshev Krylov Subspace Algorithm for Solving Nonsymmetric Systems of Linear EquationsSIAM Journal on Scientific and Statistical Computing, 1986
- Necessary and Sufficient Conditions for the Existence of a Conjugate Gradient MethodSIAM Journal on Numerical Analysis, 1984
- Comparison of splittings used with the conjugate gradient algorithmNumerische Mathematik, 1979