Lower eigenvalue bounds for pencils of matrices

DOI10.1016/0024-3795(87)90211-4zbMath0613.15011OpenAlexW4206028080MaRDI QIDQ1088752

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

zbMATH Keywords

convergenceeigenvaluesupper and lower boundsmatrix pencilStieltjes matrix

Mathematics Subject Classification ID

Inequalities involving eigenvalues and eigenvectors (15A42) Iterative numerical methods for linear systems (65F10) Matrix pencils (15A22)

Related Items (10)

A study of the method of approximate factorization for solving grid elliptic boundary-value problems ⋮ Graph perturbations ⋮ Conditioning analysis of positive definite matrices by approximate factorizations ⋮ On the robustness of modified incomplete factorization methods ⋮ Conditioning analysis of sparse block approximate factorizations ⋮ Lower eigenvalue bounds for singular pencils of matrices ⋮ Iterative solution methods ⋮ Approximate factorizations with S/P consistently ordered M-factors ⋮ Incomplete factorizations of singular linear systems ⋮ Modified block-approximate factorization strategies

Cites Work

• Unnamed Item
• Unnamed Item
• Upper eigenvalue bounds for pencils of matrices
• On Axelsson's perturbations
• Semistrict Diagonal Dominance
• A class of first order factorization methods
• A generalized SSOR method

This page was built for publication: Lower eigenvalue bounds for pencils of matrices