Abstract
The problem of partitioning unstructured meshes for parallel computing is considered. Four existing algorithms as well as a new hybrid algorithm are tested. The numerical results favour the recursive spectral bisection algorithm and the hybrid algorithm. A generalisation of the recursive spectral bisection algorithm to deal with an arbitrary number of processors is discussed.
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.
