Convergence of Inner-Iteration GMRES Methods for Rank-Deficient Least Squares Problems
From MaRDI portal
Publication:5251734
DOI10.1137/130946009zbMath1315.65041OpenAlexW1968743256MaRDI QIDQ5251734
Publication date: 21 May 2015
Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/130946009
numerical experimentsiterative methodssuccessive overrelaxationpreconditionerleast squares problemsgeneralized minimal residual (GMRES) methodinner-outer iterationstationary iterative methodrank-deficient problem
Numerical solutions to overdetermined systems, pseudoinverses (65F20) Iterative numerical methods for linear systems (65F10) Preconditioners for iterative methods (65F08)
Related Items
On the computation of a truncated SVD of a large linear discrete ill-posed problem ⋮ Multistep matrix splitting iteration preconditioning for singular linear systems ⋮ A stabilized GMRES method for singular and severely ill-conditioned systems of linear equations ⋮ GMRES methods for tomographic reconstruction with an unmatched back projector ⋮ Hierarchical orthogonal factorization: sparse least squares problems ⋮ Jacobian-free implicit inner-iteration preconditioner for nonlinear least squares problems ⋮ On GMRES for Singular EP and GP Systems ⋮ On the preconditioned MINRES method for solving singular linear systems ⋮ On Using Cholesky-Based Factorizations and Regularization for Solving Rank-Deficient Sparse Linear Least-Squares Problems ⋮ Kaczmarz-Type Inner-Iteration Preconditioned Flexible GMRES Methods for Consistent Linear Systems ⋮ Two-stage iterations based on composite splittings for rectangular linear systems ⋮ Projection Method for Eigenvalue Problems of Linear Nonsquare Matrix Pencils ⋮ Implementation of interior-point methods for LP based on Krylov subspace iterative solvers with inner-iteration preconditioning ⋮ Flexible Krylov Methods for $\ell_p$ Regularization ⋮ Kaczmarz-Type Inner-Iteration Preconditioned Flexible GMRES Methods for Consistent Linear Systems ⋮ Approximate Generalized Inverses with Iterative Refinement for $\epsilon$-Accurate Preconditioning of Singular Systems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Prescribing the behavior of early terminating GMRES and Arnoldi iterations
- Greville's method for preconditioning least squares problems
- Characterization of linear stationary iterative processes for solving a singular system of linear equations
- Krylov sequences of maximal length and convergence of GMRES
- Sharp error bounds of some Krylov subspace methods for non-Hermitian linear systems
- Spectral behaviour of GMRES applied to singular systems
- Infinite powers of matrices and characteristic roots
- A geometric view of Krylov subspace methods on singular systems
- The university of Florida sparse matrix collection
- Algorithm 915, SuiteSparseQR
- GMRES Methods for Least Squares Problems
- LSMR: An Iterative Algorithm for Sparse Least-Squares Problems
- GMRES On (Nearly) Singular Systems
- GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
- LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares
- Bi-CGSTAB: A Fast and Smoothly Converging Variant of Bi-CG for the Solution of Nonsymmetric Linear Systems
- Solution of Sparse Indefinite Systems of Linear Equations
- An Iterative Solution Method for Linear Systems of Which the Coefficient Matrix is a Symmetric M-Matrix
- Convergent Powers of a Matrix with Applications to Iterative Methods for Singular Linear Systems
- Accelerated projection methods for computing pseudoinverse solutions of systems of linear equations
- Any Nonincreasing Convergence Curve is Possible for GMRES
- Inner-Iteration Krylov Subspace Methods for Least Squares Problems
- On the Solution of Singular and Semidefinite Linear Systems by Iteration
- The Convergence of Linear Stationary Iterative Processes for Solving Singular Unstructured Systems of Linear Equations
- Methods of conjugate gradients for solving linear systems
- The N‐Step Iteration Procedures
