An iterated shift-and-invert Arnoldi algorithm for quadratic matrix eigenvalue problems

DOI10.1016/J.AMC.2004.11.015zbMath1095.65034OpenAlexW2016180671MaRDI QIDQ2369227

Qiang Ye

Publication date: 28 April 2006

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2004.11.015

zbMATH Keywords

numerical examplesKrylov subspace methodLanczos algorithmdirect projection methodlarge scale quadratic eigenvalue problemshift-and-invert technique

Mathematics Subject Classification ID

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

Related Items (3)

On the convergence of Ritz pairs and refined Ritz vectors for quadratic eigenvalue problems ⋮ A semiorthogonal generalized Arnoldi method and its variations for quadratic eigenvalue problems ⋮ A modified second-order Arnoldi method for solving the quadratic eigenvalue problems

Uses Software

• JDQR
• JDQZ

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Jacobi-Davidson type methods for generalized eigenproblems and polynomial eigenproblems
• Krylov type subspace methods for matrix polynomials
• Locking and Restarting Quadratic Eigenvalue Solvers
• The Quadratic Eigenvalue Problem
• A New Algorithm for Numerical Path Following Applied to an Example from Hydrodynamical Flow
• Residual Inverse Iteration for the Nonlinear Eigenvalue Problem
• Criteria for Combining Inverse and Rayleigh Quotient Iteration
• Inverses of Band Matrices and Local Convergence of Spline Projections
• A Krylov Subspace Method for Quadratic Matrix Polynomials with Application to Constrained Least Squares Problems
• Templates for the Solution of Algebraic Eigenvalue Problems

This page was built for publication: An iterated shift-and-invert Arnoldi algorithm for quadratic matrix eigenvalue problems