Abstract
Finite element meshes are large, richly structured sets whose internal relationships must be visible to different parts of a finite element program. This causes software engineerings problems that increase when adaptive mesh refinement and multilevel preconditioners are applied. Even more problems arise when finite element methods have to be implemented for parallel computers since the meshes have to be mapped onto the hardware topology so that their locality is preserved. We have designed a framework for parallel adaptive finite element methods that centers upon a problem-oriented index scheme as a new high level description method for finite element meshes. Within the index scheme, important mesh relations can be expressed by simple algebraic operations in {ie105-1}. We give an overview of the indexing methodology and outline the main parts of the framework. Special emphasis is on the reuse of several C++ template libraries—including standard container classes and the library for data parallel programming of the Promoter programming model.
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.
