A modification on minimum restarting method in the Arnoldi algorithm for computing the eigenvalues of a nonsymmetric matrix

DOI10.1016/J.AMC.2006.02.034MaRDI QIDQ856144zbMATH OpenOpenAlexFDO

Authors H. Saberi Najafi, H. Ghazvini

Publication date 7 December 2006

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

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

zbMATH Keywords

eigenvalueHessenberg matrixKrylov subspacemin restarting methodnumerical examples

Mathematics Subject Classification ID

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

Recommendations

• A new restarting method in the Arnoldi algorithm for computing the eigenvalues of a nonsymmetric matrix
• On restarting the Arnoldi method for large nonsymmetric eigenvalue problems
• Weighted restarting method in the weighted Arnoldi algorithm for computing the eigenvalues of a nonsymmetric matrix
• A new restarting method in the harmonic projection algorithm for computing the eigenvalues of a nonsymmetric matrix
• Arnoldi versus nonsymmetric Lanczos algorithms for solving matrix eigenvalue problems
• The Restarted Arnoldi Method Applied to Iterative Linear System Solvers for the Computation of Rightmost Eigenvalues
• A hybrid of the restarted Arnoldi and electromagnetism meta-heuristic methods for calculating eigenvalues and eigenvectors of a non-symmetric matrix
• A reflection on the implicitly restarted Arnoldi method for computing eigenvalues near a vertical line
• An iterative block Arnoldi algorithm with modified approximate eigenvectors for large unsymmetric eigenvalue problems
• Refined iterative algorithms based on Arnoldi's process for large unsymmetric eigenproblems

Cites work

• A new restarting method in the Arnoldi algorithm for computing the eigenvalues of a nonsymmetric matrix
• Dynamic Thick Restarting of the Davidson, and the Implicitly Restarted Arnoldi Methods
• ILUM: A Multi-Elimination ILU Preconditioner for General Sparse Matrices
• Implicit Application of Polynomial Filters in a k-Step Arnoldi Method
• Numerical methods for large eigenvalue problems
• On restarting the Arnoldi method for large nonsymmetric eigenvalue problems
• The principle of minimized iterations in the solution of the matrix eigenvalue problem
• Weighted restarting method in the weighted Arnoldi algorithm for computing the eigenvalues of a nonsymmetric matrix

Cited in

(5)

• A new restarting method in the Arnoldi algorithm for computing the eigenvalues of a nonsymmetric matrix
• A new restarting method in the harmonic projection algorithm for computing the eigenvalues of a nonsymmetric matrix
• Weighted restarting method in the weighted Arnoldi algorithm for computing the eigenvalues of a nonsymmetric matrix
• A new algorithm for computing eigenpairs of matrices
• A hybrid of the restarted Arnoldi and electromagnetism meta-heuristic methods for calculating eigenvalues and eigenvectors of a non-symmetric matrix

Describes a project that uses

Uses Software

• eigs

This page was built for publication: A modification on minimum restarting method in the Arnoldi algorithm for computing the eigenvalues of a nonsymmetric matrix

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q856144)