A reflection on the implicitly restarted Arnoldi method for computing eigenvalues near a vertical line

DOI10.1016/j.laa.2011.07.020zbMath1247.65049OpenAlexW2021088067MaRDI QIDQ413531

Raf Vandebril, Karl Meerbergen

Publication date: 7 May 2012

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.laa.2011.07.020

zbMATH Keywords

Krylov subspaceeigenvalues closest to the imaginary axisimplicitly restarted Arnoldi methodinverse subspace iterationKronecker eigenvalue problemlarge sparse generalized eigenvalue problemLyapunov eigenvalue problem

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Numerical computation of eigenvalues and eigenvectors of matrices (65F15)

Related Items (3)

A new technique for determining coupled modes of structure-acoustic systems ⋮ A Jacobi-Davidson method for two-real-parameter nonlinear eigenvalue problems arising from delay-differential equations ⋮ Robust Linear Stability Analysis and a New Method for Computing the Action of the Matrix Exponential

Uses Software

• eigs
• ARPACK
• IRAM
• Algorithm 432

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Extended Krylov subspace for parameter dependent systems
• Krylov-subspace methods for the Sylvester equation
• Eigenvalue decay bounds for solutions of Lyapunov equations: the symmetric case
• On the decay rate of Hankel singular values and related issues
• Eigenvalues of the discretized Navier-Stokes equation with application to the detection of Hopf bifurcations
• Numerical solution of the Lyapunov equation by approximate power iteration
• Use of near-breakdowns in the block Arnoldi method for solving large Sylvester equations
• Which Eigenvalues Are Found by the Lanczos Method?
• Implicitly Restarted Arnoldi Methods and Subspace Iteration
• Implicitly restarted Arnoldi with purification for the shift-invert transformation
• Numerical methods for large eigenvalue problems
• A New Iterative Method for Solving Large-Scale Lyapunov Matrix Equations
• Convergence Analysis of Projection Methods for the Numerical Solution of Large Lyapunov Equations
• Approximate implicit subspace iteration with alternating directions for LTI system model reduction
• Bifurcation with Memory
• How to Implement the Spectral Transformation
• Implicit Application of Polynomial Filters in a k-Step Arnoldi Method
• Krylov Subspace Methods for Solving Large Lyapunov Equations
• Approximate solution of large sparse Lyapunov equations
• Eigenvalues of Block Matrices Arising from Problems in Fluid Mechanics
• Computing an Eigenvector with Inverse Iteration
• ARPACK Users' Guide
• Convergence of Restarted Krylov Subspaces to Invariant Subspaces
• Matrix transformations for computing rightmost eigenvalues of large sparse non-symmetric eigenvalue problems
• On restarting the Arnoldi method for large nonsymmetric eigenvalue problems
• Numerical Methods for Bifurcations of Dynamical Equilibria
• Algorithm 432 [C2: Solution of the matrix equation AX + XB = C [F4]]
• The Matrix Eigenvalue Problem
• Matrix Equation $XA + BX = C$
• Buoyancy Effects in Fluids

This page was built for publication: A reflection on the implicitly restarted Arnoldi method for computing eigenvalues near a vertical line