Papers
Topics
Authors
Recent
Search
2000 character limit reached

Explicit inverse of symmetric, tridiagonal near Toeplitz matrices with strictly diagonally dominant Toeplitz part

Published 3 Jun 2024 in math.NA and cs.NA | (2406.01035v1)

Abstract: This study investigates tridiagonal near-Toeplitz matrices in which the Toeplitz part is strictly diagonally dominant. The focus is on determining the exact inverse of these matrices and establishing upper bounds for the infinite norms of the inverse matrices. For cases with $b > 2$ and $b < -2$, we derive the compact form of the entries of the exact inverse. These results remain valid even when the matrices' corners are not diagonally dominant, specifically when $|\widetilde{b}| < 1$. Furthermore, we calculate the traces and row sums of the inverse matrices. Afterwards, we present upper bound theorems for the infinite norms of the inverse matrices. To demonstrate the effectiveness of the bounds and their application, we provide numerical results for solving Fisher's problem. Our findings reveal that the converging rates of fixed-point iterations closely align with the expected rates, and there is minimal disparity between the upper bounds and infinite norm of the inverse matrix. Specifically, this observation holds true when $b > 2$ with $\widetilde{b} \leq 1$ and $b < -2$ with $\widetilde{b} \geq -1$. For other cases, there is potential for further improvement in the obtained upper bounds. This study contributes to the field of numerical analysis of fixed-point iterations by improving the convergence rate of iterations and reducing the computing time of the inverse matrices.

Citations (1)

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.