Restarted randomized surrounding methods for solving large linear equations
From MaRDI portal
Publication:2161478
DOI10.1016/j.aml.2022.108290zbMath1496.65051arXiv2205.01388OpenAlexW4229053757WikidataQ114210457 ScholiaQ114210457MaRDI QIDQ2161478
Publication date: 4 August 2022
Published in: Applied Mathematics Letters (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2205.01388
Related Items
A surrogate hyperplane Kaczmarz method for solving consistent linear equations ⋮ On fast greedy block Kaczmarz methods for solving large consistent linear systems
Cites Work
- Unnamed Item
- 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
- On partially randomized extended Kaczmarz method for solving large sparse overdetermined inconsistent linear systems
- Randomized block Kaczmarz methods with \(k\)-means clustering for solving large linear systems
- Row-Action Methods for Huge and Sparse Systems and Their Applications
- A Novel Partitioning Method for Accelerating the Block Cimmino Algorithm
- On Greedy Randomized Kaczmarz Method for Solving Large Sparse Linear Systems
- Block Lanczos Techniques for Accelerating the Block Cimmino Method
- Surrounding the solution of a linear system of equations from all sides
- Kaczmarz-Type Inner-Iteration Preconditioned Flexible GMRES Methods for Consistent Linear Systems
This page was built for publication: Restarted randomized surrounding methods for solving large linear equations
