Reflective block Kaczmarz algorithms for least squares
From MaRDI portal
Recommendations
Cites work
- A Deterministic Kaczmarz Algorithm for Solving Linear Systems
- A randomized Kaczmarz algorithm with exponential convergence
- A Storage-Efficient WY Representation for Products of Householder Transformations
- An accelerated randomized Kaczmarz algorithm
- An Elsner-like perturbation theorem for generalized eigenvalues
- Angenäherte Auflösung von Systemen linearer Gleichungen.
- Aufgabe 245. (Gestellt in Jber. Deutsche Math.-Verein. 47 (1937), 39 kursiv.) Lösung von H. S. M. Coxeter.
- Block-iterative methods for consistent and inconsistent linear equations
- Calcolo approssimato per le soluzioni dei sistemi di equazioni lineari.
- Convergence properties of the randomized extended Gauss-Seidel and Kaczmarz methods
- Decoding by Linear Programming
- Faster randomized block Kaczmarz algorithms
- scientific article; zbMATH DE number 47363 (Why is no real title available?)
- Paved with good intentions: analysis of a randomized block Kaczmarz method
- Perturbation theorems for the generalized eigenvalue problem
- Randomized block Kaczmarz method with projection for solving least squares
- Randomized Douglas–Rachford Methods for Linear Systems: Improved Accuracy and Efficiency
- Randomized extended Kaczmarz for solving least squares
- Randomized iterative methods for linear systems
- Randomized Kaczmarz solver for noisy linear systems
- Randomized Kaczmarz with averaging
- Sketching as a tool for numerical linear algebra
- Surrounding the solution of a linear system of equations from all sides
- The product of three reflections
- Triangular truncation and finding the norm of a Hadamard multiplier
This page was built for publication: Reflective block Kaczmarz algorithms for least squares
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6635270)
