The undirected graph and estimates of matrix singular values
From MaRDI portal
Publication:1124802
New theorems for estimating the singular values of a matrix are established using the associated undirected graph. The location of singular values of a matrix \(A\) is described in terms of its deleted absolute row sums and column sums. The formulation has an appearance analogous to Brauer's and Brualdi' s theorems for eigenvalues. Examples show that in many cases more precise estimates can be obtained than those in the related literature.
Recommendations
Cites work
Cited in
(12)- Inclusion sets for the singular values of a square matrix
- On circuit inclusion sets for the singular values of a square matrix
- Inclusion sets for the singular values of a rectangular matrix
- Inclusion intervals of singular values and applications
- Digraphs and inclusion intervals of Brualdi-type for singular values
- Singular graph and extension of Jordan chains of an M-matrix
- Upper bounds for the largest singular value of certain digraph matrices
- Inclusion sets for singular values
- The digraphs and inclusion intervals of matrix singular value.
- scientific article; zbMATH DE number 1293802 (Why is no real title available?)
- A note on inclusion intervals of matrix singular values
- scientific article; zbMATH DE number 1525477 (Why is no real title available?)
This page was built for publication: The undirected graph and estimates of matrix singular values
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1124802)