A geometric view of Krylov subspace methods on singular systems.
From MaRDI portal
Three Krylov subspace methods, GMRES, restarted GMRES and restarted GCR, are analyzed in their behavior when applied to singular square nonsymmetric systems of linear equations. With an emphasis on geometric aspects, the quantities in the algorithms are decomposed into their components in the range of the coefficient matrix and its orthogonal complement. Extensions, new interpretations and new proofs of previous results of Brown and Walker on when these algorithms yield least-squares solutions and when they break down, i.e., terminate before such a solution is found, are given. The paper concludes with examples of singular systems arising in the discretization of two-point boundary value problems.
Recommendations
- Geometric aspects of the theory of Krylov subspace methods
- A note on Krylov subspace methods for singular systems
- scientific article; zbMATH DE number 5904757
- Corrigendum to: A geometric view of Krylov subspace methods on singular systems
- Corrigendum 2 to: ``A geometric view of Krylov subspace methods on singular systems
- Krylov Subspace Methods
- scientific article; zbMATH DE number 2239338
- A theoretical overview of Krylov subspace methods
- Krylov subspace methods. Principles and analysis.
- scientific article; zbMATH DE number 16954
Cites work
- A Chebyshev-like semiiteration for inconsistent linear systems
- A note on conjugate-gradient type methods for indefinite and/or inconsistent linear systems
- A Transpose-Free Quasi-Minimal Residual Algorithm for Non-Hermitian Linear Systems
- A unified approach to Krylov subspace methods for the Drazin-inverse solution of singular nonsymmetric linear systems
- 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
- Characterization of linear stationary iterative processes for solving a singular system of linear equations
- Comparison of Partitioning Techniques for Two-Level Iterative Solvers on Large, Sparse Markov Chains
- Convergence properties of Krylov subspace methods for singular linear systems with arbitrary index
- DGMRES: A GMRES-type algorithm for Drazin-inverse solution of singular nonsymmetric linear systems
- GMRES On (Nearly) Singular Systems
- GMRES-type methods for inconsistent systems
- GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
- GMRESR: a family of nested GMRES methods
- scientific article; zbMATH DE number 1953444 (Why is no real title available?)
- Necessary and sufficient conditions for the convergence of \(\text{Orthomin}(k)\) on singular and inconsistent linear systems
- Nested Krylov methods based on GCR
- On the Convergence of the Conjugate Gradient Method for Singular Linear Operator Equations
- On the solution of singular linear systems of algebraic equations by semiiterative methods
- On the use of two QMR algorithms for solving singular systems and applications in Markov chain modeling
- Orthogonal polynomials and semi-iterative methods for the Drazin-inverse solution of singular linear systems
- Preconditioned conjugate gradients for solving singular systems
- QMR: A quasi-minimal residual method for non-Hermitian linear systems
- Some results about GMRES in the singular case
- The conjugate gradient method for computing all the extremal stationary probability vectors of a stochastic matrix
- The Convergence of Linear Stationary Iterative Processes for Solving Singular Unstructured Systems of Linear Equations
- The design and analysis of the generalized finite element method
- The Idea behind Krylov Methods
- Truncation Strategies for Optimal Krylov Subspace Methods
- Variational Iterative Methods for Nonsymmetric Systems of Linear Equations
Cited in
(26)- The behavior of symmetric Krylov subspace methods for solving \(Mx=(M-\gamma I)v\).
- A note on Krylov subspace methods for singular systems
- Simple efficient solvers for certain ill-conditioned systems of linear equations, including \(H(\operatorname{div})\) problems
- Convergence properties of Krylov subspace methods for singular linear systems with arbitrary index
- Incompressible SPH (ISPH) with fast Poisson solver on a GPU
- GMRES using pseudoinverse for range symmetric singular systems
- A stabilized GMRES method for singular and severely ill-conditioned systems of linear equations
- Multistep matrix splitting iteration preconditioning for singular linear systems
- On the preconditioned MINRES method for solving singular linear systems
- The Idea behind Krylov Methods
- Algebraic two-level convergence theory for singular systems
- scientific article; zbMATH DE number 5904757 (Why is no real title available?)
- MINRES-QLP: a Krylov subspace method for indefinite or singular symmetric systems
- Corrigendum 2 to: ``A geometric view of Krylov subspace methods on singular systems
- Corrigendum to: A geometric view of Krylov subspace methods on singular systems
- On the convergence of two-level Krylov methods for singular symmetric systems.
- Projections, deflation, and multigrid for nonsymmetric matrices
- Convergence of inner-iteration GMRES methods for rank-deficient least squares problems
- Breakdown-free GMRES for Singular Systems
- Algebraic multigrid for Stokes equations
- On Krylov subspace methods for skew-symmetric and shifted skew-symmetric linear systems
- New convergence analysis of GMRES with weighted norms, preconditioning, and deflation, leading to a new deflation space
- A unified convergence analysis of random sketch methods for rank deficient linear systems
- Two-sided preconditioned CGLS for the solution of factorized linear systems
- RSMAR: an iterative method for range-symmetric linear systems
- An inexact matrix-Newton method for solving NEPv
This page was built for publication: A geometric view of Krylov subspace methods on singular systems.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2889396)
