Greedy block extended Kaczmarz method for solving the least squares problems

DOI10.1007/S40840-024-01739-8MaRDI QIDQ6601141zbMATH OpenFDO

Authors Ni-Hong Ke, Jun-Feng Yin

Publication date 10 September 2024

Published in Bulletin of the Malaysian Mathematical Sciences Society. Second Series (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S40840-024-01739-8

zbMATH Keywords

convergencegreedy blockleast squaresrandomized extended Kaczmarz method

Mathematics Subject Classification ID

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

Recommendations

• A greedy average block sparse Kaczmarz method for sparse solutions of linear systems
• On greedy randomized block Kaczmarz method for consistent linear systems
• Maximal residual extended Kaczmarz and Gauss-Seidel methods-convergence properties and applications
• Randomized block Kaczmarz method with projection for solving least squares

Cites work

• A class of residual-based extended Kaczmarz methods for solving inconsistent linear systems
• A geometric probability randomized Kaczmarz method for large scale linear systems
• A greedy block Kaczmarz algorithm for solving large-scale linear systems
• A randomized Kaczmarz algorithm with exponential convergence
• AIR tools II: algebraic iterative reconstruction methods, improved implementation
• Convergence properties of the randomized extended Gauss-Seidel and Kaczmarz methods
• Faster randomized block Kaczmarz algorithms
• Fundamentals of Computerized Tomography
• Greed Works: An Improved Analysis of Sampling Kaczmarz--Motzkin
• scientific article; zbMATH DE number 3532449 (Why is no real title available?)
• scientific article; zbMATH DE number 852536 (Why is no real title available?)
• On a fast deterministic block Kaczmarz method for solving large-scale linear systems
• On Adaptive Sketch-and-Project for Solving Linear Systems
• On greedy randomized augmented Kaczmarz method for solving large sparse inconsistent linear systems
• On greedy randomized Kaczmarz method for solving large sparse linear systems
• On Motzkin's method for inconsistent linear systems
• On partially randomized extended Kaczmarz method for solving large sparse overdetermined inconsistent linear systems
• On two-subspace randomized extended Kaczmarz method for solving large linear least-squares problems
• Preconditioning linear least-squares problems by identifying a basis matrix
• Randomized block Kaczmarz method with projection for solving least squares
• Randomized extended average block Kaczmarz for solving least squares
• Randomized extended Kaczmarz for solving least squares
• The University of Florida sparse matrix collection
• Tight upper bounds for the convergence of the randomized extended Kaczmarz and Gauss-Seidel algorithms.

Cited in

(3)

• Maximal residual extended Kaczmarz and Gauss-Seidel methods-convergence properties and applications
• Randomized block residual steepest descent method with k-means clustering for large sparse linear systems
• SSVRG-H: a stratified variance-reduced Horner method for the minimum-norm least squares problem

This page was built for publication: Greedy block extended Kaczmarz method for solving the least squares problems

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