Engineering Papers⌕ Search

NASA NTRS · 19740024891

Parallel tridiagonal equation solvers

Abstract

Three parallel algorithms were compared for the direct solution of tridiagonal linear systems of equations. The algorithms are suitable for computers such as ILLIAC 4 and CDC STAR. For array computers similar to ILLIAC 4, cyclic odd-even reduction has the least operation count for highly structured sets of equations, and recursive doubling has the least count for relatively unstructured sets of equations. Since the difference in operation counts for these two algorithms is not substantial, their relative running times may be more related to overhead operations, which are not measured in this paper. The third algorithm, based on Buneman's Poisson solver, has more arithmetic operations than the others, and appears to be the least favorable. For pipeline computers similar to CDC STAR, cyclic odd-even reduction appears to be the most preferable algorithm for all cases.

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Stone, H. S.. 1974-04-01. Parallel tridiagonal equation solvers. https://engineeringpapers.com/record/nasa%3A19740024891/parallel-tridiagonal-equation-solvers

Citations retain the original authors and DOI and include this site’s record URL. If this discovery service contributed to your research, you can also cite Engineering Papers by Indiciae: BibTeX · RIS.