Lower eigenvalue bounds for pencils of matrices
From MaRDI portal
Publication:1088752
DOI10.1016/0024-3795(87)90211-4zbMATH Open0613.15011OpenAlexW4206028080MaRDI QIDQ1088752FDOQ1088752
Authors: Robert Beauwens
Publication date: 1987
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0024-3795(87)90211-4
Recommendations
Inequalities involving eigenvalues and eigenvectors (15A42) Iterative numerical methods for linear systems (65F10) Matrix pencils (15A22)
Cites Work
Cited In (15)
- On the robustness of modified incomplete factorization methods
- Iterative solution methods
- Graph perturbations
- Localization of the eigenvalues of a pencil of positive definite matrices
- Lower and upper bounds for the number of distinct eigenvalues of a perturbed regular matrix pencil
- Lower bounds for the eigenvalues of Laplacian matrices
- Modified block-approximate factorization strategies
- Conditioning analysis of positive definite matrices by approximate factorizations
- Approximate factorizations with S/P consistently ordered M-factors
- Conditioning analysis of sparse block approximate factorizations
- Incomplete factorizations of singular linear systems
- A study of the method of approximate factorization for solving grid elliptic boundary-value problems
- Lower eigenvalue bounds for singular pencils of matrices
- Alternatives to Bazley's special choice for eigenvalue lower bounds
- Upper eigenvalue bounds for pencils of matrices
This page was built for publication: Lower eigenvalue bounds for pencils of matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1088752)