Convergence analyses based on frequency decomposition for the randomized row iterative method
From MaRDI portal
(Redirected from Publication:4957751)
Recommendations
- Semiconvergence analysis of the randomized row iterative method and its extended variants.
- Preasymptotic convergence of randomized Kaczmarz method
- Randomized iterative methods for linear systems
- On the error estimate of the randomized double block Kaczmarz method
- Extension of an error analysis of the randomized Kaczmarz method for inconsistent linear systems
Cites work
- A randomized Kaczmarz algorithm with exponential convergence
- A weighted singular value decomposition for the discrete inverse problems.
- Acceleration of randomized Kaczmarz method via the Johnson-Lindenstrauss lemma
- An extended row and column method for solving linear systems on a quantum computer
- Convergence analysis of inexact randomized iterative methods
- Discrete inverse problems. Insight and algorithms.
- Faster randomized block Kaczmarz algorithms
- Fixing nonconvergence of algebraic iterative reconstruction with an unmatched backprojector
- Generalized inverses: theory and computations
- Generalized row-action methods for tomographic imaging
- Inverse problems. Tikhonov theory and algorithms
- On block Gaussian sketching for the Kaczmarz method
- On greedy randomized Kaczmarz method for solving large sparse linear systems
- On the regularizing property of stochastic gradient descent
- Parallel iterative methods for sparse linear systems
- Paved with good intentions: analysis of a randomized block Kaczmarz method
- Preasymptotic convergence of randomized Kaczmarz method
- Projected randomized Kaczmarz methods
- Random reordering in SOR-type methods
- Randomized Projection Methods for Linear Systems with Arbitrarily Large Sparse Corruptions
- Randomized algorithms for large-scale inverse problems with general Tikhonov regularizations
- Randomized block Kaczmarz method with projection for solving least squares
- Randomized extended average block Kaczmarz for solving least squares
- Randomized iterative methods for linear systems
- Regularization with randomized SVD for large-scale discrete inverse problems
- Semi-convergence and relaxation parameters for a class of SIRT algorithms
- Semi-convergence properties of Kaczmarz's method
- Semiconvergence analysis of the randomized row iterative method and its extended variants.
- Semiconvergence and Relaxation Parameters for Projected SIRT Algorithms
- Unmatched projector/backprojector pairs: perturbation and convergence analysis
- Weighted singular decomposition and weighted pseudoinversion of matrices
- Weighted singular value decomposition of matrices with singular weights based on weighted orthogonal transformations
Cited in
(6)- Randomized Douglas–Rachford Methods for Linear Systems: Improved Accuracy and Efficiency
- On the triple-parameter least squares progressive iterative approximation and its convergence analysis
- Semiconvergence analysis of the randomized row iterative method and its extended variants.
- On the relaxed greedy deterministic row and column iterative methods
- On pseudoinverse-free randomized methods for linear systems: unified framework and acceleration
- On the randomized multiple row-action methods for solving linear least-squares problems
This page was built for publication: Convergence analyses based on frequency decomposition for the randomized row iterative method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4957751)
