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

Authors:
J. Verkaik;H. X. Lin
Affiliations:
TNO MADYMO BV, Schoemakerstraat 97, P.O. Box 6071, 2600 JA Delft, The Netherlands;Delft University of Technology, Delft Institute of Applied Mathematics (DIAM), Mekelweg 4, 2628 CD Delft, The Netherlands
Venue:
Parallel Computing
Year:
2005

Citing 7
Cited 1

Solving tridiagonal systems on ensemble architectures

SIAM Journal on Scientific and Statistical Computing
A Fast Direct Solution of Poisson's Equation Using Fourier Analysis

Journal of the ACM (JACM)
An Efficient Parallel Algorithm for the Solution of a Tridiagonal Linear System of Equations

Journal of the ACM (JACM)
The Solution of Tridiagonal Linear Systems on the CDC STAR 100 Computer

ACM Transactions on Mathematical Software (TOMS)
A Parallel Method for Tridiagonal Equations

ACM Transactions on Mathematical Software (TOMS)
A unifying graph model for designing parallel algorithms for tridiagonal systems

Parallel Computing - Linear systems and associated problems
Paper: Efficient logarithmic time parallel algorithms for the cholesky decomposition and gram-schmidt process

Parallel Computing

Parallel solution of large symmetric tridiagonal linear systems

Parallel Computing

Quantified Score

Hi-index	0.00

Visualization

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.