返回
PARALLEL KRYLOV SOLVERS FOR THE POLYNOMIAL EIGENVALUE PROBLEM IN SLEPc
DOI:10.1137/15M1022458.png)
摘要
En 中文
Polynomial eigenvalue problems are often found in scientific computing applications. When the coefficient matrices of the polynomial are large and sparse, usually only a few eigenpairs are required and projection methods are the best choice. We focus on Krylov methods that operate on the companion linearization of the polynomial but exploit the block structure with the aim of being memory-efficient in the representation of the Krylov subspace basis. The problem may appear in the form of a low-degree polynomial (quartic or quintic, say) expressed in the monomial basis, or a high-degree polynomial (coming from interpolation of a nonlinear eigenproblem) expressed in a nonmonomial basis. We have implemented a parallel solver in SLEPc covering both cases that is able to compute exterior as well as interior eigenvalues via spectral transformation. We discuss important issues such as scaling and restart and illustrate the robustness and performance of the solver with some numerical experiments.
Keyword:
matrix polynomial
eigenvalues
companion linearization
Krylov subspace
nonmonomial bases
spectral transformation
parallel computing
SLEPc
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
2.6
论文数:
5.1K
被引数:
1.8W
机构
引用论文
Effect of Exercise Training on the Mental and Physical Well-Being of Caregivers for Persons Living With Chronic Illnesses: A Systematic Review and Meta-Analysis运动训练对慢性病患者照顾者身心健康的影响: 系统综述和荟萃分析
A MULTILEVEL JACOBI-DAVIDSON METHOD FOR POLYNOMIAL PDE EIGENVALUE PROBLEMS ARISING IN PLASMA PHYSICS

