On multi-step greedy Kaczmarz method for solving large sparse consistent linear systems

DOI10.1007/S42967-023-00358-7MaRDI QIDQ6940683zbMATH OpenFDO

Authors Longze Tan, Mingyu Deng, Xue-Ping Guo

Publication date 19 August 2025

Published in Communications on Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S42967-023-00358-7

zbMATH Keywords

convergencegreedy randomized Kaczmarz (GRK) methodKaczmarz methodmulti-step greedy Kaczmarz methodsystem of linear equations

Mathematics Subject Classification ID

Iterative numerical methods for linear systems (65F10) Numerical solutions to overdetermined systems, pseudoinverses (65F20) Numerical mathematical programming methods (65K05)

Cites work

• A new greedy Kaczmarz algorithm for the solution of very large linear systems
• A new theoretical estimate for the convergence rate of the maximal weighted residual Kaczmarz algorithm
• A randomized Kaczmarz algorithm with exponential convergence
• A unified treatment of some iterative algorithms in signal processing and image reconstruction
• Angenäherte Auflösung von Systemen linearer Gleichungen.
• Connections between the Cimmino-method and the Kaczmarz-method for the solution of singular and regular systems of equations
• Convergence properties of the randomized extended Gauss-Seidel and Kaczmarz methods
• Distributed estimation via iterative projections with application to power network monitoring
• GPU computing with Kaczmarz's and other iterative algorithms for linear systems
• scientific article; zbMATH DE number 3532449 (Why is no real title available?)
• scientific article; zbMATH DE number 2069438 (Why is no real title available?)
• scientific article; zbMATH DE number 2111135 (Why is no real title available?)
• Image reconstruction from a small number of projections
• Iterative algorithms for large partitioned linear systems, with applications to image reconstruction
• Multi-step greedy Kaczmarz algorithms with simple random sampling for solving large linear systems
• On convergence rate of the randomized Kaczmarz method
• On convergence rates of Kaczmarz-type methods with different selection rules of working rows
• On greedy randomized coordinate descent methods for solving large linear least-squares problems.
• On greedy randomized Kaczmarz method for solving large sparse linear systems
• On multi-step greedy randomized coordinate descent method for solving large linear least-squares problems
• On multi-step randomized extended Kaczmarz method for solving large sparse inconsistent linear systems
• On partially randomized extended Kaczmarz method for solving large sparse overdetermined inconsistent linear systems
• On relaxed greedy randomized coordinate descent methods for solving large linear least-squares problems
• On relaxed greedy randomized Kaczmarz methods for solving large sparse linear systems
• On the Meany inequality with applications to convergence analysis of several row-action iteration methods
• On the numerical behavior of matrix splitting iteration methods for solving linear systems
• Parallel application of block-iterative methods in medical imaging and radiation therapy
• Paved with good intentions: analysis of a randomized block Kaczmarz method
• Projection methods for linear systems
• Randomized extended Kaczmarz for solving least squares
• Randomized iterative methods for linear systems
• Randomized Kaczmarz iteration methods: algorithmic extensions and convergence theory
• Randomized Kaczmarz solver for noisy linear systems
• Randomized methods for linear constraints: convergence rates and conditioning
• Row-Action Methods for Huge and Sparse Systems and Their Applications
• The mathematics of computerized tomography
• The University of Florida sparse matrix collection

This page was built for publication: On multi-step greedy Kaczmarz method for solving large sparse consistent linear systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6940683)