Weighted FOM-inverse vector iteration method for computing a few smallest (largest) eigenvalues of pair (A, B)

DOI10.1016/j.amc.2007.03.004zbMath1193.65038OpenAlexW2037187803MaRDI QIDQ990516

J. Martínez

Publication date: 1 September 2010

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

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

zbMATH Keywords

symmetricpositive definiteArnoldigeneralized eigenvalueweighted FOM

Mathematics Subject Classification ID

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

Related Items

A new algorithm for solving large-scale generalized eigenvalue problem based on projection methods ⋮ Stability analysis of distributed order fractional differential equations ⋮ Stability analysis of distributed-order Hilfer-Prabhakar systems based on inertia theory ⋮ New iterative methods for generalized singular-value problems

Uses Software

• eigs

Cites Work

• Unnamed Item
• Unnamed Item
• A new restarting method in the Lanczos algorithm for generalized eigenvalue problem
• Weighted FOM and GMRES for solving nonsymmetric linear systems
• Linear and numerical linear algebra in control theory: Some research problems
• A new restarting method in the Arnoldi algorithm for computing the eigenvalues of a nonsymmetric matrix
• FOM-inverse vector iteration method for computing a few smallest (largest) eigenvalues of pair (A,B)
• Weighted restarting method in the weighted Arnoldi algorithm for computing the eigenvalues of a nonsymmetric matrix
• Krylov Subspace Methods for Solving Large Unsymmetric Linear Systems
• 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

This page was built for publication: Weighted FOM-inverse vector iteration method for computing a few smallest (largest) eigenvalues of pair (A, B)