Computational & Technology Resources
an online resource for computational,
engineering & technology publications
Civil-Comp Proceedings
ISSN 1759-3433
CCP: 107
PROCEEDINGS OF THE FOURTH INTERNATIONAL CONFERENCE ON PARALLEL, DISTRIBUTED, GRID AND CLOUD COMPUTING FOR ENGINEERING
Edited by: P. Iványi and B.H.V. Topping
Paper 14

Scalable Parallel Multigrid Preconditioning for High Fidelity Finite Element and Finite Difference Simulations

P.K. Jimack1, M.A. Walkley1 and J. Zhang2

1School of Computing, University of Leeds, United Kingdom
2Department of Engineering Mechanics, Hohai University, Nanjing, China

Full Bibliographic Reference for this paper
P.K. Jimack, M.A. Walkley, J. Zhang, "Scalable Parallel Multigrid Preconditioning for High Fidelity Finite Element and Finite Difference Simulations", in P. Iványi, B.H.V. Topping, (Editors), "Proceedings of the Fourth International Conference on Parallel, Distributed, Grid and Cloud Computing for Engineering", Civil-Comp Press, Stirlingshire, UK, Paper 14, 2015. doi:10.4203/ccp.107.14
Keywords: multigrid, weak scalability, preconditioning, finite elements, finite differences, elliptic problems.

Summary
A major challenge in undertaking high resolution numerical simulations for engineering problems comes from the growth in the computational work that occurs as the underlying finite difference or the finite element meshes are refined in order to improve accuracy. For most solution algorithms this growth in work is super-linear with the number of degrees of freedom. In such cases it is impossible for a parallel implementation with p processors to solve a problem with p x N degrees of freedom in the same time as it can solve the problem with N degrees of freedom on a single processor (so-called weak scalability). Because multigrid algorithms have the property that they may solve a discrete problem in O(N) operations they provide a natural approach for seeking weakly scalable parallel solvers. Unfortunately, developing a highly efficient parallel implementation is a challenging task, that can prevent perfect weak scalability. In this paper we explain why this is so, and suggest ways in which these difficulties may be overcome. In particular we demonstrate that, if multigrid is used as a preconditioner for a different iterative scheme (based upon Krylov subspace methods for example), the coarse grid part of the multigrid problem does not need to be solved exactly (unlike for pure multigrid) in order to obtain an O(N) algorithm. Since this is the part of multigrid that is most challenging to implement in parallel we are able to show the effectiveness of this approach for both finite difference and finite element discretizations of selected applications in both two and three dimensions.

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

go to the previous paper
go to the next paper
return to the table of contents
return to the book description