ScholarLens Back to search
2009•Computer Engineering and Applications JournalRequires access

Improved parallel algorithm for solving block-tridiagonal linear equations

Yufeng Nie

Open publisher page 2 citations

Abstract

A parallel algorithm for block-tridiagonal linear equations on distributed-memory multi-computers is presented.Making full use of the special structure of the coefficient matrix,the algorithm is based on decomposing the coefficient matrix properly and approximately disposing the matrix.The communication only needs twice between the adjacent processors.In theory,this paper gives a sufficient condition about effectivity of this algorithm.Finally,some numerical results on HP rx2600 cluster show that practice computing is consistent with theory.The algorithm’s parallelism is preferable.

About this research paper

What this paper is about

A parallel algorithm for block-tridiagonal linear equations on distributed-memory multi-computers is presented.Making full use of the special structure of the coefficient matrix,the algorithm is based on decomposing the coefficient matrix properly and approximately disposing the matrix.The communication only needs twice between the adjacent processors.In theory,this paper gives a sufficient condition about effectivity of this algorithm.Finally,some numerical results on HP rx2600 cluster show that practice computing is consistent with theory.The algorithm’s parallelism is preferable.

Why it matters

OpenAlex reports 2 citations for this work. Citation counts describe recorded attention and do not establish research quality.

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

A parallel algorithm for block-tridiagonal linear equations on distributed-memory multi-computers is presented.Making full use of the special structure of the coefficient matrix,the algorithm is based on decomposing the coefficient matrix properly and approximately disposing the matrix.The communication only needs twice between the adjacent processors.In theory,this paper gives a sufficient condition about effectivity of this algorithm.Finally,some numerical results on HP rx2600 cluster show that practice computing is consistent with theory.The algorithm’s parallelism is preferable.

Key concepts: Tridiagonal matrix, Coefficient matrix, Block (permutation group theory), Tridiagonal matrix algorithm, Algorithm, Matrix (chemical analysis), Computer science, Band matrix

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
Improved parallel algorithm for solving block-tridiagonal linear equations — Research Paper | ScholarLens