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-5zbMATH Open1030.65023WikidataQ56457285 ScholiaQ56457285MaRDI QIDQ1862016FDOQ1862016
Authors: Zhongxiao Jia 
Publication date: 10 March 2003
Published in: Applied Numerical Mathematics (Search for Journal in Brave)
Recommendations
- A new shift strategy for the implicitly restarted refined harmonic Lanczos method
- A refined harmonic Rayleigh-Ritz procedure and an explicitly restarted refined harmonic Arnoldi algorithm
- Harmonic and refined harmonic shift-invert residual Arnoldi and Jacobi-Davidson methods for interior eigenvalue problems
- An invert-free Arnoldi method for computing interior eigenpairs of large matrices
- A variant on harmonic Arnoldi method
Krylov subspace methodsnumerical examplesinterior eigenvaluerefined shiftsimplicitly restarted Arnoldi algorithmshift and invert strategyrefined harmonic Arnoldi method
Cites Work
- Implicit Application of Polynomial Filters in a k-Step Arnoldi Method
- ARPACK Users' Guide
- Templates for the Solution of Algebraic Eigenvalue Problems
- Title not available (Why is that?)
- Matrix algorithms. Vol. 2: Eigensystems
- The convergence of harmonic Ritz values, harmonic Ritz vectors and refined harmonic Ritz vectors
- A Jacobi–Davidson Iteration Method for Linear Eigenvalue Problems
- Harmonic projection methods for large non-symmetric eigenvalue problems
- Computing interior eigenvalues of large matrices
- Composite orthogonal projection methods for large matrix eigenproblems
- Numerical methods for large eigenvalue problems
- The Convergence of Generalized Lanczos Methods for Large Unsymmetric Eigenproblems
- The principle of minimized iterations in the solution of the matrix eigenvalue problem
- On polynomial preconditioning and asymptotic convergence factors for indefinite Hermitian matrices
- A Restarted GMRES Method Augmented with Eigenvectors
- Approximate solutions and eigenvalue bounds from Krylov subspaces
- Refined iterative algorithms based on Arnoldi's process for large unsymmetric eigenproblems
- Polynomial characterizations of the approximate eigenvectors by the refined Arnoldi method and an implicitly restarted refined Arnoldi algorithm
- An analysis of the Rayleigh-Ritz method for approximating eigenspaces
- Computational methods for large eigenvalue problems
- Implicitly Restarted GMRES and Arnoldi Methods for Nonsymmetric Systems of Equations
- On hybrid iterative methods for nonsymmetric systems of linear equations
- Efficient expansion of subspaces in the Jacobi-Davidson method for standard and generalized eigenproblems
- Quasi-kernel polynomials and their use in non-Hermitian matrix iterations
- Sparse matrix test problems
- A refined iterative algorithm based on the block Arnoldi process for large unsymmetric eigenproblems
- A refined subspace iteration algorithm for large sparse eigenproblems
- A Large, Sparse, and Indefinite Generalized Eigenvalue Problem from Fluid Mechanics
- Adaptive polynomial preconditioning for Hermitian indefinite linear systems
- A refined shift-and-invert Arnoldi algorithm for large unsymmetric generalized eigenproblems.
- Title not available (Why is that?)
- An adaptive Richardson iteration method for indefinite linear systems
- Residuals of refined projection methods for large matrix eigenproblems
Cited In (29)
- A refined shifted block inverse-free Krylov subspace method for symmetric generalized eigenvalue problems
- Generalisation of a quadrilateral duality theorem
- A refined shift-and-invert Arnoldi algorithm for large unsymmetric generalized eigenproblems.
- 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
- Hybrid Iterative Refined Method for Computing a Few Extreme Eigenpairs of a Symmetric Matrix
- Thick restarting the weighted harmonic Arnoldi algorithm for large interior eigenproblems
- A simpler harmonic Arnoldi method for computing interior eigenvalues of large matrices
- A harmonic Lanczos bidiagonalization method for computing interior singular triplets of large matrices
- An invert-free Arnoldi method for computing interior eigenpairs of large matrices
- The use of refined harmonic shifts in the implicitly restarted refined harmonic Arnoldi method
- A variant on harmonic Arnoldi method
- Claculating interior eigenvalues and eigenvectors with an implicitly restarted and a filter diagonalization method
- On a new variant of Arnoldi method for approximation of eigenpairs
- On the convergence of Ritz pairs and refined Ritz vectors for quadratic eigenvalue problems
- The Rayleigh-Ritz method, refinement and Arnoldi process for periodic matrix pairs
- Harmonic and refined harmonic shift-invert residual Arnoldi and Jacobi-Davidson methods for interior eigenvalue problems
- Multiple Explicitly Restarted Arnoldi Method for Solving Large Eigenproblems
- Two harmonic Jacobi-Davidson methods for computing a partial generalized singular value decomposition of a large matrix pair
- A refined variant of the inverse-free Krylov subspace method for symmetric generalized eigenvalue problems
- Hybrid iterative refined restarted Lanczos bidiagonalization methods
- A new shift strategy for the implicitly restarted refined harmonic Lanczos method
- A global harmonic Arnoldi method for large non-Hermitian eigenproblems with an application to multiple eigenvalue problems
- A new shift scheme for the harmonic Arnoldi method
- A modified harmonic block Arnoldi algorithm with adaptive shifts for large interior eigen\-problems
- The convergence of harmonic Ritz values, harmonic Ritz vectors and refined harmonic Ritz vectors
- A refined harmonic Rayleigh-Ritz procedure and an explicitly restarted refined harmonic Arnoldi algorithm
- The Convergence of Harmonic Ritz Vectors and Harmonic Ritz Values, Revisited
Uses Software
This page was built for publication: The refined harmonic Arnoldi method and an implicitly restarted refined algorithm for computing interior eigenpairs of large matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1862016)
