A projection method for the computation of inner eigenvalues using high degree rational operators
This paper concerns matrices \(A\) that have a real spectrum and an orthonormal eigenbasis. The problem is the computation of the inner eigenvalues of \(A\) in a given interval \((a, b)\) such that neither \(a\) nor \(b\) is an eigenvalue of \(A\). The method is a projection technique that does not presuppose the spectrum of \(A\) to be known. The computation requires only a few multiplications of matrices and an inversion such that for some classes of matrices the algorithm is almost of linear complexity. Rounding errors are substantially reduced by a preprocessing that modifies the eigenvalues, leaving those in \((a, b)\) almost unchanged.
- A new computational harmonic projection algorithm for large unsymmetric generalized eigenproblems
- A new restarting method in the harmonic projection algorithm for computing the eigenvalues of a nonsymmetric matrix
- Inverse subspace bi-iteration and bi-Newton methods for computing spectral projectors
- Computing interior eigenvalues of large matrices
- scientific article; zbMATH DE number 2069268
- A sparse matrix arithmetic based on \({\mathfrak H}\)-matrices. I: Introduction to \({\mathfrak H}\)-matrices
- Eigenvalue computation in the 20th century
- Existence of H-matrix approximants to the inverse FE-matrix of elliptic operators with L^-coefficients
- Introduction to hierarchical matrices with applications.
- Low-rank Kronecker-product approximation to multi-dimensional nonlocal operators II. HKT representation of certain operators
- Numerical methods for large eigenvalue problems
This page was built for publication: A projection method for the computation of inner eigenvalues using high degree rational operators
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2471832)
