The undirected graph and estimates of matrix singular values (Q1124802): Difference between revisions
From MaRDI portal
Set profile property. |
Created claim: Wikidata QID (P12): Q126421612, #quickstatements; #temporary_batch_1723453003539 |
||
| (One intermediate revision by one other user not shown) | |||
| Property / cites work | |||
| Property / cites work: Matrix Analysis / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A Gershgorin-type lower bound for the smallest singular value / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Some simple estimates for singular values of a matrix / rank | |||
Normal rank | |||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q126421612 / rank | |||
Normal rank | |||
Latest revision as of 10:00, 12 August 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The undirected graph and estimates of matrix singular values |
scientific article |
Statements
The undirected graph and estimates of matrix singular values (English)
0 references
28 November 1999
0 references
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.
0 references
singular values
0 references
undirected graph
0 references
absolute row sums
0 references
column sums
0 references
estimates
0 references
