On solution of large systems of linear equations with block-Toeplitz banded matrices
From MaRDI portal
Publication:2375976
DOI10.1134/S1064562413020099zbMath1269.65028OpenAlexW2050519484MaRDI QIDQ2375976
Publication date: 25 June 2013
Published in: Doklady Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1134/s1064562413020099
algorithmcyclic reductionblock-Toeplitz matrixbackward roundoff-error stabilitynarrow-banded matrices
Computational methods for sparse matrices (65F50) Direct numerical methods for linear systems and matrix inversion (65F05) Toeplitz, Cauchy, and related matrices (15B05)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Computing invariant subspaces of a regular linear pencil of matrices
- The cyclic reduction algorithm: From Poisson equation to stochastic processes and beyond. In memoriam of Gene H. Golub
- Wrap-around partitioning for block bidiagonal linear systems
- Stable Parallel Algorithms for Two-Point Boundary Value Problems
- Effective Methods for Solving Banded Toeplitz Systems
This page was built for publication: On solution of large systems of linear equations with block-Toeplitz banded matrices