HIERARCHICAL TREE-STRUCTURES AS ADAPTIVE MESHES

David J. Edelsohn
Additional contact information
David J. Edelsohn: Syracuse Center for Computational Science, Syracuse University Syracuse, NY 13244, USA;

International Journal of Modern Physics C (IJMPC), 1993, vol. 04, issue 05, 909-917

Abstract: New adaptive mesh refinement algorithms provide an opportunity to utilize the same hierarchical tree-structures developed for multipole-based particle simulations in grid-based simulations of both continuum and particle problems. Representing both a multipole method simulation and an adaptive mesh simulation with this same structure provides a natural formalism with which to unite these two classes of solvers. This paper discusses how both methods exploit the same basic principle of locality evident in many systems, such as those governed by Poisson's Equation, and introduces issues and potential problems to be addressed in an implementation. The locality of the systems and the resulting algorithms provide important benefits for implementations on massively parallel computers.

Date: 1993
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.worldscientific.com/doi/abs/10.1142/S0129183193000707
Access to full text is restricted to subscribers

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:wsi:ijmpcx:v:04:y:1993:i:05:n:s0129183193000707

Ordering information: This journal article can be ordered from

DOI: 10.1142/S0129183193000707

Access Statistics for this article

International Journal of Modern Physics C (IJMPC) is currently edited by H. J. Herrmann

More articles in International Journal of Modern Physics C (IJMPC) from World Scientific Publishing Co. Pte. Ltd.
Bibliographic data for series maintained by Tai Tone Lim ().