Two-sided bounds on the inverses of diagonally dominant tridiagonal matrices Original Research Article

We establish upper and lower bounds for the entries of the inverses of diagonally dominant tridiagonal matrices. These bounds improve the bounds recently given by Shivakumar and Ji. Moreover, we show how to improve our bounds iteratively. For an n × n M-matrix this iterative refinement yields the exact inverse after n − 1 steps.