Kaczmarz-Type Inner-Iteration Preconditioned Flexible GMRES Methods for Consistent Linear Systems
From MaRDI portal
Publication:4997391
DOI10.1137/20M1344937MaRDI QIDQ4997391
Jun-Feng Yin, Keiichi Morikuni, Ning Zheng, Yi-Shu Du, Ken Hayami
Publication date: 29 June 2021
Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2006.10818
linear systemiterative methodoverdetermined systemGMRESrandomized algorithmpreconditionerleast squares problemKaczmarz methodunderdetermined systeminner-outer iterationflexible GMRES
Computational methods for sparse matrices (65F50) Iterative numerical methods for linear systems (65F10) Linear equations (linear algebraic aspects) (15A06) Preconditioners for iterative methods (65F08)
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Distributed estimation via iterative projections with application to power network monitoring
- Connections between the Cimmino-method and the Kaczmarz-method for the solution of singular and regular systems of equations
- GPU computing with Kaczmarz's and other iterative algorithms for linear systems
- A randomized Kaczmarz algorithm with exponential convergence
- Parallel application of block-iterative methods in medical imaging and radiation therapy
- Iterative algorithms for large partitioned linear systems, with applications to image reconstruction
- On convergence rate of the randomized Kaczmarz method
- On relaxed greedy randomized Kaczmarz methods for solving large sparse linear systems
- On the Meany inequality with applications to convergence analysis of several row-action iteration methods
- On partially randomized extended Kaczmarz method for solving large sparse overdetermined inconsistent linear systems
- Implementation of interior-point methods for LP based on Krylov subspace iterative solvers with inner-iteration preconditioning
- Multistep matrix splitting iteration preconditioning for singular linear systems
- Convergence rates for Kaczmarz-type algorithms
- Projection method for solving a singular system of linear equations and its applications
- Atomic Decomposition by Basis Pursuit
- LSRN: A Parallel Iterative Solver for Strongly Over- or Underdetermined Systems
- The university of Florida sparse matrix collection
- A fast randomized algorithm for overdetermined linear least-squares regression
- GMRES Methods for Least Squares Problems
- Blendenpik: Supercharging LAPACK's Least-Squares Solver
- A Randomized Solver for Linear Systems with Exponential Convergence
- GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
- Row-Action Methods for Huge and Sparse Systems and Their Applications
- Solution of Sparse Indefinite Systems of Linear Equations
- Accelerated projection methods for computing pseudoinverse solutions of systems of linear equations
- A unified treatment of some iterative algorithms in signal processing and image reconstruction
- On Greedy Randomized Kaczmarz Method for Solving Large Sparse Linear Systems
- On greedy randomized coordinate descent methods for solving large linear least‐squares problems
- Convergence of Inner-Iteration GMRES Methods for Rank-Deficient Least Squares Problems
- Randomized Approximation of the Gram Matrix: Exact Computation and Probabilistic Bounds
- A Flexible Inner-Outer Preconditioned GMRES Algorithm
- Inner-Iteration Krylov Subspace Methods for Least Squares Problems
- Methods of conjugate gradients for solving linear systems
- The N‐Step Iteration Procedures