A bidiagonalization-based numerical algorithm for computing the inverses of (p,q)-tridiagonal matrices

As a generalization of k -tridiagonal matrices, many variations of ( p , q )-tridiagonal matrices have attracted much attention over the years. In this paper, we present an efficient algorithm for numerically computing the inverses of n -square ( p , q )-tridiagonal matrices under a certain conditio...

Full description

Saved in:
Bibliographic Details
Published in:Numerical algorithms Vol. 93; no. 2; pp. 899 - 917
Main Authors: Jia, Ji-Teng, Xie, Rong, Xu, Xiao-Yan, Ni, Shuo, Wang, Jie
Format: Journal Article
Language:English
Published: New York Springer US 01.06.2023
Springer Nature B.V
Subjects:
Algebra
Algorithms
Banded structure
Boundary value problems
Computation
Computer Science
Matlab
Numeric Computing
Numerical Analysis
Original Paper
Partial differential equations
Theory of Computation
Tridiagonal matrices
Inverses
15A20
65F50
Bidiagonal matrices
Bidiagonalization
(
15B05
,
ISSN:1017-1398, 1572-9265
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:As a generalization of k -tridiagonal matrices, many variations of ( p , q )-tridiagonal matrices have attracted much attention over the years. In this paper, we present an efficient algorithm for numerically computing the inverses of n -square ( p , q )-tridiagonal matrices under a certain condition. The algorithm is based on the combination of a bidiagonalization approach which preserves the banded structure and sparsity of the original matrix, and a recursive algorithm for inverting general lower bidiagonal matrices. Some numerical results with simulations in MATLAB implementation are provided in order to illustrate the accuracy and efficiency of the proposed algorithms, and its competitiveness with MATLAB built-in function.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1017-1398
1572-9265
DOI:10.1007/s11075-022-01446-0