Rigorous Error Bounds for Computer Eigensystems
From MaRDI portal
Cited in
(20)- Computable bounds for eigenvalues and eigenfunctions of elliptic differential operators
- On Euler-like methods for the simultaneous approximation of polynomial zeros
- Error bounds for computed eigenvalues and eigenvectors
- An a posteriori verification method for generalized real-symmetric eigenvalue problems in large-scale electronic state calculations
- Enclosing Moore-Penrose inverses
- Approximation and asymptotics of eigenvalues of unbounded self-adjoint Jacobi matrices acting in \(l^{2}\) by the use of finite submatrices
- A posteriori error bounds for the zeros of polynomials
- Almost diagonal matrices with multiple or close eigenvalues
- Perturbation d'une matrice hermitienne ou normale. (Perturbation of a hermitian on normal matrix)
- The group numerical analysis: On the computation of Mathieu functions
- Variation of the eigenvalues of a special class of Hermitian matrices upon variation of some of its elements
- An error analysis of Householder's method for the symmetric eigenvalue problem
- Explicit Error Estimates for Eigenvalues of Some Unbounded Jacobi Matrices
- Bounds for Eigenvalues of Tridiagonal Symmetric Matrices Computed by the LR Method
- On Solving Systems of Equations Using Interval Arithmetic
- On smallest isolated Gerschgorin disks for eigenvalues
- Verified eigenvalue and eigenvector computations using complex moments and the Rayleigh-Ritz procedure for generalized Hermitian eigenvalue problems
- Verified error bounds for eigenvalues of geometric multiplicity \(q\) and corresponding invariant subspaces
- Computing the spectrum and pseudospectrum of infinite-volume operators from local patches
- Asymptotics of large eigenvalues for some discrete unbounded Jacobi matrices
This page was built for publication: Rigorous Error Bounds for Computer Eigensystems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3847699)