On fast greedy block Kaczmarz methods for solving large consistent linear systems
From MaRDI portal
Publication:2695685
DOI10.1007/s40314-023-02232-xOpenAlexW4360979891MaRDI QIDQ2695685
A.-Qin Xiao, Ning Zheng, Jun-Feng Yin
Publication date: 31 March 2023
Published in: Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2210.05128
Numerical solutions to overdetermined systems, pseudoinverses (65F20) Iterative numerical methods for linear systems (65F10) Linear equations (linear algebraic aspects) (15A06)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Block-iterative methods for consistent and inconsistent linear equations
- A randomized Kaczmarz algorithm with exponential convergence
- On relaxed greedy randomized Kaczmarz methods for solving large sparse linear systems
- On a fast deterministic block Kaczmarz method for solving large-scale linear systems
- On greedy randomized average block Kaczmarz method for solving large linear systems
- Restarted randomized surrounding methods for solving large linear equations
- A greedy block Kaczmarz algorithm for solving large-scale linear systems
- On partially randomized extended Kaczmarz method for solving large sparse overdetermined inconsistent linear systems
- Paved with good intentions: analysis of a randomized block Kaczmarz method
- The university of Florida sparse matrix collection
- Image reconstruction from a small number of projections
- On Greedy Randomized Kaczmarz Method for Solving Large Sparse Linear Systems
- Structure Preserving Quaternion Generalized Minimal Residual Method
- Kaczmarz-Type Inner-Iteration Preconditioned Flexible GMRES Methods for Consistent Linear Systems
- Faster Randomized Block Kaczmarz Algorithms
- Stochastic gradient descent, weighted sampling, and the randomized Kaczmarz algorithm
This page was built for publication: On fast greedy block Kaczmarz methods for solving large consistent linear systems
