Abstract
Problem decomposition strategies for load balancing parallel computations on adaptive hp finite element discretizations are discussed in this work. The special difficulties that arise in partitioning these discretizations are highlighted. Three classes of algorithms—mesh traversal based on orderings, interface based decompositions and recursive bisection of orderings are discussed. A new ordering scheme for efficient recursive bisection of orderings is introduced. Details of the algorithms and examples along with discussions of their merits and demerits are presented. Recursive bisection on the new ordering introduced here outperforms several known algorithms on test cases.
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.
