Restarted relaxed greedy randomized surrounding method for large sparse linear systems
From MaRDI portal
Iterative numerical methods for linear systems (65F10) Numerical solutions to overdetermined systems, pseudoinverses (65F20) Computational methods for sparse matrices (65F50) Randomized algorithms (68W20) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08)
Cites work
- A Jacobi--Davidson type SVD method
- A randomized Kaczmarz algorithm with exponential convergence
- A system of coupled two-sided Sylvester-type tensor equations over the quaternion algebra
- A unified treatment of some iterative algorithms in signal processing and image reconstruction
- An accelerated randomized Kaczmarz algorithm
- An efficient method for solving a matrix least squares problem over a matrix inequality constraint
- Conditional gradient Tikhonov method for a convex optimization problem in image restoration
- Developing iterative algorithms to solve Sylvester tensor equations
- Fractional Tikhonov regularization for linear discrete ill-posed problems
- GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
- GPU computing with Kaczmarz's and other iterative algorithms for linear systems
- Hermitian and Skew-Hermitian Splitting Methods for Non-Hermitian Positive Definite Linear Systems
- scientific article; zbMATH DE number 1953444 (Why is no real title available?)
- scientific article; zbMATH DE number 3027894 (Why is no real title available?)
- scientific article; zbMATH DE number 3029984 (Why is no real title available?)
- Kaczmarz-type inner-iteration preconditioned flexible GMRES methods for consistent linear systems
- On convergence rates of Kaczmarz-type methods with different selection rules of working rows
- On greedy randomized block Kaczmarz method for consistent linear systems
- On greedy randomized Kaczmarz method for solving large sparse linear systems
- On relaxed greedy randomized Kaczmarz methods for solving large sparse linear systems
- On RGI algorithms for solving Sylvester tensor equations
- Preconditioned Hermitian and skew-Hermitian splitting methods for non-Hemitian positive semidefinite linear systems
- QMR: A quasi-minimal residual method for non-Hermitian linear systems
- Randomized block Kaczmarz methods with k-means clustering for solving large linear systems
- Randomized Kaczmarz solver for noisy linear systems
- Regularization parameter determination for discrete ill-posed problems
- Restarted randomized surrounding methods for solving large linear equations
- Surrounding the solution of a linear system of equations from all sides
- The mathematics of computerized tomography
This page was built for publication: Restarted relaxed greedy randomized surrounding method for large sparse linear systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7396532)
