A fast method for solving a block tridiagonal quasi-Toeplitz linear system (Q2211438)

From MaRDI portal
scientific article
Language Label Description Also known as
English
A fast method for solving a block tridiagonal quasi-Toeplitz linear system
scientific article

    Statements

    A fast method for solving a block tridiagonal quasi-Toeplitz linear system (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    11 November 2020
    0 references
    Summary: This paper addresses the problem of solving block tridiagonal quasi-Toeplitz linear systems. Inspired by [\textit{L. Du} et al., Appl. Math. Lett. 75, 74--81 (2018; Zbl 1377.65037)], we propose a more general algorithm for such systems. The algorithm is based on a block decomposition for block tridiagonal quasi-Toeplitz matrices and the Sherman-Morrison-Woodbury inversion formula. We also compare the proposed approach to the standard block \(LU\) decomposition method and the Gauss algorithm. A theoretical error analysis is also presented. All algorithms have been implemented in Matlab. Numerical experiments performed on a wide variety of test problems show the effectiveness of our algorithm in terms of efficiency, stability and robustness.
    0 references
    0 references
    system of linear equations
    0 references
    block tridiagonal quasi-Toeplitz matrix
    0 references
    block LU decomposition
    0 references
    Sherman-Morrison-Woodbury inversion formula
    0 references
    0 references
    0 references
    0 references
    0 references