A split-correct parallel algorithm for solving tridiagonal symmetric toeplitz systems

DOI10.1080/00207160008804986zbMath0970.65024OpenAlexW2134676649MaRDI QIDQ4518241

No author found.

Publication date: 6 March 2001

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207160008804986

zbMATH Keywords

parallel algorithmscirculanttridiagonal symmetric Toeplitz systems

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Parallel numerical computation (65Y05) Direct numerical methods for linear systems and matrix inversion (65F05)

Related Items (7)

Sufficient Conditions for Existence of the LU Factorization of Toeplitz Symmetric Tridiagonal Matrices ⋮ A communication-less parallel algorithm for tridiagonal Toeplitz systems ⋮ A parallel numerical algorithm for fredholm integro-differential two-point boundary value problems ⋮ A fast algorithm for solving diagonally dominant symmetric pentadiagonal Toeplitz systems ⋮ A parallel method for linear equations with tridiagonal Toeplitz coefficient matrices ⋮ Fast solvers for tridiagonal Toeplitz linear systems ⋮ A parallel numerical algorithm for near symmetric and banded systems

Cites Work

• Unnamed Item
• Unnamed Item
• A new method for solving symmetric circulant tridiagonal systems of linear equations
• A fast algorithm for solving special tridiagonal systems
• On the stability of the cyclic reduction without back substitution for tridiagonal systems
• On the Solution of Circulant Linear Systems

This page was built for publication: A split-correct parallel algorithm for solving tridiagonal symmetric toeplitz systems