Lower eigenvalue bounds for pencils of matrices
From MaRDI portal
(Redirected from Publication:1088752)
Recommendations
Cites work
- scientific article; zbMATH DE number 3854346 (Why is no real title available?)
- scientific article; zbMATH DE number 3760340 (Why is no real title available?)
- A class of first order factorization methods
- A generalized SSOR method
- On Axelsson's perturbations
- Semistrict Diagonal Dominance
- Upper eigenvalue bounds for pencils of matrices
Cited in
(15)- On the robustness of modified incomplete factorization methods
- Iterative solution methods
- Graph perturbations
- Lower and upper bounds for the number of distinct eigenvalues of a perturbed regular matrix pencil
- Lower bounds for the eigenvalues of Laplacian matrices
- Localization of the eigenvalues of a pencil of positive definite matrices
- Modified block-approximate factorization strategies
- Conditioning analysis of positive definite matrices by approximate factorizations
- Conditioning analysis of sparse block approximate factorizations
- Approximate factorizations with S/P consistently ordered M-factors
- 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)