A class of novel parallel algorithms for the solution of tridiagonal systems

Journal article (2005)

Authors

J Verkaik External organisation
H.X. Lin Mathematical Physics - EEMCS
Research Group
Mathematical Physics (EEMCS) (TU Delft)
Techniek
More Info
expand_more

Published Date

2005

Language

Undefined/Unknown

Reuse Rights

Other than for strictly personal use, it is not permitted to download, forward or distribute the text or part of it, without the consent of the author(s) and/or copyright holder(s), unless the work is under an open content license such as Creative Commons.

Faculty

Electrical Engineering, Mathematics and Computer Science

Department

Delft Institute of Applied Mathematics

Research Group

Mathematical Physics

Abstract

In this paper, a new class of parallel Gaussian elimination algorithms is presented for the solution of tridiagonal matrix systems. The new algorithms, called ACER (alternating cyclic elimination and reduction), combine the advantages of the well known cyclic elimination algorithm (which is fast) and the cyclic reduction algorithms (which requires fewer operations). The ACER algorithms are developed with the unifying graph model.

Keywords: Parallel matrix algorithm; ACER algorithms; Graph transformation; Unifying graph model