We study the propagation of waves across fixed mesh refinement boundaries in linear and nonlinear model equations in 1--D and 2--D, and in the 3--D Einstein equations of general relativity. We demonstrate that using linear interpolation to set the data in guard cells leads to the production of reflected waves at the refinement boundaries. Implementing quadratic interpolation to fill the guard cells suppresses these spurious signals.
We discuss Coarse Grid Projection (CGP) methodology as a guide for partial mesh refinement of incompressible flow computations for the first time. Based on it, if for a given spatial resolution the numerical simulation diverges or the velocity outputs are not accurate enough, instead of refining both the advection-diffusion and the Poisson grids, the CGP mesh refinement suggests to only refine the advection-diffusion grid and keep the Poisson grid resolution unchanged. The application of the novel mesh refinement tool is shown in the cases of flow over a backward-facing step and flow past a cy…
This article presents a hardware architecture independent implementation of an adaptive mesh refinement Poisson solver that is integrated into the electrostatic Particle-In-Cell beam dynamics code OPAL. The Poisson solver is solely based on second generation Trilinos packages to ensure the desired hardware portability. Based on the massively parallel framework AMReX, formerly known as BoxLib, the new adaptive mesh refinement interface provides several refinement policies in order to enable precise large-scale neighbouring bunch simulations in high intensity cyclotrons. The solver is validated …
We present CubismAMR, a C++ library for distributed simulations with block-structured grids and Adaptive Mesh Refinement. A numerical method to solve the incompressible Navier-Stokes equations is proposed, that comes with a novel approach of solving the pressure Poisson equation on an adaptively refined grid. Validation and verification results for the method are presented, for the flow past an impulsively started cylinder.
Fractal mesh refinement enables mesh refinement regimes to the Gibson scale and beyond. Conventional multifractal subgrid models have cost considerations which also lead to local mesh refinement, but more importantly, the application of these models to compressible turbulent deflagration fronts is a topic for future research, while subgrid models tuned to this complex physics lack a multifractal search focus, and for cost reasons do not allow the large search volumes required to find the sought for rare event to trigger a DDT. Here we propose methods to resolve fine scales and locate rare poss…
We present a high-order discontinuous Galerkin (DG) solver of the compressible Navier-Stokes equations for cloud formation processes. The scheme exploits an underlying parallelized implementation of the ADER-DG method with dynamic adaptive mesh refinement. We improve our method by a PDE-independent general refinement criterion, based on the local total variation of the numerical solution. While established methods use numerics tailored towards the specific simulation, our scheme works scenario independent. Our generic scheme shows competitive results for both classical CFD and stratified scena…
Nowadays, several models of unidimensional fluid jets exploit discrete element methods. In some cases, as for models aiming at describing the electrospinning nanofabrication process of polymer fibers, discrete element methods suffer a non constant resolution of the jet representation. We develop a dynamic mesh-refinement method for the numerical study of the electro-hydrodynamic behavior of charged jets using discrete element methods. To this purpose, we import ideas and techniques from the string method originally developed in the framework of free-energy landscape simulations. The mesh-refin…
Adaptive interface-Mesh un-Refinement (AiMuR) based Sharp-Interface Level-Set-Method (SI-LSM) is proposed for both uniform and non-uniform Cartesian-Grid. The AiMuR involves interface location based dynamic un-refinement (with merging of the four control volumes) of the Cartesian grid away from the interface. The un-refinement is proposed for the interface solver only. A detailed numerical methodology is presented for the AiMuR and ghost-fluid method based SI-LSM. Advantage of the novel as compared to the traditional SI-LSM is demonstrated with a detailed qualitative as well as quantitative pe…
The Poisson-Boltzmann equation is a widely used model to study the electrostatics in molecular solvation. Its numerical solution using a boundary integral formulation requires a mesh on the molecular surface only, yielding accurate representations of the solute, which is usually a complicated geometry. Here, we utilize adjoint-based analyses to form two goal-oriented error estimates that allows us to determine the contribution of each discretization element (panel) to the numerical error in the solvation free energy. This information is useful to identify high-error panels to then refine them …
In this paper we propose and test the validity of simple and easy-to-implement algorithms within the immersed boundary framework geared towards large scale simulations involving thousands of deformable bodies in highly turbulent flows. First, we introduce a fast moving least squares (fast-MLS) approximation technique with which we speed up the process of building transfer functions during the simulations which leads to considerable reductions in computational time. We compare the accuracy of the fast-MLS against the exact moving least squares (MLS) for the standard problem of uniform flow over…
foap4: Adaptive mesh refinement with OpenACC/OpenMP, MPI, and p4est
Centrum Wiskunde & Informatica (CWI)（荷兰数学与计算机科学中心）；Centre for mathematical Plasma Astrophysics, Department of Mathematics, KU Leuven（荷语鲁汶大学数学系数学等离子体天体物理中心）；Departamento de Matemática da Universidade de Aveiro and Centre for Research and Development in Mathematics and Applications (CIDMA)（阿威罗大学数学系及数学与应用研发中心）；Netherlands eScience Center（荷兰电子科学中心）；School of Astronomy and Space Science and Key Laboratory of Modern Astronomy and Astrophysics, Nanjing University（南京大学天文与空间科学学院现代天体物理学重点实验室）
An extension of the framework of the Finite Integration Technique (FIT) including dynamic and adaptive mesh refinement is presented. After recalling the standard formulation of the FIT, the proposed mesh adaptation procedure is described. Besides the linear interpolation approach, a novel interpolation technique based on specialized spline functions for approximating the discrete electromagnetic field solution during mesh adaptation is introduced. The standard FIT on a fixed mesh and the new adaptive approach are applied to a simulation test case with known analytical solution. The numerical a…
The dynamics of collisionless plasmas can be modelled by the Vlasov-Maxwell system of equations. An Eulerian approach is needed to accurately describe processes that are governed by high energy tails in the distribution function, but is of limited efficiency for high dimensional problems. The use of an adaptive mesh can reduce the scaling of the computational cost with the dimension of the problem. Here, we present a relativistic Eulerian Vlasov-Maxwell solver with block-structured adaptive mesh refinement in one spatial and one momentum dimension. The discretization of the Vlasov equation is …
In this paper we present a fourth-order in space and time block-structured adaptive mesh refinement algorithm for the compressible multicomponent reacting Navier-Stokes equations. The algorithm uses a finite volume approach that incorporates a fourth-order discretization of the convective terms. The time stepping algorithm is based on a multi-level spectral deferred corrections method that enables explicit treatment of advection and diffusion coupled with an implicit treatment of reactions. The temporal scheme is embedded in a block-structured adaptive mesh refinement algorithm that includes s…
Field conserving adaptive mesh refinement (AMR) scheme on massively parallel adaptive octree meshes
Iowa State University（爱荷华州立大学）；Stanford University（斯坦福大学）；University of Utah（犹他大学）；Tufts University（塔夫茨大学）；RIKEN Center for Computational Science（理化学研究所计算科学中心）
Performing a stable, long duration simulation of driven MHD turbulence with a high thermal Mach number and a strong initial magnetic field is a challenge to high-order Godunov ideal MHD schemes because of the difficulty in guaranteeing positivity of the density and pressure. We have implemented a robust combination of reconstruction schemes, Riemann solvers, limiters, and Constrained Transport EMF averaging schemes that can meet this challenge, and using this strategy, we have developed a new Adaptive Mesh Refinement (AMR) MHD module of the ORION2 code. We investigate the effects of AMR on sev…
Yen et al. (2012) advanced a direct approach for the calculation of self-gravitational force to second order accuracy based on uniform grid discretization. This method improves the accuracy of N-body calculation by using exact integration of kernel functions and employing the Fast Fourier Transform (FFT) to reduce complexity of computation to nearly linear. This direct approach is free of artificial boundary conditions, however, the applicability is limited by the uniform discretization of grids. We report here an advancement in the direct method with the implementation of adaptive mesh refine…
A description is given of the algorithms implemented in the AstroBEAR adaptive mesh refinement code for ideal magnetohydrodynamics. The code provides several high resolution, shock capturing schemes which are constructed to maintain conserved quantities of the flow in a finite volume sense. Divergence free magnetic field topologies are maintained to machine precision by collating the components of the magnetic field on a cell-interface staggered grid and utilizing the constrained transport approach for integrating the induction equations. The maintenance of magnetic field topologies on adaptiv…
A fully threaded tree (FTT) for adaptive refinement of regular meshes is described. By using a tree threaded at all levels, tree traversals for finding nearest neighbors are avoided. All operations on a tree including tree modifications are O(N), where N is a number of cells, and are performed in parallel. An efficient implementation of the tree is described that requires 2N words of memory. A filtering algorithm for removing high-frequency noise during mesh refinement is described. A FTT can be used in various numerical applications. In this paper, it is applied to the integration of the Eule…
