A new computational harmonic projection algorithm for large unsymmetric generalized eigenproblems
From MaRDI portal
Recommendations
- A new restarting method in the harmonic projection algorithm for computing the eigenvalues of a nonsymmetric matrix
- Harmonic projection methods for large non-symmetric eigenvalue problems
- A simpler harmonic Arnoldi method for computing interior eigenvalues of large matrices
- A modified harmonic block Arnoldi algorithm with adaptive shifts for large interior eigen\-problems
- A variant on harmonic Arnoldi method
Cited in
(8)- A projection method for generalized eigenvalue problems using numerical integration.
- A new restarting method in the harmonic projection algorithm for computing the eigenvalues of a nonsymmetric matrix
- A projection method for the computation of inner eigenvalues using high degree rational operators
- Convergence of Arnoldi's method for generalized eigenvalue problems
- Computing interior eigenvalues of conservative gyroscopic problems
- Preconditioned locally harmonic residual method for computing interior eigenpairs of certain classes of Hermitian matrices
- Harmonic projection methods for large non-symmetric eigenvalue problems
- A restarted induced dimension reduction method to approximate eigenpairs of large unsymmetric matrices
This page was built for publication: A new computational harmonic projection algorithm for large unsymmetric generalized eigenproblems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3599266)
