A fast algorithm for solving banded Toeplitz systems
From MaRDI portal
Publication:2006577
DOI10.1016/j.camwa.2015.10.010zbMath1443.65029OpenAlexW2152156127MaRDI QIDQ2006577
Skander Belhaj, Marwa Dridi, Ahmed Salam
Publication date: 11 October 2020
Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.camwa.2015.10.010
Direct numerical methods for linear systems and matrix inversion (65F05) Linear equations (linear algebraic aspects) (15A06) Toeplitz, Cauchy, and related matrices (15B05)
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- A direct method to solve block banded block Toeplitz systems with non-banded Toeplitz blocks
- The cyclic reduction algorithm: From Poisson equation to stochastic processes and beyond. In memoriam of Gene H. Golub
- Recursive algorithms for unbalanced banded Toeplitz systems
- Bauer-type factorization of positive matrices and the theory of matrix polynomials orthogonal on the unit circle
- A note on the solution of not balanced banded Toeplitz systems
- Efficient implementation of wilson's algorithm for factorizing a self-reciprocal polynomial
- Effective Methods for Solving Banded Toeplitz Systems
- On Fourier-Toeplitz Methods for Separable Elliptic Problems
- Conjugate Gradient Methods for Toeplitz Systems
- Accuracy and Stability of Numerical Algorithms
- On the solution of block Hessenberg systems
- Displacement Structure: Theory and Applications
- Fast solution of unsymmetric banded Toeplitz systems by means of spectral factorizations and Woodbury's formula