On refined Ritz vectors and polynomial characterization

DOI10.1016/j.camwa.2014.01.005zbMath1350.65030OpenAlexW1975600287MaRDI QIDQ316597

Mashetti Ravibabu, Arindama Singh

Publication date: 27 September 2016

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.camwa.2014.01.005

zbMATH Keywords

eigenvalueLanczos polynomialspolynomial characterizationrefined Arnoldi methodrefined Ritz vectors

Mathematics Subject Classification ID

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

Related Items

The least squares and line search in extracting eigenpairs in Jacobi-Davidson method ⋮ Hybrid Iterative Refined Method for Computing a Few Extreme Eigenpairs of a Symmetric Matrix ⋮ Hybrid Iterative Refined Method for Computing a Few Extreme Eigenpairs of a Symmetric Matrix

Uses Software

• eigs
• IRAM

Cites Work

• Polynomial characterizations of the approximate eigenvectors by the refined Arnoldi method and an implicitly restarted refined Arnoldi algorithm
• Refined iterative algorithms based on Arnoldi's process for large unsymmetric eigenproblems
• Some theoretical comparisons of refined Ritz vectors and Ritz vectors
• Matrix Algorithms
• The Lanczos and conjugate gradient algorithms in finite precision arithmetic
• Implicit Application of Polynomial Filters in a k-Step Arnoldi Method
• The principle of minimized iterations in the solution of the matrix eigenvalue problem
• Unnamed Item
• Unnamed Item