A fast algorithm for solving tridiagonal quasi-Toeplitz linear systems
From MaRDI portal
Publication:1680784
DOI10.1016/j.aml.2017.06.016zbMath1377.65037OpenAlexW2727575785MaRDI QIDQ1680784
Tomohiro Sogabe, Lei Du, Shao-Liang Zhang
Publication date: 16 November 2017
Published in: Applied Mathematics Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.aml.2017.06.016
algorithmnumerical examplesdirect methodsSherman-Morrison formulatridiagonal Toeplitz matrix\(L U\) decomposition
Computational methods for sparse matrices (65F50) Direct numerical methods for linear systems and matrix inversion (65F05) Toeplitz, Cauchy, and related matrices (15B05)
Related Items
A fast algorithm for solving diagonally dominant symmetric quasi-pentadiagonal Toeplitz linear systems ⋮ A fast method for solving quasi-pentadiagonal Toeplitz linear systems and its application to the Lax-Wendroff scheme ⋮ Numerical algorithms for corner-modified symmetric Toeplitz linear system with applications to image encryption and decryption ⋮ New algorithm for solving pentadiagonal CUPL-Toeplitz linear systems ⋮ A fast method for solving a block tridiagonal quasi-Toeplitz linear system ⋮ Fast algorithms for finding the solution of CUPL-Toeplitz linear system from Markov chain ⋮ Fast solvers for tridiagonal Toeplitz linear systems ⋮ An improvement of methods for solving the CUPL-Toeplitz linear system
Cites Work
- A parallel algorithm solving a tridiagonal Toeplitz linear system
- A fast algorithm for solving special tridiagonal systems
- A communication-less parallel algorithm for tridiagonal Toeplitz systems
- A fast method for solving a class of tridiagonal linear systems
- A pivoting strategy for symmetric tridiagonal matrices
- Tridiagonal Toeplitz matrices: properties and novel applications
- A parallel method for linear equations with tridiagonal Toeplitz coefficient matrices