An algorithm for determining if the inverse of a strictly diagonally dominant Stieltjes matrix is strictly ultrametric (Q1326464): Difference between revisions

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.