.png){kind=icon}
返回
An adaptive multilevel factorized sparse approximate inverse preconditioning
.png){kind=icon}
PRE
AI
DOI：10.1016/j.advengsoft.2016.10.005.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This paper deals with adaptively preconditioned iterative methods for solving large and sparse systems of linear equations. In particular, the paper discusses preconditioning where adaptive dropping reflects the quality of preserving the relation UZ = I between the direct factor U and the inverse factor Z that satisfy A = (UU)-U-T and A(-1) = ZZ(T). The proposed strategy significantly extends and refines the approach from [1], see also [2], by using a specific multilevel framework. Numerical experiments with two levels demonstrate that the new preconditioning strategy is very promising. Namely, we show a surprising fact that in our approach the Schur complement is better to form in a more sophisticated way than by a standard sparse matrix-matrix multiplication. (C) 2016 Civil-Comp Ltd. and Elsevier Ltd. All rights reserved.
Keyword:
Approximate inverse
Gram-Schmidt orthogonalization
Incomplete factorization
Multilevel methods
Preconditioned conjugate gradient method
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
5.7
论文数:
3.3K
被引数:
1.2W
机构
引用论文
.png){kind=icon}
分享收藏
查看更多内容