A theoretical overview of Krylov subspace methods (Q1917418): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
Property / describes a project that uses | |||
Property / describes a project that uses: BiCGstab / rank | |||
Normal rank |
Revision as of 12:17, 29 February 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A theoretical overview of Krylov subspace methods |
scientific article |
Statements
A theoretical overview of Krylov subspace methods (English)
0 references
7 July 1996
0 references
This excellent paper contains a wide spectrum of iterative methods for solving linear systems. The author presents a survey of Krylov subspace methods for solving nonsymmetric and not positive definite linear systems. To provide a framework for these methods, the outline of an orthogonalization method is presented. Estimates of a norm of the residual and error vector for generalized minimum error methods and conjugate Krylov subspace methods, including BCG, BICO, QMR, TFQMR, the rank-3 update CKS method, the residual or error-minimizing CG, and the energy norm-minimizing CG are given. Discussion and practical experiences with described methods conclude this paper.
0 references
iterative methods
0 references
Krylov subspace methods
0 references
orthogonalization method
0 references
generalized minimum error methods
0 references