A geometric view of Krylov subspace methods on singular systems
Publication:2889396
DOI10.1002/nla.737zbMath1245.65037OpenAlexW2128038070MaRDI QIDQ2889396
Publication date: 7 June 2012
Published in: Numerical Linear Algebra with Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/nla.737
algorithmssingular systemGMRESleast-squaresKrylov subspace methodtwo-point boundary value problemsGCR
Numerical solutions to overdetermined systems, pseudoinverses (65F20) Iterative numerical methods for linear systems (65F10) Numerical solution of boundary value problems involving ordinary differential equations (65L10) Linear boundary value problems for ordinary differential equations (34B05)
Related Items (11)
Uses Software
Cites Work
- Unnamed Item
- The conjugate gradient method for computing all the extremal stationary probability vectors of a stochastic matrix
- On the solution of singular linear systems of algebraic equations by semiiterative methods
- Preconditioned conjugate gradients for solving singular systems
- QMR: A quasi-minimal residual method for non-Hermitian linear systems
- Characterization of linear stationary iterative processes for solving a singular system of linear equations
- A Chebyshev-like semiiteration for inconsistent linear systems
- GMRES-type methods for inconsistent systems
- Necessary and sufficient conditions for the convergence of \(\text{Orthomin}(k)\) on singular and inconsistent linear systems
- Orthogonal polynomials and semi-iterative methods for the Drazin-inverse solution of singular linear systems
- A note on conjugate-gradient type methods for indefinite and/or inconsistent linear systems
- Nested Krylov methods based on GCR
- Some results about GMRES in the singular case
- The design and analysis of the generalized finite element method
- Convergence properties of Krylov subspace methods for singular linear systems with arbitrary index
- The Idea behind Krylov Methods
- Variational Iterative Methods for Nonsymmetric Systems of Linear Equations
- GMRES On (Nearly) Singular Systems
- GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
- CGS, A Fast Lanczos-Type Solver for Nonsymmetric Linear systems
- Bi-CGSTAB: A Fast and Smoothly Converging Variant of Bi-CG for the Solution of Nonsymmetric Linear Systems
- Truncation Strategies for Optimal Krylov Subspace Methods
- Comparison of Partitioning Techniques for Two-Level Iterative Solvers on Large, Sparse Markov Chains
- GMRESR: a family of nested GMRES methods
- On the use of two QMR algorithms for solving singular systems and applications in Markov chain modeling
- A Transpose-Free Quasi-Minimal Residual Algorithm for Non-Hermitian Linear Systems
- On the Convergence of the Conjugate Gradient Method for Singular Linear Operator Equations
- The Convergence of Linear Stationary Iterative Processes for Solving Singular Unstructured Systems of Linear Equations
- DGMRES: A GMRES-type algorithm for Drazin-inverse solution of singular nonsymmetric linear systems
- A unified approach to Krylov subspace methods for the Drazin-inverse solution of singular nonsymmetric linear systems
This page was built for publication: A geometric view of Krylov subspace methods on singular systems