Related papers: Explicit inverse of tridiagonal matrix with applic…
In this paper, we provide explicit formulas for the exact inverses of the symmetric tridiagonal near-Toeplitz matrices characterized by weak diagonal dominance in the Toeplitz part. Furthermore, these findings extend to scenarios where the…
This paper discusses the explicit inverse of a class of seven-diagonal (near) Toeplitz matrices, which arises in the numerical solutions of nonlinear fourth-order differential equation with a finite difference method. A non-recurrence…
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…
We develop a self-contained framework for real tridiagonal Toeplitz matrices $A_n(a,b,c)$ (diagonal $b$, subdiagonal $a$, superdiagonal $c$) in the symmetrisable regime $ac>0$. A diagonal similarity transforms $A_n(a,b,c)$ into a symmetric…
We present here necessary and sufficient conditions for the invertibility of circulant and symmetric matrices that depend on three parameters and moreover, we explicitly compute the inverse. The techniques we use are related with the…
A well known numerical task is the inversion of large symmetric tridiagonal Toeplitz matrices, i.e., matrices whose entries equal $a$ on the diagonal and $b$ on the extra diagonals ($a, b\in \mathbb R$). The inverses of such matrices are…
We present here the necessary and sufficient conditions for the invertibility of tridiagonal matrices, commonly named Jacobi matrices, and explicitly compute their inverse. The techniques we use are related with the solution of…
The results on the inversion of convolution operators as well as Toeplitz (and block Toeplitz) matrices in the $1$-D (one-dimensional) case are classical and have numerous applications. Last year, we considered the $2$-D case of…
Finding the inverse of a matrix is an open problem especially when it comes to engineering problems due to their complexity and running time (cost) of matrix inversion algorithms. An optimum strategy to invert a matrix is, first, to reduce…
This paper analyzes the convergence of fixed-point iterations of the form u = f(u) and the properties of the inverse of the related pentadiagonal matrices, associated with the fourth-order nonlinear beam equation. This nonlinear problem is…
The results on the inversion of convolution operators and Toeplitz matrices in the 1-D (one dimensional) case are classical and have numerous applications. We consider a 2-D case of Toeplitz-block Toeplitz matrices, describe a minimal…
A novel factorization for the sum of two single-pair matrices is established as product of lower-triangular, tridiagonal, and upper-triangular matrices, leading to semi-closed-form formulas for tridiagonal matrix inversion. Subsequent…
For a two-parameter family of lower triangular matrices with entries involving Jacobi polynomials an explicit inverse is given, with entries involving a sum of two Jacobi polynomials. The formula simplifies in the Gegenbauer case and then…
We investigate the joint convergence of independent random Toeplitz matrices with complex input entries that have a pair-correlation structure, along with deterministic Toeplitz matrices and the backward identity permutation matrix.…
A new generalized matrix inverse is derived which is consistent with respect to arbitrary nonsingular diagonal transformations, e.g., it preserves units associated with variables under state space transformations, thus providing a general…
For a one-parameter family of lower triangular matrices with entries involving continuous $q$-ultraspherical polynomials we give an explicit lower triangular inverse matrix, with entries involving again continuous $q$-ultraspherical…
In this paper, we consider matrices whose inverses are tridiagonal Z--matrices. Based on a characterization of symmetric tridiagonal matrices by Gantmacher and Krein, we show that a matrix is the inverse of a tridiagonal Z--matrix if and…
We prove some formulas relating the inverse of a Cartan matrix with algebraic and geometric invariants of finite group representations.
Let $A_\alpha$ be the semi-infinite tridiagonal matrix having subdiagonal and superdiagonal unit entries, $(A_\alpha)_{11}=\alpha$, where $\alpha\in\mathbb C$, and zero elsewhere. A basis $\{P_0,P_1,P_2,\ldots\}$ of the linear space…
If $A$ is a tridiagonal matrix, then the equations $AX=I$ and $XA=I$ defining the inverse $X$ of $A$ are in fact the second order recurrence relations for the elements in each row and column of $X$. Thus, the recursive algorithms should be…