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

DOI10.1007/S11075-008-9214-7zbMATH Open1162.65017OpenAlexW2041957061MaRDI QIDQ1014354FDOQ1014354

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

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

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)

Cites Work

• Title not available (Why is that?)
• The quadratic eigenvalue problem
• Title not available (Why is that?)
• Variations on Arnoldi's method for computing eigenelements of large unsymmetric matrices
• More on pseudospectra for polynomial eigenvalue problems and applications in control theory
• Perturbation theory for homogeneous polynomial eigenvalue problems
• Jacobi-Davidson type methods for generalized eigenproblems and polynomial eigenproblems
• Backward error and condition of polynomial eigenvalue problems
• Structured pseudospectra for polynomial eigenvalue problems, with applications
• The principle of minimized iterations in the solution of the matrix eigenvalue problem
• 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
• Three‐dimensional singularities of elastic fields near vertices
• Polynomial eigenvalue problems with Hamiltonian structure
• Numerical Solution of Quadratic Eigenvalue Problems with Structure-Preserving Methods
• A Krylov Subspace Method for Quadratic Matrix Polynomials with Application to Constrained Least Squares Problems
• Krylov type subspace methods for matrix polynomials
• Numerical solutions for large sparse quadratic eigenvalue problems
• Jacobi–Davidson methods for cubic eigenvalue problems
• Alternatives to the Rayleigh Quotient for the Quadratic Eigenvalue Problem
• A refined subspace iteration algorithm for large sparse eigenproblems
• Title not available (Why is that?)
• Descent iterations for improving approximate eigenpairs of polynomial eigenvalue problems with general complex matrices
• Integrable Hamiltonian systems related to the polynomial eigenvalue problem
• A Subspace Approximation Method for the Quadratic Eigenvalue Problem

Cited In (7)

• Title not available (Why is that?)
• 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
• Convergence of Polynomial Restart Krylov Methods for Eigenvalue Computations

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)