Fast enclosure for all eigenvalues in generalized eigenvalue problems
DOI10.1016/j.cam.2009.11.048zbMath1188.65043OpenAlexW1965749137MaRDI QIDQ848556
Publication date: 4 March 2010
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cam.2009.11.048
error boundgeneralized eigenvalue problemspolynomial eigenvalue problemsguaranteed enclosurenon-Hermitian case
Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Inequalities involving eigenvalues and eigenvectors (15A42) Roundoff error (65G50) Algorithms with automatic result verification (65G20)
Related Items (6)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Norms and exclusion theorems
- A method of obtaining verified solutions for linear systems suited for Java
- On interval systems \([x = [A][x] + [b]\) and the powers of interval matrices in complex interval arithmetics]
- Guaranteed inclusions for the complex generalized eigenproblem
- The calculation of guaranteed bounds for eigenvalues using complementary variational principles
- Error bounds on complex floating-point multiplication
- Accuracy and Stability of Numerical Algorithms
- Fast enclosure of matrix eigenvalues and singular values via rounding mode controlled computation
- Computational error bounds for multiple or nearly multiple eigenvalues
- A simple method for error bounds of eigenvalues of symmetric matrices
This page was built for publication: Fast enclosure for all eigenvalues in generalized eigenvalue problems