A direct method to solve block banded block Toeplitz systems with non-banded Toeplitz blocks
DOI10.1016/j.cam.2010.02.029zbMath1189.65052OpenAlexW1981369412MaRDI QIDQ972758
Andrey Chesnokov, Marc Van Barel
Publication date: 21 May 2010
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cam.2010.02.029
computational complexitynumerical experimentsSherman-Morrison-Woodbury formulablock banded block Toeplitz systemsfast solution algorithmfast Toeplitz solverToeplitz block matrices
Computational methods for sparse matrices (65F50) Complexity and performance of numerical algorithms (65Y20) Direct numerical methods for linear systems and matrix inversion (65F05) Toeplitz, Cauchy, and related matrices (15B05)
Related Items (5)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A fast algorithm for the inversion of general Toeplitz matrices
- Multigrid methods for indefinite Toeplitz matrices
- Improved cyclic reduction for solving queueing problems
- New PCG based algorithms for the solution of Hermitian Toeplitz systems
- A fast Hankel solver based on an inversion formula for Loewner matrices
- Look-ahead Levinson and Schur algorithms for non-Hermitian Toeplitz systems
- A Stabilized Superfast Solver for Nonsymmetric Toeplitz Systems
- Asymptotic Results on the Spectra of Block Toeplitz Preconditioned Matrices
- Effective Methods for Solving Banded Toeplitz Systems
- Conjugate Gradient Methods for Toeplitz Systems
This page was built for publication: A direct method to solve block banded block Toeplitz systems with non-banded Toeplitz blocks