Harmonic projection methods for large non-symmetric eigenvalue problems

DOI<33::AID-NLA125>3.0.CO;2-1 10.1002/(SICI)1099-1506(199801/02)5:1<33::AID-NLA125>3.0.CO;2-1zbMath0937.65045OpenAlexW1977847746MaRDI QIDQ4940813

No author found.

Publication date: 27 February 2000

Full work available at URL: https://doi.org/10.1002/(sici)1099-1506(199801/02)5:1<33::aid-nla125>3.0.co;2-1

zbMATH Keywords

numerical examplespreconditioningeigenvectorsRayleigh-Ritz methodKrylov subspace methodArnoldi methodDavidson's methodlarge nonsymmetric eigenvalue problemsharmonic projection methods

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15)

Related Items

A harmonic restarted Arnoldi algorithm for calculating eigenvalues and determining multiplicity, A Preconditioned Hybrid SVD Method for Accurately Computing Singular Triplets of Large Matrices, 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, Incremental spectral preconditioners for sequences of linear systems, A new shift scheme for the harmonic Arnoldi method, Preconditioned Locally Harmonic Residual Method for Computing Interior Eigenpairs of Certain Classes of Hermitian Matrices, Comparative study of inner-outer Krylov solvers for linear systems in structured and high-order unstructured CFD problems, Unnamed Item, 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, Subspace recycling accelerates the parametric macro-modeling of MEMS, The Coefficients of the FOM and GMRES Residual Polynomials, A new restarting method in the harmonic projection algorithm for computing the eigenvalues of a nonsymmetric matrix, A new shift strategy for the implicitly restarted refined harmonic Lanczos method, A refined Arnoldi type method for large scale eigenvalue problems, A-posteriori residual bounds for Arnoldi's methods for nonsymmetric eigenvalue problems, Fast iterative interior eigensolver for millions of atoms, The least squares and line search in extracting eigenpairs in Jacobi-Davidson method, On the block GMRES method with deflated restarting, Thick restarting the weighted harmonic Arnoldi algorithm for large interior eigenproblems, On a new variant of Arnoldi method for approximation of eigenpairs, New methods for computing the Drazin-inverse solution of singular linear systems, Minimal residual methods augmented with eigenvectors for solving Sylvester equations and generalized Sylvester equations, Augmented block Householder Arnoldi method, Deflated GMRES for systems with multiple shifts and multiple right-hand sides, Fast Randomized Non-Hermitian Eigensolvers Based on Rational Filtering and Matrix Partitioning, 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, Simpler GMRES with deflated restarting, GMRES with adaptively deflated restarting and its performance on an electromagnetic cavity problem, Restarted block-GMRES with deflation of eigenvalues, Residuals of refined projection methods for large matrix eigenproblems, Modified tangential frequency filtering decomposition and its Fourier analysis, Generalized Preconditioned Locally Harmonic Residual Method for Non-Hermitian Eigenproblems, Fast eigenvalue calculations in a massively parallel plasma turbulence code, A new variant of Arnoldi method for approximation of eigenpairs, Two-Grid and Multiple-Grid Arnoldi for Eigenvalues, Convergence of Arnoldi's method for generalized eigenvalue problems, Restarted GMRES augmented with harmonic Ritz vectors for shifted linear systems, PRIMME_SVDS: A High-Performance Preconditioned SVD Solver for Accurate Large-Scale Computations, Thick restarting the weighted harmonic Golub-Kahan-Lanczos algorithm for the linear response eigenvalue problem, A new method for accelerating Arnoldi algorithms for large scale eigenproblems, Implicitly restarted global FOM and GMRES for nonsymmetric matrix equations and Sylvester equations, Polynomial characterizations of the approximate eigenvectors by the refined Arnoldi method and an implicitly restarted refined Arnoldi algorithm, Preconditioning eigenvalues and some comparison of solvers, Generalisation of a quadrilateral duality theorem, On the use of harmonic Ritz pairs in approximating internal eigenpairs, The refined harmonic Arnoldi method and an implicitly restarted refined algorithm for computing interior eigenpairs of large matrices, A generalization of Saad's bound on harmonic Ritz vectors of Hermitian matrices, A refined harmonic Rayleigh-Ritz procedure and an explicitly restarted refined harmonic Arnoldi algorithm

Uses Software

• QMRPACK
• JDQZ

Cites Work

• Unnamed Item
• Unnamed Item
• Preconditioning techniques for nonsymmetric and indefinite linear systems
• Variations on Arnoldi's method for computing eigenelements of large unsymmetric matrices
• Quasi-kernel polynomials and their use in non-Hermitian matrix iterations
• Generalizations of Davidson's method for computing eigenvalues of large nonsymmetric matrices
• The iterative calculation of a few of the lowest eigenvalues and corresponding eigenvectors of large real-symmetric matrices
• Adaptive polynomial preconditioning for Hermitian indefinite linear systems
• Numerical solution of large nonsymmetric eigenvalue problems
• Robust preconditioning of large, sparse, symmetric eigenvalue problems
• An adaptive Richardson iteration method for indefinite linear systems
• On hybrid iterative methods for nonsymmetric systems of linear equations
• GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
• Generalizations of Davidson’s Method for Computing Eigenvalues of Sparse Symmetric Matrices
• Sparse matrix test problems
• The Advantages of Inverted Operators in Rayleigh–Ritz Approximations
• Implicit Application of Polynomial Filters in a k-Step Arnoldi Method
• A Large, Sparse, and Indefinite Generalized Eigenvalue Problem from Fluid Mechanics
• A Hybrid GMRES Algorithm for Nonsymmetric Linear Systems
• Simultaneous Iteration for Partial Eigensolution of Real Matrices
• Solution of Sparse Indefinite Systems of Linear Equations
• QMRPACK
• Approximate Inverse Techniques for Block-Partitioned Matrices
• Preconditioning the Lanczos Algorithm for Sparse Symmetric Eigenvalue Problems
• Approximate solutions and eigenvalue bounds from Krylov subspaces
• A Restarted GMRES Method Augmented with Eigenvectors
• Application of Vector-Valued Rational Approximations to the Matrix Eigenvalue Problem and Connections with Krylov Subspace Methods
• ILUT: A dual threshold incomplete LU factorization
• On the roots of the orthogonal polynomials and residual polynomials associated with a conjugate gradient method
• A Jacobi–Davidson Iteration Method for Linear Eigenvalue Problems
• On restarting the Arnoldi method for large nonsymmetric eigenvalue problems
• The principle of minimized iterations in the solution of the matrix eigenvalue problem