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

DOI10.1007/S11075-008-9214-7MaRDI QIDQ1014354zbMATH OpenOpenAlexFDO

Authors Liang Bao, Yimin Wei, Yiqin 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)

Recommendations

• Implicitly restarted refined generalised Arnoldi method with deflation for the polynomial eigenvalue problem
• Truncated QZ methods for large scale generalized eigenvalue problems
• scientific article; zbMATH DE number 4020318
• Convergence of Polynomial Restart Krylov Methods for Eigenvalue Computations
• Parallel Krylov solvers for the polynomial eigenvalue problem in SLEPc

Cites work

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

Cited in

(7)

• Convergence of Polynomial Restart Krylov Methods for Eigenvalue Computations
• scientific article; zbMATH DE number 5927297 (Why is no real title available?)
• Interpolation-restart strategies for resilient eigensolvers
• Implicitly restarted refined partially orthogonal projection method with deflation
• Successive \(m\)th approximation method for the nonlinear eigenvalue problem
• Stability analysis of the two-level orthogonal Arnoldi procedure
• Implicitly restarted refined generalised Arnoldi method with deflation for the polynomial eigenvalue problem

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1014354)