Title of article
Inverses of Block Tridiagonal Matrices and Rounding Errors
Author/Authors
Wu, Chi-Ye Jinan University - Shenzhen, Guangdong, P. R. China , Huang, Ting-Zhu School of Mathematical Sciences - University of Electronic Science and Technology of China, Chengdu, Sichuan, P. R. China , Li, Liang School of Mathematical Sciences - University of Electronic Science and Technology of China, Chengdu, Sichuan, P. R. China , Lv, Xiao-Guang School of Mathematical Sciences - University of Electronic Science and Technology of China, Chengdu, Sichuan, P. R. China
Pages
12
From page
307
To page
318
Abstract
Based on URV-decomposition in Stewart [An updating algorithm for subspace tracking, IEEE Trans. Signal Processing, 40 (1992): 1535[1541] and the result of Mehrmann [Divide and conquer methods for block tridiagonal systems, Parallel Comput., 19 (1993): 257[279], inverses of block tridiagonal matrices are presented. The computational complexity of the proposed algorithm is less than that of the Block Gaussian-Jordan Elimination method when the orders of the matrices are not less than 100. Expressions for the rounding errors incurred during the process of the computation of the inverses of block tridiagonal matrices are also considered. Moreover, from the experiment, it shows that the norms of the errors generated from the Block Gaussian-Jordan Elimination method are larger than those of the proposed algorithm.
Keywords
Block tridiagonal matrices , inverse , divide , and , conquer algorithm , block Gaussian , Jordan elimination , rounding error
Journal title
Bulletin of the Malaysian Mathematical Sciences Society
Serial Year
2011
Journal title
Bulletin of the Malaysian Mathematical Sciences Society
Record number
2686306
Link To Document