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

被引:34
|
作者
Nabben, R [1 ]
机构
[1] Univ Bielefeld, Fak Math, D-33501 Bielefeld, Germany
关键词
tridiagonal matrices; inverses of tridiagonal matrices; diagonal dominance; bounds of entries;
D O I
10.1016/S0024-3795(98)10146-5
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
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 nxn M-matrix this iterative refinement yields the exact inverse after n - 1 steps. (C) 1999 Elsevier Science Inc. All rights reserved.
引用
收藏
页码:289 / 305
页数:17
相关论文
共 50 条