Search NASA⌕ Search

SEARCH · Search NASA

Results for “Mesh Adaptivity”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 379 records · Page 21

Linearization errors in discrete goal-oriented error estimation

This paper is concerned with goal-oriented a posteriori error estimation for nonlinear functionals in the context of nonlinear variational problems solved with continuous Galerkin finite element discretizations. A two-level, or discrete, adjoint-based approach for error estimation is considered. The traditional method to derive an error estimate in this context requires linearizing both the nonlinear variational form and the nonlinear functional of interest which introduces linearization errors into the error estimate. In this paper, we investigate these linearization errors. In particular, we develop a novel discrete goal-oriented error estimate that accounts for traditionally neglected nonlinear terms at the expense of greater computational cost. We demonstrate how this error estimate can be used to drive mesh adaptivity. Here, we show that accounting for linearization errors in the error estimate can improve its effectivity for several nonlinear model problems and quantities of interest. We also demonstrate that an adaptive strategy based on the newly proposed estimate can lead to more accurate approximations of the nonlinear functional with fewer degrees of freedom when compared to uniform refinement and traditional adjoint-based approaches.

42 ENGINEERING↗

Interpolation methods and the accuracy of lattice-Boltzmann mesh refinement

A lattice-Boltzmann model to solve the equivalent of the Navier-Stokes equations on adap- tively refined grids is presented. A method for transferring information across interfaces between different grid resolutions was developed following established techniques for finite- volume representations. This new approach relies on a space-time interpolation and solving constrained least-squares problems to ensure conservation. The effectiveness of this method at maintaining the second order accuracy of lattice-Boltzmann is demonstrated through a series of benchmark simulations and detailed mesh refinement studies. These results exhibit smaller solution errors and improved convergence when compared with similar approaches relying only on spatial interpolation. Examples highlighting the mesh adaptivity of this method are also provided.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Transonic Limit Cycle Oscillations of the Benchmark Supercritical Wing

This paper considers transonic flutter mechanisms of the Benchmark Supercritical Wing, a model under study in the Aeroelastic Prediction Workshop series. Flutter boundaries are mapped out across an angle of attack sweep at Mach 0.8, utilizing both time-domain and linearized frequency-domain solvers, manual meshes and adapted meshes, and various governing equations. With increased angle of attack, linearized and finite amplitude flutter predictions exhibit differences above 3◦ as the flow begins to separate; the latter predictions are found to be driven by subcritical limit cycle oscillations whose strength increases with angle of attack. Moderate perturbation values provide a stability boundary at 5◦ which matches the experimental data, but it is not clear how the experimental perturbation, from one test condition to the next, can be reasonably characterized.

Bret Stanford↗

Introducing Enabling Computational Tools to the Climate Sciences: Multi-Resolution Climate Modeling with Adaptive Cubed-Sphere Grids

The research investigates and advances strategies how to bridge the scale discrepancies between local, regional and global phenomena in climate models without the prohibitive computational costs of global cloud-resolving simulations. In particular, the research explores new frontiers in computational geoscience by introducing high-order Adaptive Mesh Refinement (AMR) techniques into climate research. AMR and statically-adapted variable-resolution approaches represent an emerging trend for atmospheric models and are likely to become the new norm in future-generation weather and climate models. The research advances the understanding of multi-scale interactions in the climate system and showcases a pathway how to model these interactions effectively with advanced computational tools, like the Chombo AMR library developed at the Lawrence Berkeley National Laboratory. The research is interdisciplinary and combines applied mathematics, scientific computing and the atmospheric sciences. In this research project, a hierarchy of high-order atmospheric models on cubed-sphere computational grids have been developed that serve as an algorithmic prototype for the finite-volume solution-adaptive Chombo-AMR approach. The foci of the investigations have lied on the characteristics of both static mesh adaptations and dynamically-adaptive grids that can capture flow fields of interest like tropical cyclones. Six research themes have been chosen. These are (1) the introduction of adaptive mesh refinement techniques into the climate sciences, (2) advanced algorithms for nonhydrostatic atmospheric dynamical cores, (3) an assessment of the interplay between resolved-scale dynamical motions and subgrid-scale physical parameterizations, (4) evaluation techniques for atmospheric model hierarchies, (5) the comparison of AMR refinement strategies and (6) tropical cyclone studies with a focus on multi-scale interactions and variable-resolution modeling. The results of this research project demonstrate significant advances in all six research areas. The major conclusions are that statically-adaptive variable-resolution modeling is currently becoming mature in the climate sciences, and that AMR holds outstanding promise for future-generation weather and climate models on high-performance computing architectures.

58 GEOSCIENCES↗

Automatic off-body overset adaptive Cartesian mesh method based on an octree approach

This paper describes a method for generating adaptive structured Cartesian grids within a near-body/off-body mesh partitioning framework for the flow simulation around complex geometries. The off-body Cartesian mesh generation derives from an octree structure, assuming each octree leaf node defines a structured Cartesian block. This enables one to take into account the large scale discrepancies in terms of resolution between the different bodies involved in the simulation, with minimum memory requirements. Two different conversions from the octree to Cartesian grids are proposed: the first one generates Adaptive Mesh Refinement (AMR) type grid systems, and the second one generates abutting or minimally overlapping Cartesian grid set. We also introduce an algorithm to control the number of points at each adaptation, that automatically determines relevant values of the refinement indicator driving the grid refinement and coarsening. An application to a wing tip vortex computation assesses the capability of the method to capture accurately the flow features.

97 MATHEMATICS AND COMPUTING↗

Adaptive unstructured mesh methods for steady viscous flow

The solution of the equations governing steady laminar viscous flows on unstructured triangular meshes is addressed. The shortcomings of the standard adaptivity approaches for this class of problems are highlighted and a modified method based upon the combined use of mesh enrichment, mesh movement, and adaptive remeshing, is proposed. The behavior of the proposed scheme is demonstrated by applying it in the solution of compression corner flows.

Hassan, O.↗

An adaptive embedded mesh procedure for leading-edge vortex flows

A procedure for solving the conical Euler equations on an adaptively refined mesh is presented, along with a method for determining which cells to refine. The solution procedure is a central-difference cell-vertex scheme. The adaptation procedure is made up of a parameter on which the refinement decision is based, and a method for choosing a threshold value of the parameter. The refinement parameter is a measure of mesh-convergence, constructed by comparison of locally coarse- and fine-grid solutions. The threshold for the refinement parameter is based on the curvature of the curve relating the number of cells flagged for refinement to the value of the refinement threshold. Results for three test cases are presented. The test problem is that of a delta wing at angle of attack in a supersonic free-stream. The resulting vortices and shocks are captured efficiently by the adaptive code.

Powell, Kenneth G.↗

Finite element methods for high speed flows

An explicit finite element based solution procedure for solving the equations of compressible viscous high speed flow is presented. The method uses domain splitting to advance the solution with different timesteps on different portions of the mesh. For steady inviscid flows, adaptive mesh refinement procedures are successfully employed to enhance the definition of discontinuities. Preliminary ideas on the application of adaptive mesh refinement to the solution of problems involving steady viscous flow are presented. Sample timings are given for the performance of the finite element code on modern supercomputers.

Loehner, R.↗

Multilevel Error Estimation and Adaptive h-Refinement for Cartesian Meshes with Embedded Boundaries

This paper presents the development of a mesh adaptation module for a multilevel Cartesian solver. While the module allows mesh refinement to be driven by a variety of different refinement parameters, a central feature in its design is the incorporation of a multilevel error estimator based upon direct estimates of the local truncation error using tau-extrapolation. This error indicator exploits the fact that in regions of uniform Cartesian mesh, the spatial operator is exactly the same on the fine and coarse grids, and local truncation error estimates can be constructed by evaluating the residual on the coarse grid of the restricted solution from the fine grid. A new strategy for adaptive h-refinement is also developed to prevent errors in smooth regions of the flow from being masked by shocks and other discontinuous features. For certain classes of error histograms, this strategy is optimal for achieving equidistribution of the refinement parameters on hierarchical meshes, and therefore ensures grid converged solutions will be achieved for appropriately chosen refinement parameters. The robustness and accuracy of the adaptation module is demonstrated using both simple model problems and complex three dimensional examples using meshes with from 10(exp 6), to 10(exp 7) cells.

Aftosmis, M. J.↗

In-memory integration of existing software components for parallel adaptive unstructured mesh workflows

Unstructured mesh methods, like finite elements and finite volumes, support the effective analysis of complex physical behaviors modeled by partial differential equations over general threedimensional domains. The most reliable and efficient methods apply adaptive procedures with a-posteriori error estimators that indicate where and how the mesh is to be modified. Although adaptive meshes can have two to three orders of magnitude fewer elements than a more uniform mesh for the same level of accuracy, there are many complex simulations where the meshes required are so large that they can only be solved on massively parallel systems.

97 MATHEMATICS AND COMPUTING↗

Laser Intertial Fusion Energy: Neutronic Design Aspects of a Hybrid Fusion-Fission Nuclear Energy System

This study investigates the neutronics design aspects of a hybrid fusion-fission energy system called the Laser Fusion-Fission Hybrid (LFFH). A LFFH combines current Laser Inertial Confinement fusion technology with that of advanced fission reactor technology to produce a system that eliminates many of the negative aspects of pure fusion or pure fission systems. When examining the LFFH energy mission, a significant portion of the United States and world energy production could be supplied by LFFH plants. The LFFH engine described utilizes a central fusion chamber surrounded by multiple layers of multiplying and moderating media. These layers, or blankets, include coolant plenums, a beryllium (Be) multiplier layer, a fertile fission blanket and a graphite-pebble reflector. Each layer is separated by perforated oxide dispersion strengthened (ODS) ferritic steel walls. The central fusion chamber is surrounded by an ODS ferritic steel first wall. The first wall is coated with 250-500 μm of tungsten to mitigate x-ray damage. The first wall is cooled by Li 17 Pb 83 eutectic, chosen for its neutron multiplication and good heat transfer properties. The Li 17 Pb 83 flows in a jacket around the first wall to an extraction plenum. The main coolant injection plenum is immediately behind the Li 17 Pb 83 , separated from the Li 17 Pb 83 by a solid ODS wall. This main system coolant is the molten salt flibe (2LiF-BeF 2 ), chosen for beneficial neutronics and heat transfer properties. The use of flibe enables both fusion fuel production (tritium) and neutron moderation and multiplication for the fission blanket. A Be pebble (1 cm diameter) multiplier layer surrounds the coolant injection plenum and the coolant flows radially through perforated walls across the bed. Outside the Be layer, a fission fuel layer comprised of depleted uranium contained in Tristructural-isotropic (TRISO) fuel particles having a packing fraction of 20% in 2 cm diameter fuel pebbles. The fission blanket is cooled by the same radial flibe flow that travels through perforated ODS walls to the reflector blanket. This reflector blanket is 75 cm thick comprised of 2 cm diameter graphite pebbles cooled by flibe. The flibe extraction plenum surrounds the reflector bed. Detailed neutronics designs studies are performed to arrive at the described design. The LFFH engine thermal power is controlled using a technique of adjusting the 6 Li/ 7 Li enrichment in the primary and secondary coolants. The enrichment adjusts system thermal power in the design by increasing tritium production while reducing fission. To perform the simulations and design of the LFFH engine, a new software program named LFFH Nuclear Control (LNC) was developed in C++ to extend the functionality of existing neutron transport and depletion software programs. Neutron transport calculations are performed with MCNP5. Depletion calculations are performed using Monteburns 2.0, which utilizes ORIGEN 2.0 and MCNP5 to perform a burnup calculation. LNC supports many design parameters and is capable of performing a full 3D system simulation from initial startup to full burnup. It is able to iteratively search for coolant 6Li enrichments and resulting material compositions that meet user defined performance criteria. LNC is utilized throughout this study for time dependent simulation of the LFFH engine. Two additional methods were developed to improve the computation efficiency of LNC calculations. These methods, termed adaptive time stepping and adaptive mesh refinement were incorporated into a separate stand alone C++ library name the Adaptive Burnup Library (ABL). The ABL allows for other client codes to call and utilize its functionality. Adaptive time stepping is useful for automatically maximizing the size of the depletion time step while maintaining a desired level of accuracy. Adaptive meshing allows for analysis of fixed fuel configurations that would normally require a computationally burdensome number of depletion zones. Alternatively, Adaptive Mesh Refinement (AMR) adjusts the depletion zone size according to the variation in flux across the zone or fractional contribution to total absorption or fission. A parametric analysis on a fully mixed fuel core was performed using the LNC and ABL code suites. The resulting system parameters are found to optimize performance metrics using a 20 MT DU fuel load with a 20% TRISO packing and a 300 μm kernel radius operated with a fusion input power of 500 MW and a fission blanket gain of 4.0. LFFH potentially offers a proliferation resistant technology relative to other nuclear energy systems primarily because of no need for fuel enrichment or reprocessing. A figure of merit of the material attractiveness is examined and it is found that the fuel is effectively contaminated to an unattractive level shortly after the system is started due to fission product and minor actinide build up.

42 ENGINEERING↗

Exploring Discretization Error in Simulation-Based Aerodynamic Databases

This work examines the level of discretization error in simulation-based aerodynamic databases and introduces strategies for error control. Simulations are performed using a parallel, multi-level Euler solver on embedded-boundary Cartesian meshes. Discretization errors in user-selected outputs are estimated using the method of adjoint-weighted residuals and we use adaptive mesh refinement to reduce these errors to specified tolerances. Using this framework, we examine the behavior of discretization error throughout a token database computed for a NACA 0012 airfoil consisting of 120 cases. We compare the cost and accuracy of two approaches for aerodynamic database generation. In the first approach, mesh adaptation is used to compute all cases in the database to a prescribed level of accuracy. The second approach conducts all simulations using the same computational mesh without adaptation. We quantitatively assess the error landscape and computational costs in both databases. This investigation highlights sensitivities of the database under a variety of conditions. The presence of transonic shocks or the stiffness in the governing equations near the incompressible limit are shown to dramatically increase discretization error requiring additional mesh resolution to control. Results show that such pathologies lead to error levels that vary by over factor of 40 when using a fixed mesh throughout the database. Alternatively, controlling this sensitivity through mesh adaptation leads to mesh sizes which span two orders of magnitude. We propose strategies to minimize simulation cost in sensitive regions and discuss the role of error-estimation in database quality.

Aftosmis, Michael J.↗

Implicit and coupled fluid plasma solver with adaptive Cartesian mesh and its applications to non-equilibrium gas discharges

In this work, we present a new fluid plasma solver with adaptive Cartesian mesh (ACM) based on a full-Newton (nonlinear, implicit) scheme for non-equilibrium gas discharge plasma. The electrons and ions are described using drift-diffusion approximation coupled to Poisson equation for the electric field. The electron-energy transport equation is solved to account for electron thermal conductivity, Joule heating, and energy loss of electrons in collisions with neutral species. The rate of electron-induced ionization is a function of electron temperature and could also depend on electron density (important for plasma stratification). The ion and gas temperature are kept constant. The transport equations are discretized using a non-isothermal Scharfetter-Gummel scheme to resolve possible large temperature gradients in the sheaths. We demonstrate the new solver for simulations of direct current (DC) and radiofrequency (RF) discharges. The implicit treatment of the coupled equations allows using large time steps. The full-Newton method (FNM) enables fast nonlinear convergence at each time step, offering significantly improved simulation efficiency. We discuss the selection of time steps for solving different plasma problems. The new solver enables solving several problems we could not solve before with existing software: two- and three-dimensional structures of the entire DC discharges including cathode and anode regions, electric field reversals and double-layer formation, the normal cathode spot and an anode ring, moving striations in diffuse and constricted DC discharges, and standing striations in RF discharges. The developed FNM-ACM technique offers many benefits for tackling the disparity of gas discharge plasma systems' time scales and nonlinearity.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

A Moving Embedded Boundary Approach for the Compressible Navier-Stokes Equations in a Block-Structured Adaptive Refinement Framework

A computational technique has been developed to perform compressible flow simulations involving moving boundaries using an embedded boundary approach within the block-structured adaptive mesh refinement (SAMR) framework of AMReX [1], [91], [92]. We leverage the SAMR capability to obtain quantitatively accurate results whilst using robust, second-order finite volume schemes. A conservative, unsplit, cut-cell approach is utilized and a ghost-cell approach is developed for computing the flux on the moving, embedded boundary faces. A third-order least-squares formulation has been developed to compute the wall velocity gradients, and was found to significantly improve the performance of the solver in terms of the quantitative comparison of surface quantities such as the skin friction coefficient. Various test cases are performed to validate the method, and compared with analytical, experimental, and other numerical results in literature. Inviscid and viscous test cases are performed that span a wide regime of flow speeds - acoustic (harmonically pulsating sphere), smooth flows (expansion fan created by a receding piston) and flows with shocks (shock-cylinder interaction, shock-wedge interaction, pitching NACA 0012 airfoil and shock-cone interaction). A closed system with moving boundaries - an oscillating piston in a cylinder, showed that the percentage error in mass within the system decreases with refinement, demonstrating that the numerical scheme is conservative with grid refinement, but is not discretely conservative. Viscous test cases involve that of a horizontally moving cylinder at Re = 40, an inline oscillating cylinder at Re = 100, and a transversely oscillating cylinder at Re = 185. The judicious use of adaptive mesh refinement with appropriate refinement criteria to capture the regions of interest leads to well-resolved flow features, and good quantitative comparison is observed with the results available in literature.

adaptive refinement↗

Application of unstructured grid methods to steady and unsteady aerodynamic problems

The purpose is to describe the development of unstructured grid methods which have several advantages when compared to methods which make use of structured grids. Unstructured grids, for example, easily allow the treatment of complex geometries, allow for general mesh movement for realistic motions and structural deformations of complete aircraft configurations which is important for aeroelastic analysis, and enable adaptive mesh refinement to more accurately resolve the physics of the flow. Steady Euler calculations for a supersonic fighter configuration to demonstrate the complex geometry capability; unsteady Euler calculations for the supersonic fighter undergoing harmonic oscillations in a complete-vehicle bending mode to demonstrate the general mesh movement capability; and vortex-dominated conical-flow calculations for highly-swept delta wings to demonstrate the adaptive mesh refinement capability are discussed. The basic solution algorithm is a multi-stage Runge-Kutta time-stepping scheme with a finite-volume spatial discretization based on an unstructured grid of triangles in 2D or tetrahedra in 3D. The moving mesh capability is a general procedure which models each edge of each triangle (2D) or tetrahedra (3D) with a spring. The resulting static equilibrium equations which result from a summation of forces are then used to move the mesh to allow it to continuously conform to the instantaneous position or shape of the aircraft. The adaptive mesh refinement procedure enriches the unstructured mesh locally to more accurately resolve the vortical flow features. These capabilities are described in detail along with representative results which demonstrate several advantages of unstructured grid methods. The applicability of the unstructured grid methodology to steady and unsteady aerodynamic problems and directions for future work are discussed.

Batina, John T.↗

Solution adaptivity using a triangular mesh

Solution adaptivity is discussed first from a general perspective and then from the specific viewpoint of triangular meshes. The use of a general connectivity triangular mesh is emphasized. The development of monitor surfaces and their geometric properties is discussed. Mesh point movement is addressed, as is the dynamic restructuring of the connectivity pattern among moving modes. Changes in the number of mesh nodes to obtain suitable refinement for a physical simulation is examined, and the use of locally regular structures to offset the data structure limitation of a general connectivity triangular mesh and thus to obtain an enhanced range of application is considered. To illustrate the basic features of the adaptive triangular mesh strategy, an application to the study of plasma equilibrium is briefly considered.

Eiseman, P. R.↗

Parallel Implementation of an Adaptive Scheme for 3D Unstructured Grids on the SP2

Dynamic mesh adaption on unstructured grids is a powerful tool for computing unsteady flows that require local grid modifications to efficiently resolve solution features. For this work, we consider an edge-based adaption scheme that has shown good single-processor performance on the C90. We report on our experience parallelizing this code for the SP2. Results show a 47.OX speedup on 64 processors when 10% of the mesh is randomly refined. Performance deteriorates to 7.7X when the same number of edges are refined in a highly-localized region. This is because almost all mesh adaption is confined to a single processor. However, this problem can be remedied by repartitioning the mesh immediately after targeting edges for refinement but before the actual adaption takes place. With this change, the speedup improves dramatically to 43.6X.

Oliker, Leonid↗

Omega_h

Omega_h is a C++11 library that implements tetrahedron and triangle mesh adaptativity, with a focus on scalable HPC performance using (optionally) MPI, OpenMP, or CUDA. It is intended to provided adaptive functionality to existing simulation codes. Mesh adaptivity allows one to minimize both discretization error and number of degrees of freedom live during the simulation, as well as enabling moving object and evolving geometry simulations. Omega_h will do this for you in a way that is fast, memory-efficient, and portable across many different architectures, including NVIDIA GPUs.

Ibanez, Daniel [Sandia National Laboratories] (000↗