Paper Info
Title
A fast algorithm for solving tridiagonal quasi-Toeplitz linear systems.
Abstract
In this paper, we consider the solution of tridiagonal quasi-Toeplitz linear systems. By exploiting the special quasi-Toeplitz structure, we give a new decomposition form of the coefficient matrix. Based on this matrix decomposition form and combined with the Sherman–Morrison formula, we propose an efficient algorithm for solving the tridiagonal quasi-Toeplitz linear systems. Although our algorithm takes more floating-point operations (FLOPS) than the LU decomposition method, it needs less memory storage and data transmission and is about twice faster than the LU decomposition method. Numerical examples are given to illustrate the efficiency of our algorithm.
Year
DOI
Venue
2018
10.1016/j.aml.2017.06.016
Applied Mathematics Letters
Keywords
Field
DocType
Tridiagonal Toeplitz matrix,Direct methods, LU decomposition,Sherman–Morrison formula
Tridiagonal matrix,Mathematical optimization,Coefficient matrix,Matrix decomposition,Algorithm,Band matrix,Mathematics,LU decomposition,Tridiagonal matrix algorithm,Block matrix,Cholesky decomposition
Journal
Volume
ISSN
Citations 
75
0893-9659
0
PageRank 
References 
Authors
0.34
4
3
Name
Order
Citations
PageRank
Lei Du1124.37
Tomohiro Sogabe215420.86
Shao-Liang Zhang39219.06