ScholarLens Back to search
2011•Jisuanji fangzhenRequires access

Parallel Iterative Algorithm for Solving Block-Tridiagonal Linear Equations

LV Quan-yi

Open publisher page 0 citations

Abstract

During the solution of the science problems,a single processor can not satisfy the needs,parallel processing is a quite good solution to the block-tridiagonal linear equations.A parallel iterative 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 a parallel iterative algorithm based on decomposing the coefficient matrix properly.The communication between the adjacent processors only needs three times.Theoretically,this paper gives a sufficient condition about convergence of this algorithm.Finally,some numerical results on HP rx2600 cluster demonstrate that practice computing is consistent with theory.The algorithm 's parallelism is preferable.

About this research paper

What this paper is about

During the solution of the science problems,a single processor can not satisfy the needs,parallel processing is a quite good solution to the block-tridiagonal linear equations.A parallel iterative 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 a parallel iterative algorithm based on decomposing the coefficient matrix properly.The communication between the adjacent processors only needs three times.Theoretically,this paper gives a sufficient condition about convergence of this algorithm.Finally,some numerical results on HP rx2600 cluster demonstrate that practice computing is consistent with theory.The algorithm 's parallelism is preferable.

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

During the solution of the science problems,a single processor can not satisfy the needs,parallel processing is a quite good solution to the block-tridiagonal linear equations.A parallel iterative 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 a parallel iterative algorithm based on decomposing the coefficient matrix properly.The communication between the adjacent processors only needs three times.Theoretically,this paper gives a sufficient condition about convergence of this algorithm.Finally,some numerical results on HP rx2600 cluster demonstrate that practice computing is consistent with theory.The algorithm 's parallelism is preferable.

Key concepts: Tridiagonal matrix, Coefficient matrix, Iterative method, Algorithm, Block (permutation group theory), Convergence (economics), Computer science, Parallel algorithm

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
Parallel Iterative Algorithm for Solving Block-Tridiagonal Linear Equations — Research Paper | ScholarLens