Abstract
The currently available most efficient solver for large elliptic problems is the multigrid method, especially the geometric multigrid method which requires detailed information of the geometry for its discretization. In our particular case, we consider a parallel geometric multigrid solver for a structured triangulation of a hexagonal domain for an elliptic partial differential equation. Special care has been taken in optimizing also the parallel performance by making use of the available geometric information. The scaling properties of the multigrid solver on a massively parallel computer (IFERC-CSC) are investigated. In addition, the performance results are compared with the results of solvers from publicly available libraries and our own implementation of the domain decomposition method.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
