Harmonic projection methods for large non-symmetric eigenvalue problems
From MaRDI portal
Recommendations
- A new computational harmonic projection algorithm for large unsymmetric generalized eigenproblems
- A variant on harmonic Arnoldi method
- A new restarting method in the harmonic projection algorithm for computing the eigenvalues of a nonsymmetric matrix
- A global harmonic Arnoldi method for large non-Hermitian eigenproblems with an application to multiple eigenvalue problems
- The harmonic Arnoldi method for solving the interior multiple eigenproblems
Cites work
- A Hybrid GMRES Algorithm for Nonsymmetric Linear Systems
- 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
- Adaptive polynomial preconditioning for Hermitian indefinite linear systems
- An adaptive Richardson iteration method for indefinite linear systems
- Application of Vector-Valued Rational Approximations to the Matrix Eigenvalue Problem and Connections with Krylov Subspace Methods
- Approximate Inverse Techniques for Block-Partitioned Matrices
- Approximate solutions and eigenvalue bounds from Krylov subspaces
- Generalizations of Davidson's method for computing eigenvalues of large nonsymmetric matrices
- Generalizations of Davidson’s Method for Computing Eigenvalues of Sparse Symmetric Matrices
- GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
- scientific article; zbMATH DE number 3671573 (Why is no real title available?)
- scientific article; zbMATH DE number 19432 (Why is no real title available?)
- ILUT: A dual threshold incomplete LU factorization
- Implicit Application of Polynomial Filters in a k-Step Arnoldi Method
- Numerical solution of large nonsymmetric eigenvalue problems
- On hybrid iterative methods for nonsymmetric systems of linear equations
- On restarting the Arnoldi method for large nonsymmetric eigenvalue problems
- On the roots of the orthogonal polynomials and residual polynomials associated with a conjugate gradient method
- Preconditioning techniques for nonsymmetric and indefinite linear systems
- Preconditioning the Lanczos Algorithm for Sparse Symmetric Eigenvalue Problems
- QMRPACK
- Quasi-kernel polynomials and their use in non-Hermitian matrix iterations
- Robust preconditioning of large, sparse, symmetric eigenvalue problems
- Simultaneous Iteration for Partial Eigensolution of Real Matrices
- Solution of Sparse Indefinite Systems of Linear Equations
- Sparse matrix test problems
- The Advantages of Inverted Operators in Rayleigh–Ritz Approximations
- The iterative calculation of a few of the lowest eigenvalues and corresponding eigenvectors of large real-symmetric matrices
- The principle of minimized iterations in the solution of the matrix eigenvalue problem
- Variations on Arnoldi's method for computing eigenelements of large unsymmetric matrices
Cited in
(57)- A new method for accelerating Arnoldi algorithms for large scale eigenproblems
- 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
- A new shift strategy for the implicitly restarted refined harmonic Lanczos method
- New methods for computing the Drazin-inverse solution of singular linear systems
- Simpler GMRES with deflated restarting
- 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 refined Arnoldi type method for large scale eigenvalue problems
- Comparative study of inner-outer Krylov solvers for linear systems in structured and high-order unstructured CFD problems
- Convergence proof of the harmonic Ritz pairs of iterative projection methods with restart strategies for symmetric eigenvalue problems
- The least squares and line search in extracting eigenpairs in Jacobi-Davidson method
- On a new variant of Arnoldi method for approximation of eigenpairs
- Harmonic and refined harmonic shift-invert residual Arnoldi and Jacobi-Davidson methods for interior eigenvalue problems
- A harmonic restarted Arnoldi algorithm for calculating eigenvalues and determining multiplicity
- A modified harmonic block Arnoldi algorithm with adaptive shifts for large interior eigen\-problems
- Incremental spectral preconditioners for sequences of linear systems
- A new shift scheme for the harmonic Arnoldi method
- A new restarting method in the harmonic projection algorithm for computing the eigenvalues of a nonsymmetric matrix
- A-posteriori residual bounds for Arnoldi's methods for nonsymmetric eigenvalue problems
- Convergence of Arnoldi's method for generalized eigenvalue problems
- A generalization of Saad's bound on harmonic Ritz vectors of Hermitian matrices
- Implicitly restarted global FOM and GMRES for nonsymmetric matrix equations and Sylvester equations
- Two harmonic Jacobi-Davidson methods for computing a partial generalized singular value decomposition of a large matrix pair
- Ritz and harmonic Ritz values and the convergence of FOM and GMRES
- Generalized Preconditioned Locally Harmonic Residual Method for Non-Hermitian Eigenproblems
- Subspace recycling accelerates the parametric macro-modeling of MEMS
- The coefficients of the FOM and GMRES residual polynomials
- Thick restarting the weighted harmonic Arnoldi algorithm for large interior eigenproblems
- Preconditioned locally harmonic residual method for computing interior eigenpairs of certain classes of Hermitian matrices
- A variant on harmonic Arnoldi method
- A preconditioned hybrid SVD method for accurately computing singular triplets of large matrices
- A new computational harmonic projection algorithm for large unsymmetric generalized eigenproblems
- Fast iterative interior eigensolver for millions of atoms
- Two-grid and multiple-grid Arnoldi for eigenvalues
- Fast Randomized Non-Hermitian Eigensolvers Based on Rational Filtering and Matrix Partitioning
- Thick restarting the weighted harmonic Golub-Kahan-Lanczos algorithm for the linear response eigenvalue problem
- An invert-free Arnoldi method for computing interior eigenpairs of large matrices
- The convergence of harmonic Ritz vectors and harmonic Ritz values, revisited
- PRIMME\_SVDS: a high-performance preconditioned SVD solver for accurate large-scale computations
- Restarted GMRES augmented with harmonic Ritz vectors for shifted linear systems
- GMRES with adaptively deflated restarting and its performance on an electromagnetic cavity problem
- Restarted block-GMRES with deflation of eigenvalues
- Generalisation of a quadrilateral duality theorem
- Residuals of refined projection methods for large matrix eigenproblems
- On the block GMRES method with deflated restarting
- Refined and refined harmonic Jacobi-Davidson methods for computing several GSVD components of a large regular matrix pair
- Implicitly restarted global Krylov subspace methods for matrix equations AXB = C
- A new variant of Arnoldi method for approximation of eigenpairs
- Solving advection equations with reduction multigrids on GPUs
- A refined harmonic Rayleigh-Ritz procedure and an explicitly restarted refined harmonic Arnoldi algorithm
- 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
- A global harmonic Arnoldi method for large non-Hermitian eigenproblems with an application to multiple eigenvalue problems
- Modified tangential frequency filtering decomposition and its Fourier analysis
- Fast eigenvalue calculations in a massively parallel plasma turbulence code
This page was built for publication: Harmonic projection methods for large non-symmetric eigenvalue problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4940813)
