Hybrid Iterative Refined Method for Computing a Few Extreme Eigenpairs of a Symmetric Matrix
From MaRDI portal
Publication:4997345
Recommendations
- Hybrid iterative refined method for computing a few extreme eigenpairs of a symmetric matrix
- Iterative methods for the computation of a few eigenvalues of a large symmetric matrix
- Iterative refinement for symmetric eigenvalue decomposition
- A parallel iterative method for solving symmetric tridiagonal extreme eigenpair problems
- scientific article; zbMATH DE number 4026669
- Publication:4864091
- An Inverse Extreme Eigenpair Problem and Its Parallel Iterative Solution for Symmetric Tridiagonal Matrices
- scientific article; zbMATH DE number 25590
- scientific article; zbMATH DE number 697753
- An iterative method of computing the eigenvalue and eigenvalues of a symmetric matrix
Cites work
- scientific article; zbMATH DE number 1049353 (Why is no real title available?)
- A Jacobi--Davidson Iteration Method for Linear Eigenvalue Problems
- A Krylov--Schur algorithm for large eigenproblems
- A refined Jacobi-Davidson method and its correction equation
- A thick-restart Lanczos algorithm with polynomial filtering for Hermitian eigenvalue problems
- A thick-restarted block Arnoldi algorithm with modified Ritz vectors for large eigenproblems
- An analysis of the Rayleigh-Ritz method for approximating eigenspaces
- Analysis of the symmetric Lanczos algorithm with reorthogonalization methods
- Block Krylov-Schur method for large symmetric eigenvalue problems
- Deflation Techniques for an Implicitly Restarted Arnoldi Iteration
- Dynamic Thick Restarting of the Davidson, and the Implicitly Restarted Arnoldi Methods
- IRBL: An Implicitly Restarted Block-Lanczos Method for Large-Scale Hermitian Eigenproblems
- Implicit Application of Polynomial Filters in a k-Step Arnoldi Method
- Implicitly Restarted GMRES and Arnoldi Methods for Nonsymmetric Systems of Equations
- On an Eigenvector-Dependent Nonlinear Eigenvalue Problem
- On refined Ritz vectors and polynomial characterization
- On restarting the Arnoldi method for large nonsymmetric eigenvalue problems
- PRIMME: preconditioned iterative multimethod eigensolver -- methods and software description
- 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
- Restarting techniques for the (Jacobi-)Davidson symmetric eigenvalue method
- Some theoretical comparisons of refined Ritz vectors and Ritz vectors
- TRPL+K: Thick-Restart Preconditioned Lanczos+K Method for Large Symmetric Eigenvalue Problems
- Templates for the Solution of Algebraic Eigenvalue Problems
- The University of Florida sparse matrix collection
- The refined harmonic Arnoldi method and an implicitly restarted refined algorithm for computing interior eigenpairs of large matrices
- Thick-restart Lanczos method for large symmetric eigenvalue problems
- Variations on Arnoldi's method for computing eigenelements of large unsymmetric matrices
Cited in
(3)- Iterative methods for the computation of a few eigenvalues of a large symmetric matrix
- Hybrid iterative refined method for computing a few extreme eigenpairs of a symmetric matrix
- A dynamic thick restarted semi-refined ABLE algorithm for computing a few selected eigentriplets of large nonsymmetric matrices
This page was built for publication: Hybrid Iterative Refined Method for Computing a Few Extreme Eigenpairs of a Symmetric Matrix
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4997345)
