The refined harmonic Arnoldi method and an implicitly restarted refined algorithm for computing interior eigenpairs of large matrices
From MaRDI portal
(Redirected from Publication:1862016)
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
Cites work
- scientific article; zbMATH DE number 3558824 (Why is no real title available?)
- scientific article; zbMATH DE number 961607 (Why is no real title available?)
- A Jacobi–Davidson Iteration Method for Linear Eigenvalue Problems
- A Large, Sparse, and Indefinite Generalized Eigenvalue Problem from Fluid Mechanics
- A Restarted GMRES Method Augmented with Eigenvectors
- 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.
- A refined subspace iteration algorithm for large sparse eigenproblems
- ARPACK Users' Guide
- Adaptive polynomial preconditioning for Hermitian indefinite linear systems
- An adaptive Richardson iteration method for indefinite linear systems
- An analysis of the Rayleigh-Ritz method for approximating eigenspaces
- Approximate solutions and eigenvalue bounds from Krylov subspaces
- Composite orthogonal projection methods for large matrix eigenproblems
- Computational methods for large eigenvalue problems
- Computing interior eigenvalues of large matrices
- Efficient expansion of subspaces in the Jacobi-Davidson method for standard and generalized eigenproblems
- Harmonic projection methods for large non-symmetric eigenvalue problems
- Implicit Application of Polynomial Filters in a k-Step Arnoldi Method
- Implicitly Restarted GMRES and Arnoldi Methods for Nonsymmetric Systems of Equations
- Matrix algorithms. Vol. 2: Eigensystems
- Numerical methods for large eigenvalue problems
- On hybrid iterative methods for nonsymmetric systems of linear equations
- On polynomial preconditioning and asymptotic convergence factors for indefinite Hermitian matrices
- Polynomial characterizations of the approximate eigenvectors by the refined Arnoldi method and an implicitly restarted refined Arnoldi algorithm
- Quasi-kernel polynomials and their use in non-Hermitian matrix iterations
- Refined iterative algorithms based on Arnoldi's process for large unsymmetric eigenproblems
- Residuals of refined projection methods for large matrix eigenproblems
- Sparse matrix test problems
- Templates for the Solution of Algebraic Eigenvalue Problems
- The Convergence of Generalized Lanczos Methods for Large Unsymmetric Eigenproblems
- The convergence of harmonic Ritz values, harmonic Ritz vectors and refined harmonic Ritz vectors
- The principle of minimized iterations in the solution of the matrix eigenvalue problem
Cited in
(33)- 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
- Hybrid Iterative Refined Method for Computing a Few Extreme Eigenpairs of a Symmetric Matrix
- A reflection on the implicitly restarted Arnoldi method for computing eigenvalues near a vertical line
- Refined and refined harmonic Jacobi-Davidson methods for computing several GSVD components of a large regular matrix pair
- 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
- A new variant of Arnoldi method for approximation of eigenpairs
- The convergence of harmonic Ritz vectors and harmonic Ritz values, revisited
- The use of refined harmonic shifts in the implicitly restarted refined harmonic Arnoldi method
- An invert-free Arnoldi method for computing interior eigenpairs of large matrices
- A variant on harmonic Arnoldi method
- On inner iterations of Jacobi-Davidson type methods for large SVD computations
- On a new variant of Arnoldi method for approximation of eigenpairs
- Claculating interior eigenvalues and eigenvectors with an implicitly restarted and a filter diagonalization method
- Hybrid iterative refined method for computing a few extreme eigenpairs of a symmetric matrix
- 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
- Computing interior eigenvalues of large sparse symmetric matrices
- 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
Describes a project that uses
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)
