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

DOI10.1016/j.amc.2006.02.034zbMath1106.65031OpenAlexW2062183423MaRDI QIDQ856144

H. Ghazvini, H. Saberi Najafi

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

eigenvaluenumerical examplesKrylov subspaceHessenberg matrixmin restarting method

Mathematics Subject Classification ID

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

Related Items (1)

A new algorithm for computing eigenpairs of matrices

Uses Software

• eigs

Cites Work

• A new restarting method in the Arnoldi 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
• 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
• ILUM: A Multi-Elimination ILU Preconditioner for General Sparse Matrices
• The principle of minimized iterations in the solution of the matrix eigenvalue problem
• Unnamed Item

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