A polynomial Jacobi-Davidson solver with support for non-monomial bases and deflation (Q2185867): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
Property / describes a project that uses | |||
Property / describes a project that uses: JDQR / rank | |||
Normal rank |
Revision as of 14:04, 28 February 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A polynomial Jacobi-Davidson solver with support for non-monomial bases and deflation |
scientific article |
Statements
A polynomial Jacobi-Davidson solver with support for non-monomial bases and deflation (English)
0 references
5 June 2020
0 references
Large-scale polynomial eigenvalue problems can be solved by Krylov methods operating on an equivalent linear eigenproblem (linearization) of size \(d\times n\), where \(d\) is the polynomial degree and \(n\) is the problem size, or by projection methods that keep the computation in the \(n\)-dimensional space. The Jacobi-Davidson technique belongs to the latter class of methods, and, since it is a preconditioned eigensolver, it may be competitive in cases where explicitly computing a matrix factorization is exceedingly expensive. However, a fully fledged implementation of a polynomial Jacobi-Davidson method has to consider several issues, including the deflation to compute more than one eigenpair, the use of non-monomial bases for the case of large degree polynomials, and the handling of complex eigenvalues when computing in real arithmetic. The authors discuss these aspects and present computational results of a parallel implementation in the SLEPc library.
0 references
polynomial eigenvalue problem
0 references
Jacobi-Davidson method
0 references
non-monomial bases
0 references