Abstract
The efficient solution of many large-scale scientific calculations depends on unstructured mesh strategies. For example, problems where the solution changes rapidly in small regions of the domain require an adaptive mesh strategy. In this paper we discuss the main algorithmic issues to be addressed with an integrated approach to solving these problems on massively parallel architectures. We review new parallel algorithms to solve two significant problems that arise in this context: the refinement mesh and the linear solver. A procedure to support parallel refinement and redistribution of two dimensional unstructured finite element meshes on distributed memory computers is presented. The parallelization of the solver is based on a parallel conjugate gradient method using domain decomposition. The error indicator and the resulting refinement parameters are computed in parallel.
Sign-in/Register to access full text options 
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
