Symbolic algorithms for the inverses of general k-tridiagonal matrices

Symbolic algorithms for the inverses of general k-tridiagonal matrices

0.00 Avg rating0 Votes
Article ID: iaor201530128
Volume: 70
Issue: 12
Start Page Number: 3032
End Page Number: 3042
Publication Date: Dec 2015
Journal: Computers and Mathematics with Applications
Authors: ,
Keywords: matrices, numerical analysis
Abstract:

Two symbolic algorithms for inverting k equ1‐tridiagonal matrices have been recently found by El‐Mikkawy and Atlan (2014, 2015). These two algorithms are mainly based on the Doolittle LU factorization of the k ‐tridiagonal matrix. In the current paper, we present a new explicit analytic expression for the inverses of general tridiagonal matrices at first. By using a block diagonalization technique, we then relate k ‐tridiagonal matrix inversion to tridiagonal matrix inversion. Meanwhile, an efficient algorithm is derived for computing the inverses of nonsingular k ‐tridiagonal matrices with the help of any algorithm for computing the inverses of tridiagonal matrices. Three examples are given in order to illustrate the performance and efficiency of the proposed algorithms.

Reviews

Required fields are marked *. Your email address will not be published.