A new restarting method in the Arnoldi algorithm for computing the eigenvalues of a nonsymmetric matrix
From MaRDI portal
Publication:1886555
DOI10.1016/j.amc.2003.07.018zbMath1055.65050OpenAlexW2029267243MaRDI QIDQ1886555
Publication date: 18 November 2004
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2003.07.018
numerical examplesKrylov subspace methodArnoldi algorithmEigenvalueHessenberg matrixNonsymmetric large matrix
Related Items
FOM-inverse vector iteration method for computing a few smallest (largest) eigenvalues of pair (A,B) ⋮ A modification on minimum restarting method in the Arnoldi algorithm for computing the eigenvalues of a nonsymmetric matrix ⋮ A nonmonotone trust region method with new inexact line search for unconstrained optimization ⋮ A new restarting method in the Lanczos algorithm for generalized eigenvalue problem ⋮ A direct eigenanalysis of multibody system in equilibrium ⋮ A new restarting method in the harmonic projection algorithm for computing the eigenvalues of a nonsymmetric matrix ⋮ A new algorithm for computing eigenpairs of matrices ⋮ Weighted restarting method in the weighted Arnoldi algorithm for computing the eigenvalues of a nonsymmetric matrix ⋮ A hybrid of the restarted Arnoldi and electromagnetism meta-heuristic methods for calculating eigenvalues and eigenvectors of a non-symmetric matrix ⋮ Weighted FOM-inverse vector iteration method for computing a few smallest (largest) eigenvalues of pair (A, B)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Implicit Application of Polynomial Filters in a k-Step Arnoldi Method
- Dynamic Thick Restarting of the Davidson, and the Implicitly Restarted Arnoldi Methods
- On restarting the Arnoldi method for large nonsymmetric eigenvalue problems
- The principle of minimized iterations in the solution of the matrix eigenvalue problem
