In this review paper, we consider some important developments and trends in algorithm design for the solution of linear systems concentrating on aspects that involve the exploitation of parallelism. We briefly discuss the solution of dense linear systems, before studying the solution of sparse equations by direct and iterative methods. We consider preconditioning techniques for iterative solvers and discuss some of the present research issues in this field.
Duff, I. S., & Van Der Vorst, H. A. (1999). Developments and trends in the parallel solution of linear systems. Parallel Computing, 25(13), 1931–1970. https://doi.org/10.1016/S0167-8191(99)00077-0