Mitchell, W.
(1998),
The Refinement-Tree Partition for Parallel Solution of Partial Differential Equations, Journal of Research (NIST JRES), National Institute of Standards and Technology, Gaithersburg, MD, [online], https://tsapps.nist.gov/publication/get_pdf.cfm?pub_id=150743
(Accessed March 14, 2025)
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.
The Refinement-Tree Partition for Parallel Solution of Partial Differential Equations
Published
Author(s)
Abstract
Dynamic load balancing is considered in the context of adaptive multilevel methods for partial differential equations on distributed memory multiprocessors. An approach that periodically repartitions the grid is taken. The important properties of a partitioning algorighm are presented and discussed in this context. A partitioning algorithm based on the refinement tree of the adaptive grid is presented and analyzed in terms of these properties. Theoretical and numerical results are given.Citation
Journal of Research (NIST JRES) -
Volume
103 No. 4
NIST Pub Series
Pub Type
NIST Pubs
Download Paper
Keywords
partial differential equations, partitioning algorithm, refinement tree partitions
Citation
Issues
If you have any questions about this publication or are having problems accessing it, please contact reflib@nist.gov.
Created July 1, 1998, Updated June 2, 2021