A greedy block Kaczmarz algorithm for solving large-scale linear systems
From MaRDI portal
Publication:2176512
DOI10.1016/j.aml.2020.106294zbMath1439.65042OpenAlexW3005887107MaRDI QIDQ2176512
Publication date: 4 May 2020
Published in: Applied Mathematics Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.aml.2020.106294
Related Items (22)
A Deterministic Kaczmarz Algorithm for Solving Linear Systems ⋮ On global randomized block Kaczmarz method for image reconstruction ⋮ On the relaxed greedy deterministic row and column iterative methods ⋮ On greedy randomized block Kaczmarz method for consistent linear systems ⋮ On randomized partial block Kaczmarz method for solving huge linear algebraic systems ⋮ Randomized block Kaczmarz methods with \(k\)-means clustering for solving large linear systems ⋮ A semi-randomized Kaczmarz method with simple random sampling for large-scale linear systems ⋮ Deep Neural Networks for Solving Large Linear Systems Arising from High-Dimensional Problems ⋮ On adaptive block coordinate descent methods for ridge regression ⋮ On maximum residual nonlinear Kaczmarz-type algorithms for large nonlinear systems of equations ⋮ A surrogate hyperplane Kaczmarz method for solving consistent linear equations ⋮ Faster Deterministic Pseudoinverse-Free Block Extension of Motzkin Method for Large Consistent Linear Systems ⋮ On pseudoinverse-free block maximum residual nonlinear Kaczmarz method for solving large-scale nonlinear system of equations ⋮ On fast greedy block Kaczmarz methods for solving large consistent linear systems ⋮ Splitting-based randomized iterative methods for solving indefinite least squares problem ⋮ Randomized block subsampling Kaczmarz-Motzkin method ⋮ Block sampling Kaczmarz-Motzkin methods for consistent linear systems ⋮ A doubly stochastic block Gauss-Seidel algorithm for solving linear equations ⋮ Randomized double and triple Kaczmarz for solving extended normal equations ⋮ Kaczmarz method for fuzzy linear systems ⋮ On Adaptive Sketch-and-Project for Solving Linear Systems ⋮ On a fast deterministic block Kaczmarz method for solving large-scale linear systems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Randomized block Kaczmarz method with projection for solving least squares
- Acceleration of randomized Kaczmarz method via the Johnson-Lindenstrauss lemma
- Block-iterative methods for consistent and inconsistent linear equations
- Connections between the Cimmino-method and the Kaczmarz-method for the solution of singular and regular systems of equations
- A randomized Kaczmarz algorithm with exponential convergence
- Iterative algorithms for large partitioned linear systems, with applications to image reconstruction
- An iterative procedure for the solution of constrained nonlinear equations with application to optimization problems
- Paved with good intentions: analysis of a randomized block Kaczmarz method
- Randomized Extended Kaczmarz for Solving Least Squares
- The university of Florida sparse matrix collection
- Randomized Methods for Linear Constraints: Convergence Rates and Conditioning
- Convergence Properties of the Randomized Extended Gauss--Seidel and Kaczmarz Methods
- On Greedy Randomized Kaczmarz Method for Solving Large Sparse Linear Systems
- Tight upper bounds for the convergence of the randomized extended Kaczmarz and Gauss–Seidel algorithms
This page was built for publication: A greedy block Kaczmarz algorithm for solving large-scale linear systems
