Eigenvalue bounds and inequalities using vector aggregation of matrices

DOI10.1016/S0024-3795(97)00260-7zbMath0891.15012OpenAlexW2145077281WikidataQ126472536 ScholiaQ126472536MaRDI QIDQ1379086

L. Yu. Kolotilina

Publication date: 30 June 1998

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0024-3795(97)00260-7

zbMATH Keywords

eigenvalueblock matricesnormal matrixsingular valuevector aggregation

Mathematics Subject Classification ID

Inequalities involving eigenvalues and eigenvectors (15A42)

Related Items (6)

Problems of parallel solution of large systems of linear algebraic equations ⋮ Prefiltration technique via aggregation for constructing low‐density high‐quality factorized sparse approximate inverse preconditionings ⋮ An upper bound for the largest eigenvalue of a positive semidefinite block banded matrix ⋮ Inequalities for the extreme eigenvalues of block-partitioned Hermitian matrices with applications to spectral graph theory ⋮ Optimally conditioned block matrices ⋮ Nonsingularity/singularity criteria for nonstrictly block diagonally dominant matrices.

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Inertia characteristics of self-adjoint matrix polynomials
• Circular discs containing eigenvalues of normal matrices
• Remarks on Hermitian matrices
• Acceleration by aggregation of successive approximation methods
• Methods of aggregation
• Eigenvalue bounds for block preconditioned matrices
• Aggregation/Disaggregation for Eigenvalue Problems
• Iterative Aggregation--A New Approach to the Solution of Large-Scale Problems
• Inequalities connecting the eigenvalues of a hermitian matrix with the eigenvalues of complementary principal submatrices
• Rayleigh-Ritz and A. Weinstein Methods for Approximation of Eigenvalues

This page was built for publication: Eigenvalue bounds and inequalities using vector aggregation of matrices