TY - JOUR
T1 - Explicit inverse of symmetric, tridiagonal near Toeplitz matrices with strictly diagonally dominant Toeplitz part
AU - Kurmanbek, Bakytzhan
AU - Erlangga, Yogi
AU - Amanbek, Yerlan
N1 - Publisher Copyright:
© 2025 the author(s), published by De Gruyter.
PY - 2025/1/1
Y1 - 2025/1/1
N2 - Let Tn = tridiag (-1,b,-1), an n×n symmetric, strictly diagonally dominant tridiagonal matrix (|b| > 2). This article investigates tridiagonal near-Toeplitz matrices Tn:= [ti,j], obtained by perturbing the (1, 1) and (n, n) entry of Tn . Let t1,1 = tn,n = b ≠ b. We derive exact inverses of Tn. Furthermore, we demonstrate that these results hold even when |b| < 1. Additionally, we establish upper bounds for the infinite norms of the inverse matrices. The row sums and traces of the inverse provide insight into the matrix's spectral properties and play a key role in understanding the convergence of fixed-point iterations. These metrics allow us to derive tighter bounds on the infinite norms and improve computational efficiency. Numerical results for Fisher's problem demonstrate that the derived bounds closely match the actual infinite norms, particularly for b > 2 with b ≤ 1 and b< - 2 with b ≥-1 . For other cases, further refinement of the bounds is possible. Our results contribute to improving the convergence rates of fixed-point iterations and reducing the computation time for matrix inversion.
AB - Let Tn = tridiag (-1,b,-1), an n×n symmetric, strictly diagonally dominant tridiagonal matrix (|b| > 2). This article investigates tridiagonal near-Toeplitz matrices Tn:= [ti,j], obtained by perturbing the (1, 1) and (n, n) entry of Tn . Let t1,1 = tn,n = b ≠ b. We derive exact inverses of Tn. Furthermore, we demonstrate that these results hold even when |b| < 1. Additionally, we establish upper bounds for the infinite norms of the inverse matrices. The row sums and traces of the inverse provide insight into the matrix's spectral properties and play a key role in understanding the convergence of fixed-point iterations. These metrics allow us to derive tighter bounds on the infinite norms and improve computational efficiency. Numerical results for Fisher's problem demonstrate that the derived bounds closely match the actual infinite norms, particularly for b > 2 with b ≤ 1 and b< - 2 with b ≥-1 . For other cases, further refinement of the bounds is possible. Our results contribute to improving the convergence rates of fixed-point iterations and reducing the computation time for matrix inversion.
KW - diagonal dominance
KW - exact inverses
KW - Toeplitz matrices
KW - upper bounds
UR - http://www.scopus.com/inward/record.url?scp=105002573951&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=105002573951&partnerID=8YFLogxK
U2 - 10.1515/spma-2024-0032
DO - 10.1515/spma-2024-0032
M3 - Article
AN - SCOPUS:105002573951
SN - 2300-7451
VL - 13
JO - Special Matrices
JF - Special Matrices
IS - 1
M1 - 20240032
ER -