Restarted generalized Krylov subspace methods for solving large-scale polynomial eigenvalue problems

DOI10.1007/s11075-008-9214-7zbMath1162.65017OpenAlexW2041957061MaRDI QIDQ1014354

Yi-Min Wei, Liang Bao, Yi-Qin Lin

Publication date: 27 April 2009

Published in: Numerical Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11075-008-9214-7

zbMATH Keywords

numerical examplesgeneralized Krylov subspacerestartinggeneralized Arnoldi procedurelarge-scale polynomial eigenvalue problemprojection and refined technique

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Matrices over function rings in one or more variables (15A54)

Related Items (4)

Successive \(m\)th approximation method for the nonlinear eigenvalue problem ⋮ Implicitly Restarted Refined Partially Orthogonal Projection Method with Deflation ⋮ Stability Analysis of the Two-level Orthogonal Arnoldi Procedure ⋮ Implicitly Restarted Refined Generalised Arnoldi Method with Deflation for the Polynomial Eigenvalue Problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Variations on Arnoldi's method for computing eigenelements of large unsymmetric matrices
• Refined iterative algorithms based on Arnoldi's process for large unsymmetric eigenproblems
• More on pseudospectra for polynomial eigenvalue problems and applications in control theory
• Descent iterations for improving approximate eigenpairs of polynomial eigenvalue problems with general complex matrices
• Polynomial eigenvalue problems with Hamiltonian structure
• Perturbation theory for homogeneous polynomial eigenvalue problems
• Numerical solutions for large sparse quadratic eigenvalue problems
• Jacobi-Davidson type methods for generalized eigenproblems and polynomial eigenproblems
• A refined subspace iteration algorithm for large sparse eigenproblems
• Backward error and condition of polynomial eigenvalue problems
• Krylov type subspace methods for matrix polynomials
• Structured Pseudospectra for Polynomial Eigenvalue Problems, with Applications
• The Quadratic Eigenvalue Problem
• Jacobi–Davidson methods for cubic eigenvalue problems
• Integrable Hamiltonian systems related to the polynomial eigenvalue problem
• Numerical Solution of Quadratic Eigenvalue Problems with Structure-Preserving Methods
• Alternatives to the Rayleigh Quotient for the Quadratic Eigenvalue Problem
• A Krylov Subspace Method for Quadratic Matrix Polynomials with Application to Constrained Least Squares Problems
• A Subspace Approximation Method for the Quadratic Eigenvalue Problem
• Three‐dimensional singularities of elastic fields near vertices
• SOAR: A Second-order Arnoldi Method for the Solution of the Quadratic Eigenvalue Problem
• The principle of minimized iterations in the solution of the matrix eigenvalue problem

This page was built for publication: Restarted generalized Krylov subspace methods for solving large-scale polynomial eigenvalue problems