On convergence of a sketch-and-project method for the matrix equation AXB = C

DOI10.1007/S40314-024-02847-8MaRDI QIDQ6576445FDOQ6576445

Authors: Wendi Bao, Zhiwei Guo, Weiguo Li, Ying Lv 

Publication date: 22 July 2024

Published in: Computational and Applied Mathematics (Search for Journal in Brave)

Recommendations

• Some relaxed iteration methods for solving matrix equation \(AXB=C\)
• scientific article
• An iterative method for the skew-symmetric solution and the optimal approximate solution of the matrix equation \(AXB=C\)
• Two-step AOR iteration method for the linear matrix equation \(AXB=C\)
• A class of iteration methods for the matrix equation A×B = C

zbMATH Keywords

matrix equationrandomized Kaczmarz methodGaussian samplingrandomized coordinate descent methodsketch-and-project method

Mathematics Subject Classification ID

Numerical solutions to overdetermined systems, pseudoinverses (65F20) Numerical computation of solutions to systems of equations (65H10) Numerical solutions of ill-posed problems in abstract spaces; regularization (65J20)

Cites Work

• The University of Florida sparse matrix collection
• Title not available (Why is that?)
• Computational Methods for Linear Matrix Equations
• Re-nnd SOLUTIONS OF THE MATRIX EQUATION AXB=C
• Title not available (Why is that?)
• The matrix equation AXB+CYD=E
• Iterative least-squares solutions of coupled sylvester matrix equations
• Deblurring Images
• On the symmetric solutions of linear matrix equations
• Kronecker Products, Unitary Matrices and Signal Processing Applications
• On Hermitian and skew-Hermitian splitting iteration methods for the linear matrix equation \(AXB=C\)
• Randomized iterative methods for linear systems
• A matrix LSQR iterative method to solve matrix equation \(AXB=C\)
• The Jacobi and Gauss-Seidel-type iteration methods for the matrix equation \(A X B = C\)
• AIR tools II: algebraic iterative reconstruction methods, improved implementation
• Comments on Large Least Squares Problems Involving Kronecker Products
• On the convergence of a randomized block coordinate descent algorithm for a matrix least squares problem
• Developing Kaczmarz method for solving Sylvester matrix equations
• On the Kaczmarz methods based on relaxed greedy selection for solving matrix equation \(A X B = C\)

This page was built for publication: On convergence of a sketch-and-project method for the matrix equation \(AXB = C\)

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