On randomized partial block Kaczmarz method for solving huge linear algebraic systems
Computational and Applied Mathematics(2022)
Abstract
This paper investigates the numerical solution of huge linear algebraic systems, in which the number of rows or columns of the coefficient matrix A is greater than 100,000. Considering the idea of K -means algorithm and removing partial row vectors with small initial residuals, we propose a partitioning strategy and construct the randomized partial block Kaczmarz method. The working block of each iteration is randomly selected by using the uniform distribution, and the convergence property is also analyzed. Numerical examples illustrate the effectiveness of the proposed method.
MoreTranslated text
Key words
Huge linear algebraic systems,Kaczmarz method,Randomized block Kaczmarz method,Randomized partial method,Convergence property
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