1989ACM SIGNUM NewsletterRequires access

A comparison of sequential and parallel elimination methods for tridiagonal matrices

D. J. Evans

Open publisher page 0 citations

Abstract

In this paper, parallel forms of the Gaussian and Jordan Elimination schemes for solving the tridiagonal linear systems which occur frequently in Computational Mathematics are developed and compared with the existing sequential algorithms.

About this research paper

What this paper is about

In this paper, parallel forms of the Gaussian and Jordan Elimination schemes for solving the tridiagonal linear systems which occur frequently in Computational Mathematics are developed and compared with the existing sequential algorithms.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

In this paper, parallel forms of the Gaussian and Jordan Elimination schemes for solving the tridiagonal linear systems which occur frequently in Computational Mathematics are developed and compared with the existing sequential algorithms.

Key concepts: Tridiagonal matrix, Tridiagonal matrix algorithm, Gaussian elimination, Computer science, Parallel computing, Linear system, Algorithm, Gaussian

Related papers

Back to paper searchBrowse research topicsOriginal source
A comparison of sequential and parallel elimination methods for tridiagonal matrices — Research Paper | ScholarLens