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

J Verkaik; HX Lin

doi:doi:10.1016/j.parco.2005.01.002

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

J Verkaik, HX Lin

Mathematical Physics

Research output: Contribution to journal › Article › Scientific › peer-review

7 Citations (Scopus)

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

Original language	Undefined/Unknown
Pages (from-to)	563-587
Number of pages	25
Journal	Parallel Computing
Volume	31
Issue number	6
DOIs	https://doi.org/doi:10.1016/j.parco.2005.01.002
Publication status	Published - 2005

Keywords

Wiskunde en Informatica
Techniek
technische Wiskunde en Informatica
academic journal papers
ZX CWTS JFIS < 1.00

Access to Document

doi:10.1016/j.parco.2005.01.002

Cite this

@article{b5eb5b4e5c384cd88362239aff9861f2,

title = "A class of novel parallel algorithms for the solution of tridiagonal systems",

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",

keywords = "Wiskunde en Informatica, Techniek, technische Wiskunde en Informatica, academic journal papers, ZX CWTS JFIS < 1.00",

author = "J Verkaik and HX Lin",

year = "2005",

doi = "doi:10.1016/j.parco.2005.01.002",

language = "Undefined/Unknown",

volume = "31",

pages = "563--587",

journal = "Parallel Computing",

issn = "0167-8191",

publisher = "Elsevier",

number = "6",

}

TY - JOUR

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

AU - Verkaik, J

AU - Lin, HX

PY - 2005

Y1 - 2005

N2 - 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

AB - 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

KW - Wiskunde en Informatica

KW - Techniek

KW - technische Wiskunde en Informatica

KW - academic journal papers

KW - ZX CWTS JFIS < 1.00

U2 - doi:10.1016/j.parco.2005.01.002

DO - doi:10.1016/j.parco.2005.01.002

M3 - Article

VL - 31

SP - 563

EP - 587

JO - Parallel Computing

JF - Parallel Computing

SN - 0167-8191

IS - 6

ER -