The refined harmonic Arnoldi method and an implicitly restarted refined algorithm for computing interior eigenpairs of large matrices
From MaRDI portal
Publication:1862016
DOI10.1016/S0168-9274(01)00132-5zbMath1030.65023WikidataQ56457285 ScholiaQ56457285MaRDI QIDQ1862016
Publication date: 10 March 2003
Published in: Applied Numerical Mathematics (Search for Journal in Brave)
numerical examplesKrylov subspace methodsinterior eigenvaluerefined shiftsimplicitly restarted Arnoldi algorithmshift and invert strategyrefined harmonic Arnoldi method
Related Items (22)
A modified harmonic block Arnoldi algorithm with adaptive shifts for large interior eigen\-problems ⋮ An invert-free Arnoldi method for computing interior eigenpairs of large matrices ⋮ A new shift scheme for the harmonic Arnoldi method ⋮ A refined variant of the inverse-free Krylov subspace method for symmetric generalized eigenvalue problems ⋮ The Convergence of Harmonic Ritz Vectors and Harmonic Ritz Values, Revisited ⋮ Two harmonic Jacobi-Davidson methods for computing a partial generalized singular value decomposition of a large matrix pair ⋮ Hybrid iterative refined restarted Lanczos bidiagonalization methods ⋮ A new shift strategy for the implicitly restarted refined harmonic Lanczos method ⋮ The Rayleigh-Ritz method, refinement and Arnoldi process for periodic matrix pairs ⋮ A harmonic Lanczos bidiagonalization method for computing interior singular triplets of large matrices ⋮ On the convergence of Ritz pairs and refined Ritz vectors for quadratic eigenvalue problems ⋮ A refined shift-and-invert Arnoldi algorithm for large unsymmetric generalized eigenproblems. ⋮ On a new variant of Arnoldi method for approximation of eigenpairs ⋮ Hybrid Iterative Refined Method for Computing a Few Extreme Eigenpairs of a Symmetric Matrix ⋮ Harmonic and refined harmonic shift-invert residual Arnoldi and Jacobi-Davidson methods for interior eigenvalue problems ⋮ A global harmonic Arnoldi method for large non-Hermitian eigenproblems with an application to multiple eigenvalue problems ⋮ The convergence of harmonic Ritz values, harmonic Ritz vectors and refined harmonic Ritz vectors ⋮ An implicitly restarted Lanczos bidiagonalization method with refined harmonic shifts for computing smallest singular triplets ⋮ On Inner Iterations of Jacobi--Davidson Type Methods for Large SVD Computations ⋮ Hybrid Iterative Refined Method for Computing a Few Extreme Eigenpairs of a Symmetric Matrix ⋮ Generalisation of a quadrilateral duality theorem ⋮ A refined harmonic Rayleigh-Ritz procedure and an explicitly restarted refined harmonic Arnoldi algorithm
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On polynomial preconditioning and asymptotic convergence factors for indefinite Hermitian matrices
- Computing interior eigenvalues of large matrices
- Quasi-kernel polynomials and their use in non-Hermitian matrix iterations
- Adaptive polynomial preconditioning for Hermitian indefinite linear systems
- Efficient expansion of subspaces in the Jacobi-Davidson method for standard and generalized eigenproblems
- 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
- A refined iterative algorithm based on the block Arnoldi process for large unsymmetric eigenproblems
- A refined shift-and-invert Arnoldi algorithm for large unsymmetric generalized eigenproblems.
- Composite orthogonal projection methods for large matrix eigenproblems
- An adaptive Richardson iteration method for indefinite linear systems
- On hybrid iterative methods for nonsymmetric systems of linear equations
- A refined subspace iteration algorithm for large sparse eigenproblems
- An analysis of the Rayleigh--Ritz method for approximating eigenspaces
- Matrix Algorithms
- Sparse matrix test problems
- Implicit Application of Polynomial Filters in a k-Step Arnoldi Method
- A Large, Sparse, and Indefinite Generalized Eigenvalue Problem from Fluid Mechanics
- ARPACK Users' Guide
- Implicitly Restarted GMRES and Arnoldi Methods for Nonsymmetric Systems of Equations
- Templates for the Solution of Algebraic Eigenvalue Problems
- The convergence of harmonic Ritz values, harmonic Ritz vectors and refined harmonic Ritz vectors
- The Convergence of Generalized Lanczos Methods for Large Unsymmetric Eigenproblems
- Approximate solutions and eigenvalue bounds from Krylov subspaces
- A Restarted GMRES Method Augmented with Eigenvectors
- A Jacobi–Davidson Iteration Method for Linear Eigenvalue Problems
- Harmonic projection methods for large non-symmetric eigenvalue problems
- The principle of minimized iterations in the solution of the matrix eigenvalue problem
- Residuals of refined projection methods for large matrix eigenproblems
This page was built for publication: The refined harmonic Arnoldi method and an implicitly restarted refined algorithm for computing interior eigenpairs of large matrices
