An algorithm for determining if the inverse of a strictly diagonally dominant Stieltjes matrix is strictly ultrametric (Q1326464): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q3359644 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A Linear Algebra Proof that the Inverse of a Strictly Ultrametric Matrix is a Strictly Diagonally Dominant Stieltjes Matrix / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5342712 / rank | |||
Normal rank | |||
Revision as of 14:58, 22 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An algorithm for determining if the inverse of a strictly diagonally dominant Stieltjes matrix is strictly ultrametric |
scientific article |
Statements
An algorithm for determining if the inverse of a strictly diagonally dominant Stieltjes matrix is strictly ultrametric (English)
0 references
26 September 1994
0 references
The authors develop an algorithm, based on graph theory, which determines if a given strictly diagonally dominant Stieltjes matrix has a strictly ultrametric inverse. This algorithm does not require the computation of the inverse. Moreover, this algorithm uniquely determines this inverse as a special sum of rank one matrices.
0 references
algorithm
0 references
Stieltjes matrix
0 references
ultrametric inverse
0 references
