Skip to main content
U.S. flag

An official website of the United States government

Official websites use .gov
A .gov website belongs to an official government organization in the United States.

Secure .gov websites use HTTPS
A lock ( ) or https:// means you’ve safely connected to the .gov website. Share sensitive information only on official, secure websites.

A Refinement-Tree Based Partioning Method for Adaptively Refined Grids

Published

Author(s)

William F. Mitchell

Abstract

The partitioning of an adaptive grid for distribution over parallel processors is considered in the context of adaptive multilevel methods for solving partial differential equations. A k-way refinement-tree based partitioning method is presented. Numerical results comparing it with recursive coordinate bisection and a multilevel diffusive method from ParMETIS show that it runs and order of magnitude faster than the multilevel diffusive method and produces partitions of similar quality.
Proceedings Title
SIAM Conference on Parallel Processing for Scientific Computing

Keywords

adaptive refinement, grid partitioning, multilevel adaptive method, parallel finite elements, refinement tree

Citation

Mitchell, W. (2001), A Refinement-Tree Based Partioning Method for Adaptively Refined Grids, SIAM Conference on Parallel Processing for Scientific Computing, -1, [online], https://tsapps.nist.gov/publication/get_pdf.cfm?pub_id=150800 (Accessed June 19, 2024)

Issues

If you have any questions about this publication or are having problems accessing it, please contact reflib@nist.gov.

Created January 1, 2001, Updated June 2, 2021