Symbolic algorithms for the inverses of general k-tridiagonal matrices

Two symbolic algorithms for inverting k-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...

Full description

Saved in:
Bibliographic Details
Published in:Computers & mathematics with applications (1987) Vol. 70; no. 12; pp. 3032 - 3042
Main Authors: Jia, Jiteng, Li, Sumei
Format: Journal Article
Language:English
Published: Elsevier Ltd 01.12.2015
Subjects:
[formula omitted]-tridiagonal matrices
Block diagonalization
Computational cost
Inverses
Tridiagonal matrices
Tridiagonal matrices
Inverses
k-tridiagonal matrices
Computational cost
Block diagonalization
ISSN:0898-1221, 1873-7668
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Two symbolic algorithms for inverting k-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.
ISSN:0898-1221
1873-7668
DOI:10.1016/j.camwa.2015.10.018