On randomized partial block Kaczmarz method for solving huge linear algebraic systems
From MaRDI portal
Publication:2167431
DOI10.1007/s40314-022-01978-0OpenAlexW4290721972MaRDI QIDQ2167431
Publication date: 25 August 2022
Published in: Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s40314-022-01978-0
Kaczmarz methodconvergence propertyhuge linear algebraic systemsrandomized block Kaczmarz methodrandomized partial method
Numerical solutions to overdetermined systems, pseudoinverses (65F20) Iterative numerical methods for linear systems (65F10) Linear equations (linear algebraic aspects) (15A06)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Randomized block Kaczmarz method with projection for solving least squares
- Block-iterative methods for consistent and inconsistent linear 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
- Off-diagonal low-rank preconditioner for difficult PageRank problems
- 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
- A greedy block Kaczmarz algorithm for solving large-scale linear systems
- Numerically accurate code synthesis for Gauss pivoting method to solve linear systems coming from mechanics
- On the error estimate of the randomized double block Kaczmarz method
- 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
- On greedy randomized block Kaczmarz method for consistent linear systems
- Randomized block Kaczmarz methods with \(k\)-means clustering for solving large linear systems
- The university of Florida sparse matrix collection
- 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 Augmented Kaczmarz Method for Solving Large Sparse Inconsistent Linear Systems
- On Relaxed Greedy Randomized Augmented Kaczmarz Methods for Solving Large Sparse Inconsistent Linear Systems
- On greedy randomized coordinate descent methods for solving large linear least‐squares problems
This page was built for publication: On randomized partial block Kaczmarz method for solving huge linear algebraic systems
