Combinatorial characterization of the null spaces of symmetric H-matrices (Q1887495): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: LSQR / rank | |||
Normal rank | |||
Revision as of 05:04, 29 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Combinatorial characterization of the null spaces of symmetric H-matrices |
scientific article |
Statements
Combinatorial characterization of the null spaces of symmetric H-matrices (English)
0 references
26 November 2004
0 references
The paper provides: a) a combinatorial characterization of the null spaces of three families of symmetric matrices (symmetric diagonally dominant \(M\)-matrices (SDDM matrices), symmetric diagonally dominant matrices (SDD matrices) and symmetric \(H\)-matrices with non-negative diagonal entries (\( H^{+}\) matrices), and b) efficient algorithms, which rely on this combinatorial characterization, to construct bases for the null spaces of such matrices. Finally, the paper shows how to use these results to accurately determine the rank of SDD matrices and how to solve singular linear systems whose coefficient matrices are SDD.
0 references
combinatorial matrix theory
0 references
signed graphs
0 references
gain graphs
0 references
factor width
0 references
null space
0 references
matroids
0 references
singular linear systems
0 references
symmetric diagonally dominant \(M\)-matrices
0 references
symmetric \(H\)-matrices
0 references
algorithms
0 references
rank
0 references
