In this review paper, we consider some important developments and trends in
algorithm design for the solution of linear systems concentrating on aspec
ts that involve the exploitation of parallelism. We briefly discuss the sol
ution of dense linear systems, before studying the solution of sparse equat
ions by direct and iterative methods. We consider preconditioning technique
s for iterative solvers and discuss some of the present research issues in
this field. (C) 1999 Elsevier Science B.V. All rights reserved.