The solution of unsymmetric tridiagonal Toeplitz systems by the strides reduction algorithm

DOI10.1016/0167-8191(94)90006-XMaRDI QIDQ1323644zbMATH OpenOpenAlexFDO

Authors W. S. Yousif, D. J. Evans

Publication date 4 December 1994

Published in Parallel Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0167-8191(94)90006-x

zbMATH Keywords

cyclic reduction methodimplicit finite difference equationslinear first order hyperbolic equationsparallel algorithmstridiagonal Toeplitz linear systems

Mathematics Subject Classification ID

Initial value problems for first-order hyperbolic systems (35L45) Direct numerical methods for linear systems and matrix inversion (65F05) Finite difference methods for initial value and initial-boundary value problems involving PDEs (65M06) Parallel numerical computation (65Y05)

Review text

The authors develop a cyclic reduction method for the fast numerical solution of unsymmetric constant tridiagonal Toeplitz linear systems which occur repeatedly in the solution of the implicit finite difference equations derived from linear first order hyperbolic equations under a variety of boundary conditions. This algorithm consists of successive reduction of the system to similar systems in a `stride of 2' with the first reduction stage being different from the remaining stages and also yields savings in storage and time. Also a reduction algorithm with `a stride of 3' is presented. This algorithm has the advantage that for the unsymmetric case all the reduction stages are identical. The methods discussed are shown to be viable parallel algorithms with the enhanced parallel stride of three as the most efficient one.

Recommendations

• scientific article; zbMATH DE number 554525
• The strides reduction algorithms for solving tridiagonal linear systems
• scientific article; zbMATH DE number 529796
• Strides reduction algorithms for block tridiagonal linear systems

Cited in

(3)

• Solving systems of symmetric Toeplitz tridiagonal equations: Rojo's algorithm revisited
• A comparison of the computatlonal complexities of the stride reduction methods
• The solution of periodic tridiagonal linear systems by the stride of 3 reduction algorithm

This page was built for publication: The solution of unsymmetric tridiagonal Toeplitz systems by the strides reduction algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1323644)