Cosmological Adaptive Mesh Refinement

We describe a grid-based numerical method for 3D hydrodynamic cosmological simulations which is adaptive in space and time and combines the best features of higher order--accurate Godunov schemes for Eulerian hydrodynamics with adaptive particle--mesh methods for collisionless particles. The basis for our method is the structured adaptive mesh refinement (AMR) algorithm of Berger & Collela (1989), which we have extended to cosmological hydro + N-body simulations. The resulting multiscale hybrid method is a powerful alternative to particle-based methods in current use. The choices we have made in constructing this algorithm are discussed, and its performance on the Zeldovich pancake test problem is given. We present a sample application of our method to the problem of first structure formation. We have achieved a spatial dynamic range $L_{box}/\Delta x > 250,000$ in a 3D multispecies gas + dark matter calculation, which is sufficient to resolve the formation of primordial protostellar cloud cores starting from linear matter fluctuations in an expanding FRW universe.Comment: 14 pages, 3 figures (incl. one large color PS) to appear in "Numerical Astrophysics 1998", eds. S. Miyama & K. Tomisaka, Tokyo, March 10-13, 199

Algorithms and data structures for adaptive multigrid elliptic solvers

Adaptive refinement and the complicated data structures required to support it are discussed. These data structures must be carefully tuned, especially in three dimensions where the time and storage requirements of algorithms are crucial. Another major issue is grid generation. The options available seem to be curvilinear fitted grids, constructed on iterative graphics systems, and unfitted Cartesian grids, which can be constructed automatically. On several grounds, including storage requirements, the second option seems preferrable for the well behaved scalar elliptic problems considered here. A variety of techniques for treatment of boundary conditions on such grids are reviewed. A new approach, which may overcome some of the difficulties encountered with previous approaches, is also presented

CASTRO: A New Compressible Astrophysical Solver. II. Gray Radiation Hydrodynamics

We describe the development of a flux-limited gray radiation solver for the compressible astrophysics code, CASTRO. CASTRO uses an Eulerian grid with block-structured adaptive mesh refinement based on a nested hierarchy of logically-rectangular variable-sized grids with simultaneous refinement in both space and time. The gray radiation solver is based on a mixed-frame formulation of radiation hydrodynamics. In our approach, the system is split into two parts, one part that couples the radiation and fluid in a hyperbolic subsystem, and another parabolic part that evolves radiation diffusion and source-sink terms. The hyperbolic subsystem is solved explicitly with a high-order Godunov scheme, whereas the parabolic part is solved implicitly with a first-order backward Euler method.Comment: accepted for publication in ApJS, high-resolution version available at https://ccse.lbl.gov/Publications/wqzhang/castro2.pd

CASTRO: A New Compressible Astrophysical Solver. III. Multigroup Radiation Hydrodynamics

We present a formulation for multigroup radiation hydrodynamics that is correct to order $O(v/c)$ using the comoving-frame approach and the flux-limited diffusion approximation. We describe a numerical algorithm for solving the system, implemented in the compressible astrophysics code, CASTRO. CASTRO uses an Eulerian grid with block-structured adaptive mesh refinement based on a nested hierarchy of logically-rectangular variable-sized grids with simultaneous refinement in both space and time. In our multigroup radiation solver, the system is split into three parts, one part that couples the radiation and fluid in a hyperbolic subsystem, another part that advects the radiation in frequency space, and a parabolic part that evolves radiation diffusion and source-sink terms. The hyperbolic subsystem and the frequency space advection are solved explicitly with high-order Godunov schemes, whereas the parabolic part is solved implicitly with a first-order backward Euler method. Our multigroup radiation solver works for both neutrino and photon radiation.Comment: accepted by ApJS, 27 pages, 20 figures, high-resolution version available at https://ccse.lbl.gov/Publications/wqzhang/castro3.pd

A Comparison of Two Shallow Water Models with Non-Conforming Adaptive Grids: classical tests

In an effort to study the applicability of adaptive mesh refinement (AMR) techniques to atmospheric models an interpolation-based spectral element shallow water model on a cubed-sphere grid is compared to a block-structured finite volume method in latitude-longitude geometry. Both models utilize a non-conforming adaptation approach which doubles the resolution at fine-coarse mesh interfaces. The underlying AMR libraries are quad-tree based and ensure that neighboring regions can only differ by one refinement level. The models are compared via selected test cases from a standard test suite for the shallow water equations. They include the advection of a cosine bell, a steady-state geostrophic flow, a flow over an idealized mountain and a Rossby-Haurwitz wave. Both static and dynamics adaptations are evaluated which reveal the strengths and weaknesses of the AMR techniques. Overall, the AMR simulations show that both models successfully place static and dynamic adaptations in local regions without requiring a fine grid in the global domain. The adaptive grids reliably track features of interests without visible distortions or noise at mesh interfaces. Simple threshold adaptation criteria for the geopotential height and the relative vorticity are assessed.Comment: 25 pages, 11 figures, preprin

Geometric Error of Finite Volume Schemes for Conservation Laws on Evolving Surfaces

This paper studies finite volume schemes for scalar hyperbolic conservation laws on evolving hypersurfaces of $\mathbb{R}^3$. We compare theoretical schemes assuming knowledge of all geometric quantities to (practical) schemes defined on moving polyhedra approximating the surface. For the former schemes error estimates have already been proven, but the implementation of such schemes is not feasible for complex geometries. The latter schemes, in contrast, only require (easily) computable geometric quantities and are thus more useful for actual computations. We prove that the difference between approximate solutions defined by the respective families of schemes is of the order of the mesh width. In particular, the practical scheme converges to the entropy solution with the same rate as the theoretical one. Numerical experiments show that the proven order of convergence is optimal.Comment: 23 pages, 5 figures, to appear in Numerische Mathemati

Projected finite elements for reaction-diffusion systems on stationary closed surfaces

This paper presents a robust, efficient and accurate finite element method for solving reaction-diffusion systems on stationary spheroidal surfaces (these are surfaces which are deformations of the sphere such as ellipsoids, dumbbells, and heart-shaped surfaces) with potential applications in the areas of developmental biology, cancer research, wound healing, tissue regeneration, and cell motility among many others where such models are routinely used. Our method is inspired by the radially projected finite element method introduced by Meir and Tuncer (2009), hence the name ``projected'' finite element method. The advantages of the projected finite element method are that it is easy to implement and that it provides a conforming finite element discretization which is ``logically'' rectangular. To demonstrate the robustness, applicability and generality of this numerical method, we present solutions of reaction-diffusion systems on various spheroidal surfaces. We show that the method presented in this paper preserves positivity of the solutions of reaction-diffusion equations which is not generally true for Galerkin type methods. We conclude that surface geometry plays a pivotal role in pattern formation. For a fixed set of model parameter values, different surfaces give rise to different pattern generation sequences of either spots or stripes or a combination (observed as circular spot-stripe patterns). These results clearly demonstrate the need for detailed theoretical analytical studies to elucidate how surface geometry and curvature influence pattern formation on complex surfaces

Proceedings for the ICASE Workshop on Heterogeneous Boundary Conditions

Domain Decomposition is a complex problem with many interesting aspects. The choice of decomposition can be made based on many different criteria, and the choice of interface of internal boundary conditions are numerous. The various regions under study may have different dynamical balances, indicating that different physical processes are dominating the flow in these regions. This conference was called in recognition of the need to more clearly define the nature of these complex problems. This proceedings is a collection of the presentations and the discussion groups