Computational & Technology Resources
an online resource for computational,
engineering & technology publications
Computational Science, Engineering & Technology Series
ISSN 1759-3158
Edited by: B.H.V. Topping
Chapter 7

Parallel algorithms for Coercive Elliptic Problems

F. Magoulès

Office National d'Études et de Recherche Aérospatiales, Chatillon, France

Full Bibliographic Reference for this chapter
F. Magoulès, "Parallel algorithms for Coercive Elliptic Problems", in B.H.V. Topping, (Editor), "Computational Mechanics using High Performance Computing", Saxe-Coburg Publications, Stirlingshire, UK, Chapter 7, pp 135-150, 2002. doi:10.4203/csets.9.7
In this chapter classical domain decomposition methods to solve a linear system of equations arising from the finite element discretization of elliptic partial differential equations are presented. The analysis of the model Laplace equation is considered in bounded domains with homogeneous Dirichlet boundary condition. The different methods are described for a continuous and a discrete approach and the main features of their numerical analyses and their distributed parallel implementation are also presented.

purchase the full-text of this chapter (price £20)

go to the previous chapter
go to the next chapter
return to the table of contents
return to the book description
purchase this book (price £90 +P&P)