.png){kind=icon}
返回
Parallel preconditioning with sparse approximate inverses
.png){kind=icon}
PRE
AI
DOI：10.1137/S1064827594276552.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
A parallel preconditioner is presented for the solution of general sparse linear systems of equations. A sparse approximate inverse is computed explicitly and then applied as a preconditioner to an iterative method. The computation of the preconditioner is inherently parallel, and its application only requires a matrix-vector product. The sparsity pattern of the approximate inverse is not imposed a priori but captured automatically. This keeps the amount of work and the number of nonzero entries in the preconditioner to a minimum. Rigorous bounds on the clustering of the eigenvalues and the singular values are derived for the preconditioned system, and the proximity of the approximate to the true inverse is estimated, An extensive set of test problems from scientific and industrial applications provides convincing evidence of the effectiveness of this approach.
Keyword:
preconditioning
approximate inverses
parallel algorithms
sparse matrices
sparse linear systems
iterative methods
期刊
IF:
2.6
论文数:
5.1K
被引数:
1.8W
机构
暂无机构信息
引用论文
.png){kind=icon}
没有更多内容
没有更多内容