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 541 records · Page 30

A low-communication, parallel algorithm for solving PDEs based on range decomposition

This work proposes a new, low-communication algorithm for solving PDEs on massively parallel computers. The range decomposition (RD) algorithm exposes coarse-grain parallelism by applying nested iteration and adaptive mesh refinement locally before performing a global communication step. Just a few such steps are observed to be sufficient to obtain accuracy within a small multiple of discretization error. The target applications are petascale and exascale machines, where hierarchical parallelism is required and traditional parallel numerical PDE communication patterns are costly because of message latency. The RD algorithm uses a partition of unity to equally distribute the error, and thus, the work. The computational advantages of this approach are that the decomposed problems can be solved in parallel without any communication until the partitioned solutions are summed. This offers potential advantages in the paradigm of expensive communication but very cheap computation. This paper introduces the method and explains the details of the communication step. Two performance models are developed, showing that the latency cost associated with a traditional parallel implementation of nested iteration is proportional to log(P) 2 , whereas the RD method reduces the communication latency to log(P), while maintaining similar bandwidth costs. Numerical results for two problems, Laplace and advection diffusion, demonstrate the enhanced performance, and a heuristic argument explains why the method converges quickly.

97 MATHEMATICS AND COMPUTING↗

The development of a high-resolution Eulerian radiation-hydrodynamics simulation capability for laser-driven Hohlraums

Hohlraums are hollow cylindrical cavities with high-Z material walls used to convert laser energy into uniform x-ray radiation drives for inertial confinement fusion capsule implosions and high energy density physics experiments. Credible computational modeling of hohlraums requires detailed modeling and coupling of laser physics, hydrodynamics, radiation transport, heat transport, and atomic physics. We report on improvements to Los Alamos National Laboratory's xRAGE radiation-hydrodynamics code in order to enable hohlraum modeling. xRAGE's Eulerian hydrodynamics and adaptive mesh refinement make it uniquely well suited to study the impacts of multiscale features in hohlraums. In order to provide confidence in this new modeling capability, we demonstrate xRAGE's ability to produce reasonable agreement with data from several benchmark hohlraum experiments. We also use xRAGE to perform integrated simulations of a recent layered high density carbon capsule implosion on the National Ignition Facility in order to evaluate the potential impacts of the capsule support tent, mixed cell conductivity methodologies, plasma transport, and cross-beam energy transfer (XBT). We find that XBT, seeded by plasma flows in the laser entrance hole (LEH), causes a slight decrease in energy coupling to the capsule and that all of these impact the symmetry of the x-ray drive such that they have an appreciable impact on the capsule implosion shape.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Detonation structure in the presence of mixture stratification using reaction-resolved simulations

Many investigations of detonation-based combustors have identified reactant mixture inhomogeneity as having a leading-order impact on wave dynamics and combustion efficiency. To examine this phenomenon in a simplified context, an array of two- and three-dimensional channel detonation simulations are conducted in the present work. The reactant mixture consists of stratified fuel and air, wherein the randomly distributed equivalence ratio field features a characteristic stratification length scale. Detailed chemical kinetics are implemented in an adaptive mesh refinement solution framework where the region near the shock front is resolved with Ο (100) cells per representative ZND induction length. The results show that in comparison to baseline cases with uniform reactant mixtures, reactant stratification has a marked impact on the detonation structure. Increasing the stratification length scale increases the size and irregularity of the detonation cells, yielding larger variations in wave speed. Triple point collisions in fuel-rich regions lead to local wave speeds above the notional mean CJ speed, but wave passage through inert regions causes the local wave speed and strength to diminish. Further, conditional statistics show that increasing the stratification length scale increases the variance in pressure and temperature in the primary reaction zone, as well as the variance in heat release over a range of mixture conditions. In addition to the reactant mixture, the impact of the boundary condition behind the detonation is also investigated. The results show that an inflow boundary condition acts to over-drive the wave, leading to higher peak pressures, smaller detonation cells, and increased reactant consumption. On the other hand, cases with a wall behind the wave exhibit weaker waves with lower peak pressures and heat release rates, as well as greater variance in conditional quantities. Comparisons between complementary two- and three-dimensional simulations show reasonable qualitative agreement in wave structure, speed, and conditional statistics.

42 ENGINEERING↗

Adaptive clipping‐and‐redistribution algorithms for bounded and conservative high‐order interpolations applied to discontinuous and reactive flows

Abstract A new adaptive clipping‐and‐redistribution method is presented which provides bounds‐preservation for multidimensional interpolation in the context of high‐order finite‐volume discretizations with adaptive mesh refinement (AMR). The underlying finite‐volume method (FVM) for the computational fluid dynamics applications is fourth‐order accurate for smooth solutions and utilizes AMR for computational efficiency in solving multiscale problems involving turbulence and combustion. High‐order interpolation between different AMR levels is required. However, this operation often leads to numerical issues because combustion species must have physical bounds preserved. The present study overcomes two major challenges in the development of the high‐order interpolation method. First, the method needs to be bound‐preserving near extrema or discontinuities to prevent the emergence of unphysical oscillations while maintaining fourth‐order accuracy in smooth flows. Second, the method needs to satisfy the conservation requirement in multiple dimensions, particularly in the context of curvilinear coordinate transformations. Additionally, the method is designed to be localized and computationally inexpensive. The new interpolation scheme is demonstrated by solving reacting flows, which are extremely sensitive to unphysical overshoots in conserved quantities. The test problems are shock‐induced ‐ combustion and a ‐air flame in a practical bluff‐body combustor. Results show the method prevents new extrema near discontinuities while maintaining high‐order accuracy in smooth regions. In particular, the method is extremely beneficial for combustion with stiff chemistry. With the proposed new method, even if flame fronts cross AMR interfaces or new grids are created in the vicinity of the flame, solution stability is retained.

97 MATHEMATICS AND COMPUTING↗

Chemical timescale effects on detonation convergence

Numerical simulations of detonation-containing flows have emerged as crucial tools for designing next- generation power and propulsion devices. As these tools mature, it is important for the combustion community to properly understand and isolate grid resolution effects when simulating detonations. To this end, the objective of this work is to provide a comprehensive analysis of the numerical convergence of unsteady detonation simulations, with focus on isolating the impacts of chemical timescale modifications on convergence characteristics in the context of operator splitting. With the aid of an AMReX-based adaptive mesh refinement flow solver-which enables resolutions up to ($\mathcal{O}$ (1000) cells-per-induction length-the convergence analysis is conducted using two kinetics configurations: (1) the simplified three-step Arrhenius-based model mechanism of Short and Quirk (1997), where chemical timescales in the detonation are modified by adjusting activation energies in the initiation and branching reactions, and (2) a detailed hydrogen- air mechanism, where the chemical timescales are adjusted by varying the ambient pressure. The convergence of unsteady self-sustained detonations in one-dimensional channels is then analyzed with reference to steady-state theoretical baseline solutions using these mechanisms. The goal of the analysis is to provide a detailed comparison of the effects of grid resolution on both macroscopic (peak pressures and wave speeds) and microscopic (wave structure) quantities of interest, drawing connections between the deviations from steady-state baselines and minimum chemical timescales. In particular, chemical timescale reductions were found to have minimal impact on the convergence of macroscopic properties. Furthermore, analyses of microscopic convergence trends, particularly in the reaction front location, revealed a key insight: maintaining the induction time while eliminating prohibitive chemical timescales through mechanism simplifications and combustion modeling can significantly enhance detonation convergence properties. Ultimately, this work uncovers resolution-dependent unsteady detonation convergence regimes and highlights the important role played by not only the chemical timescales, but also the ratio between the chemical timescale and induction time on the numerical convergence of the detonation wave structure.

Adaptive mesh refinement↗

Large eddy simulation of a turbulent non-reacting spray jet

We performed Large Eddy Simulation (LES) of a turbulent non-reacting n-Heptane spray jet, referred to as Spray H in the Engine Combustion Network (ECN), and executed a data analysis focused on key LES metrics such as fraction of resolved turbulent kinetic energy and similarity index. In the simulation, we used the dynamic structure model for the sub-grid stress, and the Lagrangian-based spray-parcel models coupled with the blob-injection model. The finest mesh-cell size used was characterized by an Adaptive Mesh Refinement (AMR) cell size of 0.0625 mm. To obtain ensemble statistics, we performed 28 numerical realizations of the simulation. Demonstrated by the comparison with experimental data in a previous study [7], this LES has accurately predicted global quantities, such as liquid and vapor penetrations. The analysis in this work shows that 14 realizations of LES are sufficient to provide a reasonable representation of the average flow behavior that is benchmarked against the 28-realization ensemble. With the current mesh, numerical schemes, and sub-grid scale turbulence model, more than 95% of the turbulent kinetic energy is directly resolved in the flow regions of interest. The large-scale flow structures inferred from a statistical analysis reveal a region of disorganized flow around the peripheral region of the spray jet, which appears to be linked to the entrainment process.

Hu, Bing↗

T RI M E ++: Multi-threaded triangular meshing in two dimensions

We present T RI M E ++, a multi-threaded software library designed for generating two-dimensional meshes for intricate geometric shapes using the Delaunay triangulation. Multi-threaded parallel computing is implemented throughout the meshing procedure, making it suitable for fast generation of large-scale meshes. Three iterative meshing algorithms are implemented: the DistMesh algorithm, the centroidal Voronoi diagram meshing, and a hybrid of the two. We compare the performance of the three meshing methods in T RI M E ++, and show that the hybrid method retains the advantages of the other two. The software library achieves significant parallel speedup when generating large-scale meshes containing between 10 4 to 10 7 points. T RI M E ++ can handle complicated geometries and generates adaptive meshes of high quality.

97 MATHEMATICS AND COMPUTING↗

HODIF: High-Order Discretizations, Interpolations and Filters for AMR

This software, a library, contains FORTRAN77 subroutines to calculate first and second derivatives up to 8th order, interpolations (1D and 2D) up to 10th order and filters up to 14th order. Only even orders are addressed and finite-difference stencils are implemented on a vertex-centered mesh. The primary aim of this library is to be used in block-structured adaptive mesh simulations where high order is desired. The interpolants in this library are essentially designed to do prolongations and restrictions between levels of rfinement - however, they assume that the refinement ratio is 2. The filters are provided to remove high wavenumber content from solutions in case Runge phenomenon occurs - a common occurrence in case of marginal resolution of the solution. Details of the derivation and use are to be found in "Using high-order methods on adaptively refined block-structured meshes - discretizations, interpolations and filters", by J. Ray, C.A. Kennedy, S. Lefantzi and H.N. Najm, Sandia Technical Report, SAND2005-7981. The software comes with a User's Guide and examples how to use it.

Kennedy, ChristopherA.↗

A hybrid adaptive multiresolution approach for the efficient simulation of reactive flows

Computational studies that use block-structured adaptive mesh refinement (AMR) approaches suffer from unnecessarily high mesh resolution in regions adjacent to important solution features. This deficiency limits the performance of AMR codes. In this work a novel hybrid adaptive multiresolution (HAMR) approach to AMR-based calculations is introduced to address this issue. The multiresolution (MR) smoothness indicators are used to identify regions of smoothness on the mesh where the computational cost of individual physics solvers may be decreased by replacing direct calculations with interpolation. We suggest an approach to balance the errors due to the adaptive discretization and the interpolation of physics quantities such that the overall accuracy of the HAMR solution is consistent with that of the MR-driven AMR solution. The performance of the HAMR scheme is evaluated for a range of test problems, from pure hydrodynamics to turbulent combustion.

97 MATHEMATICS AND COMPUTING↗

Computations of Aerodynamic Performance Databases Using Output-Based Refinement

Objectives: Handle complex geometry problems; Control discretization errors via solution-adaptive mesh refinement; Focus on aerodynamic databases of parametric and optimization studies: 1. Accuracy: satisfy prescribed error bounds 2. Robustness and speed: may require over 105 mesh generations 3. Automation: avoid user supervision Obtain "expert meshes" independent of user skill; and Run every case adaptively in production settings.

Nemec, Marian↗

AZEuS: AN ADAPTIVE ZONE EULERIAN SCHEME FOR COMPUTATIONAL MAGNETOHYDRODYNAMICS

A new adaptive mesh refinement (AMR) version of the ZEUS-3D astrophysical magnetohydrodynamical fluid code, AZEuS, is described. The AMR module in AZEuS has been completely adapted to the staggered mesh that characterizes the ZEUS family of codes on which scalar quantities are zone-centered and vector components are face-centered. In addition, for applications using static grids, it is necessary to use higher-order interpolations for prolongation to minimize the errors caused by waves crossing from a grid of one resolution to another. Finally, solutions to test problems in one, two, and three dimensions in both Cartesian and spherical coordinates are presented.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Transient thermal-structural analysis using adaptive unstructured remeshing and mesh movement

An adaptive unstructured remeshing technique is applied to transient thermal-structural analysis. The effectiveness of the technique, together with the finite element method and an error estimation technique, is evaluated by two applications which have exact solutions: (1) the steady-state thermal analysis of a plate subjected to a highly localized surface heating, and (2) the transient thermal-structural analysis of a simulated convectively cooled leading edge subjected to a translating heat source. These applications demonstrate that the remeshing technique significantly reduces the problem size as well as the analysis solution error as compared to the results produced using standard structured meshes.

Dechaumphai, Pramote↗

AN ADAPTIVE PARTICLE-MESH GRAVITY SOLVER FOR ENZO

We describe and implement an adaptive particle-mesh algorithm to solve the Poisson equation for grid-based hydrodynamics codes with nested grids. The algorithm is implemented and extensively tested within the astrophysical code Enzo against the multigrid solver available by default. We find that while both algorithms show similar accuracy for smooth mass distributions, the adaptive particle-mesh algorithm is more accurate for the case of point masses, and is generally less noisy. We also demonstrate that the two-body problem can be solved accurately in a configuration with nested grids. In addition, we discuss the effect of subcycling, and demonstrate that evolving all the levels with the same timestep yields even greater precision.

79 ASTRONOMY AND ASTROPHYSICS↗

Accelerate microstructure evolution simulation using graph neural networks with adaptive spatiotemporal resolution

Abstract Surrogate models driven by sizeable datasets and scientific machine-learning methods have emerged as an attractive microstructure simulation tool with the potential to deliver predictive microstructure evolution dynamics with huge savings in computational costs. Taking 2D and 3D grain growth simulations as an example, we present a completely overhauled computational framework based on graph neural networks with not only excellent agreement to both the ground truth phase-field methods and theoretical predictions, but enhanced accuracy and efficiency compared to previous works based on convolutional neural networks. These improvements can be attributed to the graph representation, both improved predictive power and a more flexible data structure amenable to adaptive mesh refinement. As the simulated microstructures coarsen, our method can adaptively adopt remeshed grids and larger timesteps to achieve further speedup. The data-to-model pipeline with training procedures together with the source codes are provided.

36 MATERIALS SCIENCE↗

Unstructured CFD and Noise Prediction Methods for Propulsion Airframe Aeroacoustics

Using unstructured mesh CFD methods for Propulsion Airframe Aeroacoustics (PAA) analysis has the distinct advantage of precise and fast computational mesh generation for complex propulsion and airframe integration arrangements that include engine inlet, exhaust nozzles, pylon, wing, flaps, and flap deployment mechanical parts. However, accurate solution values of shear layer velocity, temperature and turbulence are extremely important for evaluating the usually small noise differentials of potential applications to commercial transport aircraft propulsion integration. This paper describes a set of calibration computations for an isolated separate flow bypass ratio five engine nozzle model and the same nozzle system with a pylon. These configurations have measured data along with prior CFD solutions and noise predictions using a proven structured mesh method, which can be used for comparison to the unstructured mesh solutions obtained in this investigation. This numerical investigation utilized the TetrUSS system that includes a Navier-Stokes solver, the associated unstructured mesh generation tools, post-processing utilities, plus some recently added enhancements to the system. New features necessary for this study include the addition of two equation turbulence models to the USM3D code, an h-refinement utility to enhance mesh density in the shear mixing region, and a flow adaptive mesh redistribution method. In addition, a computational procedure was developed to optimize both solution accuracy and mesh economy. Noise predictions were completed using an unstructured mesh version of the JeT3D code.

Pao, S. Paul↗

Robust Metric-Aligned Quad-Dominant Meshing Using L(sub p) Centroidal Voronoi Tessellation

We introduce a meshing algorithm that can be used to both generate and adapt meshes for bounded domains in an anisotropic manner. This is particularly beneficial when anisotropic flow features like shock waves or contact discontinuities are present in the computational domain. The algorithm presented in this paper is based upon meshing under the imposed Riemannian metric tensor, which controls the orientation and size of the mesh elements. In this way there is no need for user intervention to recognize these features. We demonstrate that the method indeed aligns the elements with the underlying metric and produces right-angled simplices that can be recombined into quadrilateral elements. The aim is to eventually incorporate this meshing strategy in the monolithic high-order spectral element solver that is currently being developed at NASA Ames. This paper has two main contributions: First, we demonstrate that we can generate quad-dominant metric-aligned meshes for bounded domains using a generalized form of L(sub p)-Centroidal Voronoi Tessellation (L(sub p)-CVT). Unlike previous works, we do not rely on a background mesh and discretize the bounded domain in a hierarchical way by first discretizing the boundaries and then the volume using the underlying metric. Second, we present an alternative for clipping the Voronoi cells on the boundary, which is common practice in CVT-based meshing algorithms, by reconstructing the Voronoi cells using the defined metric field. In this way we avoid the geometrical complexity of the clipping procedure and we show that we evaluate the energy and its gradient correctly. We show that the reconstruction of the computational domain is consistent with the Lloyds’ algorithm that is used to compute the L(sub p)-CVT.

Centroidal↗

A projection method for particle resampling

Particle discretizations of partial differential equations are advantageous for high-dimensional kinetic models in phase-space due to their better scalability than continuum approaches with respect to dimension. Complex processes collectively referred to as particle noise hamper long time simulations with particle methods. One approach to address this problem is particle mesh adaptivity, or remapping, known as particle resampling and remeshing. Here, this work introduces a resampling method that projects particles to and from a (finite element) function space. The method is simple, using standard sparse linear algebra and finite element techniques, and it preserves all moments up to the order of a polynomial represented exactly by the continuum function space. It is distinguished from most other mesh-based methods in that new particle positions and number are decoupled from the mesh, allowing particle and continuum meshes to be adapted relatively independently. While this work is developed with structured particle and continuum phase-space grids on 1X + 1V Vlasov-Poisson models of Landau damping and two-stream instability, the method is well-suited to unstructured grids. Stable long time dynamics are demonstrated up to time T = 500. Reproducibility artifacts and data are publicly available.

Kinetic methods↗

A Domain-Decomposed Multi-Level Method for Adaptively Refined Cartesian Grids with Embedded Boundaries

The work presents a new method for on-the-fly domain decomposition technique for mapping grids and solution algorithms to parallel machines, and is applicable to both shared-memory and message-passing architectures. It will be demonstrated on the Cray T3E, HP Exemplar, and SGI Origin 2000. Computing time has been secured on all these platforms. The decomposition technique is an outgrowth of techniques used in computational physics for simulations of N-body problems and the event horizons of black holes, and has not been previously used by the CFD community. Since the technique offers on-the-fly partitioning, it offers a substantial increase in flexibility for computing in heterogeneous environments, where the number of available processors may not be known at the time of job submission. In addition, since it is dynamic it permits the job to be repartitioned without global communication in cases where additional processors become available after the simulation has begun, or in cases where dynamic mesh adaptation changes the mesh size during the course of a simulation. The platform for this partitioning strategy is a completely new Cartesian Euler solver tarcreted at parallel machines which may be used in conjunction with Ames' "Cart3D" arbitrary geometry simulation package.

Aftosmis, M. J.↗