A unified approach to Krylov subspace methods for solving linear systems
From MaRDI portal
(Redirected from Publication:6126599)
Recommendations
- A theoretical overview of Krylov subspace methods
- Analysis of the convergence of the minimal and the orthogonal residual methods
- Convergence analysis of Krylov subspace methods
- scientific article; zbMATH DE number 992795
- The effect of the spectral properties of the linear system matrix on the convergence of some Krylov methods
Cites work
- A Look-Ahead Lanczos Algorithm for Unsymmetric Matrices
- A new look at CMRH and its relation to GMRES
- An enhancement of the convergence of the IDR method
- An Implementation of the Look-Ahead Lanczos Algorithm for Non-Hermitian Matrices
- Avoiding breakdown in the CGS algorithm
- 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
- CMRH: A new method for solving nonsymmetric linear systems based on the Hessenberg reduction algorithm
- Generalized inverses. Theory and applications.
- GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
- scientific article; zbMATH DE number 3511513 (Why is no real title available?)
- scientific article; zbMATH DE number 1953446 (Why is no real title available?)
- scientific article; zbMATH DE number 3408799 (Why is no real title available?)
- Iterative Krylov Methods for Large Linear Systems
- Krylov methods for nonsymmetric linear systems. From theory to computations
- Krylov subspace methods. Principles and analysis.
- Lanczos Methods for the Solution of Nonsymmetric Systems of Linear Equations
- Methods of conjugate gradients for solving linear systems
- On a variable smoothing procedure for Krylov subspace methods
- On certain methods for expanding the characteristic polynomial
- QMR: A quasi-minimal residual method for non-Hermitian linear systems
- Reduction to Tridiagonal Form and Minimal Realizations
- Some Applications of the Pseudoinverse of a Matrix
- The Gauss quadrature for general linear functionals, Lanczos algorithm, and minimal partial realization
- The matrix and polynomial approaches to Lanczos-type algorithms
Cited in
(3)- A modified CMRH method for solving large nonsymmetric linear systems
- Variable s-step generalized semi-conjugate gradient algorithm for solving nonsymmetric linear systems arising in signal recovery
- A fixed-time convergent robust zeroing neural network for time-varying linear matrix equation with application
This page was built for publication: A unified approach to Krylov subspace methods for solving linear systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6126599)
