ForestClaw

A parallel, adaptive library for logically Cartesian, mapped, multiblock domains


What is ForestClaw?

ForestClaw is a parallel, multi-block adaptive finite volume library for solving PDEs on mapped, logically Cartesian meshes. For solving hyperbolic problems using explicit, single step algorithms, ForestClaw's block-structured adaptive algorithm, including multi-rate time stepping uses the Berger, Oliger and Collela AMR algorithms (1984, 1989). The hyperbolic solvers are currently based on ClawPack (R. J. LeVeque). Future plans include support for general method-of-lines solvers in a multi-rate setting.

Where ForestClaw departs from the standard Berger-Oliger-Colella block-structured approach is that the multi-resolution grid hierarchy is not stored as overlapping, nested grids but rather as a composite structure of non-overlapping fixed sized grids, each of which is stored as a leaf in a forest of quad- or octrees. The particular code base we use for managing the tree is p4est (www.p4est.org), (Carsten Burstedde, Univ. of Bonn).

Why develop another AMR code?

Currently, there are several AMR codes for doing block-structured AMR. What are the advantages of the ForestClaw approach?

Progress on the ForestClaw project

Publications and Presentations

Recent talks

Publications

ForestClaw News

Where can I get ForestClaw?

We are close to releasing our first beta version (Nov. 2014). Please check back for status updates.

Developers

Carsten Burstedde (University of Bonn, Germany), and Donna Calhoun (Boise State University, USA)

Acknowledgments

Donna Calhoun would like to acknowledge the support of the Isaac Newton Institute and the program Adaptive Multiscale Numerics for the Ocean and Atmosphere, where much of the initial work in developing ForestClaw was done.


Gallery




Last modified: Fri Nov 21 06:59:42 MST 2014