A global harmonic Arnoldi method for large non-Hermitian eigenproblems with an application to multiple eigenvalue problems

DOI10.1016/j.cam.2010.01.049zbMath1188.65041OpenAlexW2079314807MaRDI QIDQ966098

Congying Duan, Zhongxiao Jia

Publication date: 27 April 2010

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cam.2010.01.049

zbMATH Keywords

convergencenumerical experimentsimplicit restartKrylov subspaceinteriorRayleigh quotientsglobal Arnoldi process\(F\)-orthonormalexterior eigenpairsglobal harmonic Arnoldi methodharmonic \(F\)-ritz valueharmonic \(F\)-Ritz vectorharmonic \(F\)-shiftsill-conditioned multiple eigenproblemslarge non-Hermitian matrix

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Ill-posedness and regularization problems in numerical linear algebra (65F22)

Related Items (1)

Weighted and deflated global GMRES algorithms for solving large Sylvester matrix equations

Uses Software

• eigs
• JDQR
• JDQZ
• Harwell-Boeing sparse matrix collection
• IRAM

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A global Arnoldi method for large non-Hermitian eigenproblems with special applications to multiple eigenproblems
• Matrix Krylov subspace methods for large scale model reduction problems
• Quasi-kernel polynomials and their use in non-Hermitian matrix iterations
• Adaptive polynomial preconditioning for Hermitian indefinite linear systems
• Generalized block Lanczos methods for large unsymmetric eigenproblems
• Global FOM and GMRES algorithms for matrix equations
• The refined harmonic Arnoldi method and an implicitly restarted refined algorithm for computing interior eigenpairs of large matrices
• An adaptive Richardson iteration method for indefinite linear systems
• A harmonic restarted Arnoldi algorithm for calculating eigenvalues and determining multiplicity
• Global SCD algorithm for real positive definite linear systems with multiple right-hand sides
• CG-type algorithms to solve symmetric matrix equations
• Convergence properties of some block Krylov subspace methods for multiple linear systems
• Implicitly restarted global FOM and GMRES for nonsymmetric matrix equations and Sylvester equations
• 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
• 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
• 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
• The global Hessenberg and CMRH methods for linear systems with multiple right-hand sides

This page was built for publication: A global harmonic Arnoldi method for large non-Hermitian eigenproblems with an application to multiple eigenvalue problems