On the alternating randomized row-action methods with the application to data fitting

DOI10.1007/S00025-026-02708-2MaRDI QIDQ7316482zbMATH OpenFDO

Authors Nianci Wu, Yang Zhou

Publication date 19 August 2026

Published in Results in Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S00025-026-02708-2

Mathematics Subject Classification ID

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

Cites work

• A count sketch maximal weighted residual Kaczmarz method for solving highly overdetermined linear systems
• A fast randomized algorithm for the approximation of matrices
• A randomized block Douglas-Rachford method for solving linear matrix equation
• An accelerated randomized Kaczmarz algorithm
• An Improved Analysis and Unified Perspective on Deterministic and Randomized Low-Rank Matrix Approximation
• Computational Methods for Linear Matrix Equations
• Convergence analysis of inexact randomized iterative methods
• Deblurring Images
• Developing Kaczmarz method for solving Sylvester matrix equations
• Fast and forward stable randomized algorithms for linear least-squares problems
• scientific article; zbMATH DE number 981250 (Why is no real title available?)
• scientific article; zbMATH DE number 1953444 (Why is no real title available?)
• scientific article; zbMATH DE number 1932411 (Why is no real title available?)
• scientific article; zbMATH DE number 3027894 (Why is no real title available?)
• Iterative solutions of the generalized Sylvester matrix equations by using the hierarchical identification principle
• Kaczmarz-type methods for solving matrix equations
• Large Least Squares Problems Involving Kronecker Products
• On a Hermitian and skew-Hermitian splitting iteration method for continuous Sylvester equations
• On convergence of a sketch-and-project method for the matrix equation AXB = C
• On Hermitian and skew-Hermitian splitting iteration methods for the linear matrix equation \(AXB=C\)
• On the convergence of a randomized block coordinate descent algorithm for a matrix least squares problem
• On the error estimate of the randomized double block Kaczmarz method
• On the Kaczmarz methods based on relaxed greedy selection for solving matrix equation A X B = C
• On the randomized block Kaczmarz algorithms for solving matrix equation \(A X B = C\)
• Paved with good intentions: analysis of a randomized block Kaczmarz method
• Randomized block Kaczmarz method with projection for solving least squares
• Randomized Douglas–Rachford Methods for Linear Systems: Improved Accuracy and Efficiency
• Row-Action Methods for Huge and Sparse Systems and Their Applications
• Spherical conformal parameterization of genus-0 point clouds for meshing
• Stationary splitting iterative methods for the matrix equation AXB=C
• The Jacobi and Gauss-Seidel-type iteration methods for the matrix equation A X B = C
• The Numerical Solution of Parabolic and Elliptic Differential Equations
• The Reflection Method for the Numerical Solution of Linear Systems
• Tight upper bounds for the convergence of the randomized extended Kaczmarz and Gauss-Seidel algorithms.

This page was built for publication: On the alternating randomized row-action methods with the application to data fitting

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