A new restarting method in the Lanczos algorithm for generalized eigenvalue problem

DOI10.1016/j.amc.2006.06.079zbMath1116.65045OpenAlexW2047943011MaRDI QIDQ879499

A. Refahi, H. Saberi Najafi

Publication date: 14 May 2007

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

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

zbMATH Keywords

numerical examplessparse matricesgeneralized eigenvalue problemLanczos algorithmrestarting methods

Mathematics Subject Classification ID

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

Related Items (9)

Haar wavelet collocation method for variable order fractional integro-differential equations with stability analysis ⋮ A new algorithm for solving large-scale generalized eigenvalue problem based on projection methods ⋮ A new restarting method in the harmonic projection algorithm for computing the eigenvalues of a nonsymmetric matrix ⋮ Stability analysis of distributed order fractional differential equations ⋮ A Collocation Method for Solving Fractional Order Linear System ⋮ Stability analysis of distributed-order Hilfer-Prabhakar systems based on inertia theory ⋮ New iterative methods for generalized singular-value problems ⋮ Unnamed Item ⋮ Weighted FOM-inverse vector iteration method for computing a few smallest (largest) eigenvalues of pair (A, B)

Uses Software

• eigs

Cites Work

• Unnamed Item
• 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
• 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

This page was built for publication: A new restarting method in the Lanczos algorithm for generalized eigenvalue problem