Implicitly Restarted Refined Generalised Arnoldi Method with Deflation for the Polynomial Eigenvalue Problem

DOI10.4208/eajam.070517.180917azbMath1478.65025OpenAlexW2805658268WikidataQ129885565 ScholiaQ129885565MaRDI QIDQ4985193

Hua Dai, Wei Wei

Publication date: 22 April 2021

Published in: Unnamed Author (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.4208/eajam.070517.180917a

zbMATH Keywords

refinementpolynomial eigenvalue problemimplicit restartinggeneralised Arnoldi methodnon-equivalence low-rank deflation

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15)

Uses Software

• JDQR
• NLEVP
• JDQZ
• Harwell-Boeing sparse matrix collection

Cites Work

• Unnamed Item
• Structured eigenvalue condition numbers and linearizations for matrix polynomials
• Restarted generalized Krylov subspace methods for solving large-scale polynomial eigenvalue problems
• Perturbation theory for homogeneous polynomial eigenvalue problems
• NLEVP
• Sparse matrix test problems
• Perturbation of Eigenvalues for Matrix Polynomials via The Bauer--Fike Theorems
• Templates for the Solution of Algebraic Eigenvalue Problems
• SOAR: A Second-order Arnoldi Method for the Solution of the Quadratic Eigenvalue Problem

This page was built for publication: Implicitly Restarted Refined Generalised Arnoldi Method with Deflation for the Polynomial Eigenvalue Problem