Convergence analyses based on frequency decomposition for the randomized row iterative method

DOI10.1088/1361-6420/ac1778zbMath1481.65053OpenAlexW3185999566MaRDI QIDQ4957751

Nianci Wu, Hua Xiang

Publication date: 9 September 2021

Published in: Inverse Problems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1088/1361-6420/ac1778

zbMATH Keywords

convergence analysisweighted SVDhigh-frequency errorlow-frequency errorrandomized row iterative method

Mathematics Subject Classification ID

Iterative numerical methods for linear systems (65F10) Linear equations (linear algebraic aspects) (15A06)

Related Items (2)

On the relaxed greedy deterministic row and column iterative methods ⋮ Randomized Douglas–Rachford Methods for Linear Systems: Improved Accuracy and Efficiency

Cites Work

• Unnamed Item
• Randomized block Kaczmarz method with projection for solving least squares
• Random reordering in SOR-type methods
• Semi-convergence and relaxation parameters for a class of SIRT algorithms
• Acceleration of randomized Kaczmarz method via the Johnson-Lindenstrauss lemma
• Generalized row-action methods for tomographic imaging
• Weighted singular value decomposition of matrices with singular weights based on weighted orthogonal transformations
• A randomized Kaczmarz algorithm with exponential convergence
• Generalized inverses: theory and computations
• Weighted singular decomposition and weighted pseudoinversion of matrices
• On block Gaussian sketching for the Kaczmarz method
• An extended row and column method for solving linear systems on a quantum computer
• Projected randomized Kaczmarz methods
• Paved with good intentions: analysis of a randomized block Kaczmarz method
• Regularization with randomized SVD for large-scale discrete inverse problems
• Inverse Problems
• Semiconvergence and Relaxation Parameters for Projected SIRT Algorithms
• Randomized algorithms for large-scale inverse problems with general Tikhonov regularizations
• Randomized Iterative Methods for Linear Systems
• Preasymptotic convergence of randomized Kaczmarz method
• Unmatched Projector/Backprojector Pairs: Perturbation and Convergence Analysis
• On Greedy Randomized Kaczmarz Method for Solving Large Sparse Linear Systems
• A weighted singular value decomposition for the discrete inverse problems
• On the regularizing property of stochastic gradient descent
• Semi-convergence properties of Kaczmarz’s method
• Randomized Extended Average Block Kaczmarz for Solving Least Squares
• Faster Randomized Block Kaczmarz Algorithms
• Fixing Nonconvergence of Algebraic Iterative Reconstruction with an Unmatched Backprojector
• Randomized Projection Methods for Linear Systems with Arbitrarily Large Sparse Corruptions
• Discrete Inverse Problems
• Convergence Analysis of Inexact Randomized Iterative Methods
• Semiconvergence analysis of the randomized row iterative method and its extended variants

This page was built for publication: Convergence analyses based on frequency decomposition for the randomized row iterative method