Hybrid Iterative Refined Method for Computing a Few Extreme Eigenpairs of a Symmetric Matrix

DOI10.1137/20M1344834OpenAlexW3157408875MaRDI QIDQ4997345

Jennifer Picucci, James Baglama, Tom Bella

Publication date: 29 June 2021

Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/20m1344834

zbMATH Keywords

singular valueeigenvalue computationrestarted Lanczos methodrefined Ritzthick-restarted

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Eigenvalues, singular values, and eigenvectors (15A18)

Uses Software

• eigs
• JDQR
• PRIMME
• TRLan
• SparseMatrix
• JDQZ
• IRAM

Cites Work

• Unnamed Item
• PRIMME
• On refined Ritz vectors and polynomial characterization
• A thick-restarted block Arnoldi algorithm with modified Ritz vectors for large eigenproblems
• Block Krylov-Schur method for large symmetric eigenvalue problems
• Analysis of the symmetric Lanczos algorithm with reorthogonalization methods
• Variations on Arnoldi's method for computing eigenelements of large unsymmetric matrices
• Restarting techniques for the (Jacobi-)Davidson symmetric eigenvalue method
• 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
• The refined harmonic Arnoldi method and an implicitly restarted refined algorithm for computing interior eigenpairs of large matrices
• Some theoretical comparisons of refined Ritz vectors and Ritz vectors
• A refined Jacobi-Davidson method and its correction equation
• An analysis of the Rayleigh--Ritz method for approximating eigenspaces
• Thick-Restart Lanczos Method for Large Symmetric Eigenvalue Problems
• A Krylov--Schur Algorithm for Large Eigenproblems
• A Thick-Restart Lanczos Algorithm with Polynomial Filtering for Hermitian Eigenvalue Problems
• The university of Florida sparse matrix collection
• Implicit Application of Polynomial Filters in a k-Step Arnoldi Method
• Dynamic Thick Restarting of the Davidson, and the Implicitly Restarted Arnoldi Methods
• IRBL: An Implicitly Restarted Block-Lanczos Method for Large-Scale Hermitian Eigenproblems
• A Jacobi--Davidson Iteration Method for Linear Eigenvalue Problems
• Implicitly Restarted GMRES and Arnoldi Methods for Nonsymmetric Systems of Equations
• Templates for the Solution of Algebraic Eigenvalue Problems
• TRPL+K: Thick-Restart Preconditioned Lanczos+K Method for Large Symmetric Eigenvalue Problems
• On an Eigenvector-Dependent Nonlinear Eigenvalue Problem
• Deflation Techniques for an Implicitly Restarted Arnoldi Iteration
• On restarting the Arnoldi method for large nonsymmetric eigenvalue problems

This page was built for publication: Hybrid Iterative Refined Method for Computing a Few Extreme Eigenpairs of a Symmetric Matrix