.png){kind=icon}
返回
POLYNOMIAL PRECONDITIONED ARNOLDI WITH STABILITY CONTROL
.png){kind=icon}
OA
AI
DOI：10.1137/19M1302430.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Polynomial preconditioning can improve the convergence of the Arnoldi method for computing eigenvalues. Such preconditioning significantly reduces the cost of orthogonalization; for difficult problems, it can also reduce the number of matrix-vector products. Parallel computations can particularly benefit from the reduction of communication-intensive operations. The GMRES algorithm provides a simple and effective way of generating the preconditioning polynomial. For some problems high degree polynomials are especially effective, but they can lead to stability problems that must be mitigated. A two-level double polynomial preconditioning strategy provides an effective way to generate high-degree preconditioners.
Keyword:
eigenvalues
polynomial preconditioning
Arnoldi
GMRES
期刊
IF:
2.6
论文数:
5.1K
被引数:
1.8W
机构
引用论文
Identification and Pathogenicity of Rhizoctonia spp. Isolated from Apple Roots and Orchard Soils 丝核菌 spp的鉴定和致病性。从苹果根和果园土壤中分离出来
.png){kind=icon}
PREAI
分享收藏
分享收藏分享收藏分享收藏
查看更多内容