.png){kind=icon}
返回
Exploiting multilevel preconditioning techniques in eigenvalue computations
.png){kind=icon}
OA
AI
DOI：10.1137/S1064827599361059.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In the Davidson method, any preconditioner can be exploited for the iterative computation of eigenpairs. However, the convergence of the eigenproblem solver may be poor for a high quality preconditioner. Theoretically, this counter-intuitive phenomenon with the Davidson method is remedied by the Jacobi-Davidson approach, where the preconditioned system is restricted to appropriate subspaces of codimension one. However, it is not clear how the restricted system can be solved accurately and efficiently in the case of a good preconditioner. The obvious approach introduces instabilities that hamper convergence. In this paper, we show how incomplete decomposition based on multilevel approaches can be used in a stable way. We also show how these preconditioners can be efficiently improved when better approximations for the eigenvalue of interest become available. The additional costs for updating the preconditioners are negligible. Furthermore, our approach leads to a good initial guess for the wanted eigenpair and to high quality preconditioners for nearby eigenvalues. We illustrate our ideas for the MRILU preconditioner.
Keyword:
eigenvalues and eigenvectors
Davidson method
Jacobi-Davidson
multilevel ILU-preconditioners
期刊
IF:
2.6
论文数:
5.1K
被引数:
1.8W
机构
暂无机构信息
引用论文
COVID‐19 antibody screening with SARS‐CoV‐2 red cell kodecytes using routine serologic diagnostic platforms.png)
Transfusion
OAAI
TransfusionIF0
OAAI分享收藏Rubber hand illusion, empathy, and schizotypal experiences in terms of self-other representations橡胶手的错觉，同理心和分裂型经验在自我-他人表征方面
PREAI
分享收藏
查看更多内容