3,210 research outputs found

    Afivo: a framework for quadtree/octree AMR with shared-memory parallelization and geometric multigrid methods

    Get PDF
    Afivo is a framework for simulations with adaptive mesh refinement (AMR) on quadtree (2D) and octree (3D) grids. The framework comes with a geometric multigrid solver, shared-memory (OpenMP) parallelism and it supports output in Silo and VTK file formats. Afivo can be used to efficiently simulate AMR problems with up to about 10810^{8} unknowns on desktops, workstations or single compute nodes. For larger problems, existing distributed-memory frameworks are better suited. The framework has no built-in functionality for specific physics applications, so users have to implement their own numerical methods. The included multigrid solver can be used to efficiently solve elliptic partial differential equations such as Poisson's equation. Afivo's design was kept simple, which in combination with the shared-memory parallelism facilitates modification and experimentation with AMR algorithms. The framework was already used to perform 3D simulations of streamer discharges, which required tens of millions of cells

    An adaptive Cartesian embedded boundary approach for fluid simulations of two- and three-dimensional low temperature plasma filaments in complex geometries

    Get PDF
    We review a scalable two- and three-dimensional computer code for low-temperature plasma simulations in multi-material complex geometries. Our approach is based on embedded boundary (EB) finite volume discretizations of the minimal fluid-plasma model on adaptive Cartesian grids, extended to also account for charging of insulating surfaces. We discuss the spatial and temporal discretization methods, and show that the resulting overall method is second order convergent, monotone, and conservative (for smooth solutions). Weak scalability with parallel efficiencies over 70\% are demonstrated up to 8192 cores and more than one billion cells. We then demonstrate the use of adaptive mesh refinement in multiple two- and three-dimensional simulation examples at modest cores counts. The examples include two-dimensional simulations of surface streamers along insulators with surface roughness; fully three-dimensional simulations of filaments in experimentally realizable pin-plane geometries, and three-dimensional simulations of positive plasma discharges in multi-material complex geometries. The largest computational example uses up to 800800 million mesh cells with billions of unknowns on 40964096 computing cores. Our use of computer-aided design (CAD) and constructive solid geometry (CSG) combined with capabilities for parallel computing offers possibilities for performing three-dimensional transient plasma-fluid simulations, also in multi-material complex geometries at moderate pressures and comparatively large scale.Comment: 40 pages, 21 figure

    A fully-coupled discontinuous Galerkin method for two-phase flow in porous media with discontinuous capillary pressure

    Full text link
    In this paper we formulate and test numerically a fully-coupled discontinuous Galerkin (DG) method for incompressible two-phase flow with discontinuous capillary pressure. The spatial discretization uses the symmetric interior penalty DG formulation with weighted averages and is based on a wetting-phase potential / capillary potential formulation of the two-phase flow system. After discretizing in time with diagonally implicit Runge-Kutta schemes the resulting systems of nonlinear algebraic equations are solved with Newton's method and the arising systems of linear equations are solved efficiently and in parallel with an algebraic multigrid method. The new scheme is investigated for various test problems from the literature and is also compared to a cell-centered finite volume scheme in terms of accuracy and time to solution. We find that the method is accurate, robust and efficient. In particular no post-processing of the DG velocity field is necessary in contrast to results reported by several authors for decoupled schemes. Moreover, the solver scales well in parallel and three-dimensional problems with up to nearly 100 million degrees of freedom per time step have been computed on 1000 processors

    Adaptive multiresolution computations applied to detonations

    Full text link
    A space-time adaptive method is presented for the reactive Euler equations describing chemically reacting gas flow where a two species model is used for the chemistry. The governing equations are discretized with a finite volume method and dynamic space adaptivity is introduced using multiresolution analysis. A time splitting method of Strang is applied to be able to consider stiff problems while keeping the method explicit. For time adaptivity an improved Runge--Kutta--Fehlberg scheme is used. Applications deal with detonation problems in one and two space dimensions. A comparison of the adaptive scheme with reference computations on a regular grid allow to assess the accuracy and the computational efficiency, in terms of CPU time and memory requirements.Comment: Zeitschrift f\"ur Physicalische Chemie, accepte

    Kinetic Solvers with Adaptive Mesh in Phase Space

    Full text link
    An Adaptive Mesh in Phase Space (AMPS) methodology has been developed for solving multi-dimensional kinetic equations by the discrete velocity method. A Cartesian mesh for both configuration (r) and velocity (v) spaces is produced using a tree of trees data structure. The mesh in r-space is automatically generated around embedded boundaries and dynamically adapted to local solution properties. The mesh in v-space is created on-the-fly for each cell in r-space. Mappings between neighboring v-space trees implemented for the advection operator in configuration space. We have developed new algorithms for solving the full Boltzmann and linear Boltzmann equations with AMPS. Several recent innovations were used to calculate the discrete Boltzmann collision integral with dynamically adaptive mesh in velocity space: importance sampling, multi-point projection method, and the variance reduction method. We have developed an efficient algorithm for calculating the linear Boltzmann collision integral for elastic and inelastic collisions in a Lorentz gas. New AMPS technique has been demonstrated for simulations of hypersonic rarefied gas flows, ion and electron kinetics in weakly ionized plasma, radiation and light particle transport through thin films, and electron streaming in semiconductors. We have shown that AMPS allows minimizing the number of cells in phase space to reduce computational cost and memory usage for solving challenging kinetic problems

    Geometry considerations for high-order finite-volume methods on structured grids with adaptive mesh refinement

    Get PDF
    2022 Summer.Includes bibliographical references.Computational fluid dynamics (CFD) is an invaluable tool for engineering design. Meshing complex geometries with accuracy and efficiency is vital to a CFD simulation. In particular, using structured grids with adaptive mesh refinement (AMR) will be invaluable to engineering optimization where automation is critical. For high-order (fourth-order and above) finite volume methods (FVMs), discrete representation of complex geometries adds extra challenges. High-order methods are not trivially extended to complex geometries of engineering interest. To accommodate geometric complexity with structured AMR in the context of high-order FVMs, this work aims to develop three new methods. First, a robust method is developed for bounding high-order interpolations between grid levels when using AMR. High-order interpolation is prone to numerical oscillations which can result in unphysical solutions. To overcome this, localized interpolation bounds are enforced while maintaining solution conservation. This method provides great flexibility in how refinement may be used in engineering applications. Second, a mapped multi-block technique is developed, capable of representing moderately complex geometries with structured grids. This method works with high-order FVMs while still enabling AMR and retaining strict solution conservation. This method interfaces with well-established engineering work flows for grid generation and interpolates generalized curvilinear coordinate transformations for each block. Solutions between blocks are then communicated by a generalized interpolation strategy while maintaining a single-valued flux. Finally, an embedded-boundary technique is developed for high-order FVMs. This method is particularly attractive since it automates mesh generation of any complex geometry. However, the algorithms on the resulting meshes require extra attention to achieve both stable and accurate results near boundaries. This is achieved by performing solution reconstructions using a weighted form of high-order interpolation that accounts for boundary geometry. These methods are verified, validated, and tested by complex configurations such as reacting flows in a bluff-body combustor and Stokes flows with complicated geometries. Results demonstrate the new algorithms are effective for solving complex geometries at high-order accuracy with AMR. This study contributes to advance the geometric capability in CFD for efficient and effective engineering applications
    • …
    corecore