Weighted restarting method in the weighted Arnoldi algorithm for computing the eigenvalues of a nonsymmetric matrix

DOI10.1016/j.amc.2005.08.035zbMath1094.65029OpenAlexW2014986208MaRDI QIDQ2493706

H. Ghazvini, H. Saberi Najafi

Publication date: 16 June 2006

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

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

zbMATH Keywords

algorithmeigenvaluenumerical examplesnonsymmetric matrixweighted Arnoldi methodweighted restarting method

Mathematics Subject Classification ID

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

Related Items

Acceleration of an adaptive generalized Arnoldi method for computing PageRank, 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 new restarting method in the Lanczos algorithm for generalized eigenvalue problem, IDR(\(s\)) for solving shifted nonsymmetric linear systems, A new restarting method in the harmonic projection algorithm for computing the eigenvalues of a nonsymmetric matrix, Weighted Inner Products for GMRES and GMRES-DR, A new algorithm for computing eigenpairs of matrices, Approximating the weighted pseudospectra of large matrices, An adaptive Power-GArnoldi algorithm for computing PageRank, A new computational GMRES method, On adaptively accelerated Arnoldi method for computing PageRank, Numerical stability of orthogonalization methods with a non-standard inner product, Restarted weighted full orthogonalization method for shifted linear systems, 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

• eigs

Cites Work

• Weighted FOM and GMRES for solving nonsymmetric linear systems
• A new restarting method in the Arnoldi algorithm for computing the eigenvalues of a nonsymmetric matrix
• 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
• Unnamed Item
• Unnamed Item