Breakdowns and stagnation in iterative methods
The paper deals with iterative methods based on the use of Krylov subspaces for linear systems \(Au=f\). The author analyzes different kinds of breakdown and shows that one of them is related to the choice of the basis vectors and can be avoided by passing to the so-called orthodir basis vectors. The kind of breakdown, associated with finding the coefficients, is studied as well. The stagnation in the case of the BiCG method and its variants is considered; sometimes it can even imply breakdown. It should be noted that in solving large systems, some other modern methods, based on preconditioning and symmetrization, can be helpful [see, e.g., \textit{E. G. D'yakonov}, Optimization in solving elliptic problems (1996; Zbl 0852.65087)].
- A Completed Theory of the Unsymmetric Lanczos Process and Related Algorithms, Part I
- A Completed Theory of the Unsymmetric Lanczos Process and Related Algorithms. Part II
- A Look-Ahead Lanczos Algorithm for Unsymmetric Matrices
- A simpler GMRES
- A Taxonomy for Conjugate Gradient Methods
- A Theoretical Comparison of the Arnoldi and GMRES Algorithms
- An Implementation of the Look-Ahead Lanczos Algorithm for Non-Hermitian Matrices
- Bi-CGSTAB: A Fast and Smoothly Converging Variant of Bi-CG for the Solution of Nonsymmetric Linear Systems
- CGS, A Fast Lanczos-Type Solver for Nonsymmetric Linear systems
- Changing the Norm in Conjugate Gradient Type Algorithms
- Conjugate Gradient-Like Algorithms for Solving Nonsymmetric Linear Systems
- GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
- How Fast are Nonsymmetric Matrix Iterations?
- scientific article; zbMATH DE number 4213315 (Why is no real title available?)
- scientific article; zbMATH DE number 48301 (Why is no real title available?)
- scientific article; zbMATH DE number 88927 (Why is no real title available?)
- scientific article; zbMATH DE number 733664 (Why is no real title available?)
- Krylov Subspace Methods for Solving Large Unsymmetric Linear Systems
- Lanczos Methods for the Solution of Nonsymmetric Systems of Linear Equations
- Methods of conjugate gradients for solving linear systems
- Necessary and Sufficient Conditions for the Existence of a Conjugate Gradient Method
- Necessary and sufficient conditions for the simplification of generalized conjugate-gradient algorithms
- On the simplification of generalized conjugate-gradient methods for nonsymmetrizable linear systems
- Orthogonal Error Methods
- QMR: A quasi-minimal residual method for non-Hermitian linear systems
- Some History of the Conjugate Gradient and Lanczos Algorithms: 1948–1976
- The Lanczos Biorthogonalization Algorithm and Other Oblique Projection Methods for Solving Large Unsymmetric Systems
- Variational Iterative Methods for Nonsymmetric Systems of Linear Equations
This page was built for publication: Breakdowns and stagnation in iterative methods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1359974)
