Regularized randomized iterative algorithms for factorized linear systems
APPLIED MATHEMATICS AND COMPUTATION(2024)
Abstract
Randomized iterative algorithms for solving the factorized linear system, ABx = b with A is an element of Lambda 4 ??????x ??????, B is an element of Lambda 4 ??????x ??????, and b is an element of Lambda 4 ??????, have recently been proposed. They take advantage of the factorized form and avoid forming the matrix C = AB explicitly. However, they can only find the minimum norm (least squares) solution. In contrast, the regularized randomized Kaczmarz (RRK) algorithm can find solutions with certain structures from consistent linear systems. In this work, by combining the randomized Kaczmarz algorithm or the randomized Gauss-Seidel algorithm with the RRK algorithm, we propose two new regularized randomized iterative algorithms to find (least squares) solutions with certain structures of ABx = b. We prove linear convergence of the new algorithms. Computed examples are given to illustrate that the new algorithms can find sparse (least squares) solutions of ABx = b and can be better than the existing randomized iterative algorithms for the corresponding full linear system Cx = b with C = AB.
MoreTranslated text
Key words
Factorized linear systems,Randomized Kaczmarz,Randomized Gauss-Seidel,Linear convergence,Sparse (least squares) solutions
AI Read Science
Must-Reading Tree
Example
![](https://originalfileserver.aminer.cn/sys/aminer/pubs/mrt_preview.jpeg)
Generate MRT to find the research sequence of this paper
Chat Paper
Summary is being generated by the instructions you defined