An efficient parallel algorithm for the solution of block tridiagonal linear systems

An efficient parallel algorithm for the solution of block tridiagonal linear systems

0.00 Avg rating0 Votes
Article ID: iaor19961747
Country: Japan
Volume: E78-D
Issue: 3
Start Page Number: 256
End Page Number: 262
Publication Date: Mar 1995
Journal: Transactions of the Institute of Electronics, Information and Communication Engineers
Authors: ,
Keywords: differential equations, matrices
Abstract:

A parallel overlapping preconditioner is applied to ICCG method and the effect of the parallel preconditioning on the convergence of the method is investigated by solving large scale block tridiagonal linear systems arising from the discretization of Poisson’s equation. Compared with the original ICCG method, the parallel preconditioned ICCG method can solve the problems in high parallelism with slight increasing the number of iterations. Furthermore, the speedup and the efficiency are evaluated for the parallel preconditioned ICCG method by substituting the experimental results into formulae of complexity. For example, when a domain of simulation is discretized on a 250×250 rectangular grid and the preconditioner is divided into 249 smaller ones, its speedup is 146.3 with efficiency 0.59.

Reviews

Required fields are marked *. Your email address will not be published.