Accurate computation of the smallest eigenvalue of a diagonally dominant M -matrix

摘要: If each off-diagonal entry and the sum of row a diagonally dominant M-matrix are known to certain relative accuracy, then its smallest eigenvalue entries inverse same order accuracy independent any condition numbers. In this paper, we devise algorithms that compute these quantities with errors in magnitude machine precision. Rounding error analysis numerical examples presented demonstrate behaviour algorithms.