The focus of this thesis is to look at ways to solve triangular systems on parallel architectures. I will be looking at the case of blocked bidiagonal systems that occurs in the peconditioning step of the linear system that arises from the five-point discretization of Laplace's second order differential equation. The basic idea is to find a parallel algorithm to solve such problems. See later for details of the machine architecture. Chapter gives a brief background on linear systems, iterative schemes, accelerating and preconditioning, the model problem and where it arises and finally the effect of reordering on the linear system.
Chapter looks at triangular solvers including cyclic reduction.
Chapter focuses on some of the issues related to sparse matrices such as storage schemes and some of the basic operations that are very essential in almost every iterative scheme. Finally, chapter will be a sum up of all issues and a conclusion to the work that has been done.