an:01698910
Zbl 1002.65042
Saad, Y.
Parallel iterative methods for sparse linear systems
EN
Butnariu, Dan (ed.) et al., Inherently parallel algorithms in feasibility and optimization and their applications. Research workshop, Haifa, Israel, March 13-16, 2000. Amsterdam: North-Holland/ Elsevier. Stud. Comput. Math. 8, 423-440 (2001).
2001
a
65F10 65F35 76T99 65F50 65Y05 65N55
preconditioners; parallel algorithms; large sparse linear systems; domain decomposition; Schwarz procedures; Schur complement techniques; simulation of solid-liquid flows
Summary: This paper presents an overview of parallel algorithms and their implementations for solving large sparse linear systems which arise in scientific and engineering applications. Preconditioners constitute the most important ingredient in solving such systems. As will be seen, the most common preconditioners used for sparse linear systems adapt domain decomposition concepts to the more general framework of ``distributed sparse linear systems''. Variants of Schwarz procedures and Schur complement techniques are discussed. We also report on our own experience in the parallel implementation of a fairly complex simulation of solid-liquid flows.
For the entire collection see [Zbl 0971.00058].