NOTICE: Due to a lapse in annual appropriations, most of this website is not being updated. Learn more.
Form submissions will still be accepted but will not receive responses at this time. Sections of this site for programs using non-appropriated funds (such as NVLAP) or those that are excepted from the shutdown (such as CHIPS and NVD) will continue to be updated.
An official website of the United States government
Here’s how you know
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
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 October 14, 2025)