Parallel cyclic odd-even reduction algorithms for solving Toeplitz tridiagonal equations on MIMD computers

DOI10.1016/0167-8191(93)90005-6MaRDI QIDQ1801375zbMATH OpenOpenAlexFDO

Authors M. P. Bekakos, D. J. Evans

Publication date 10 March 1994

Published in Parallel Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0167-8191(93)90005-6

zbMATH Keywords

performancecomputational complexitytridiagonal linear systemMIMD computercyclic odd-even reduction method

Mathematics Subject Classification ID

Direct numerical methods for linear systems and matrix inversion (65F05) Parallel numerical computation (65Y05) Complexity and performance of numerical algorithms (65Y20)

Recommendations

• scientific article; zbMATH DE number 708867
• scientific article; zbMATH DE number 1841800
• Optimized cyclic reduction for the solution of linear tridiagonal systems on parallel computers
• scientific article; zbMATH DE number 554525
• A parallel version of the cyclic reduction algorithm on a hypercube

Cited in

(2)

• scientific article; zbMATH DE number 708867 (Why is no real title available?)
• scientific article; zbMATH DE number 3928348 (Why is no real title available?)

This page was built for publication: Parallel cyclic odd-even reduction algorithms for solving Toeplitz tridiagonal equations on MIMD computers

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