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 559 records · Page 31

Incorporating the Min-Max Mesh Optimization Method within the Target-Matrix Paradigm

The Target-Matrix Optimization Paradigm (TMOP) is a method for improving mesh quality via node movement. Through the use of appropriate pre-defined quality metrics and Target-matrices, TMOP provides the ability to define mesh quality in terms of element shape, volume, and edge orientation as a function of position within the mesh, thus facilitating high-level goals such as size-adapted meshing. The Paradigm is developed further in this paper by showing how it can be applied to the problem of improving the mesh in locations where the quality is the worst. Improving the worst quality portions of a mesh was investigated by Freitag, Amenta, and others, who showed that the problem can be formulated as a min-max optimization problem. The Target-paradigm is used to extend the previous work in two important respects. First, by using quality metrics from the Target-paradigm, quality can be user-specified via Target-matrices instead of the quality definition being hard-wired into the quality metric. Second, by making use of the sample point concept in TMOP, one can extend min-max mesh optimization to non-simplicial element types such as quadrilaterals. Numerical experiments were performed to illustrate these extensions and to investigate their utility. A non-gradient solver known as the amoeba was used to numerically compute the optimal solutions. This derivative-free method, in conjunction with the use of barrier metrics from TMOP, enables the solution of the min-max problem without the use of explicit constraints to guarantee that the optimal mesh is non-inverted. The experiments showed that the use of Target-metrics in min-max with triangle (or tetrahedral) element meshes is able to effectively improve the worst quality elements in terms of shape or in terms of size+shape. The experiments also showed that the mesh min-max extension to quadrilateral element meshes can lead to acceptable meshes using barrier metrics from the Target-paradigm, provided that inter-element mesh smoothness is not important. Poor behavior was observed when using non-barrier Target-metrics in min-max with quadrilateral element meshes. For both simplicial and quadrilateral meshes, the min-sum method can be competitive with min-max, however.

97 MATHEMATICS AND COMPUTING↗

Cart3D Simulations for the First AIAA Sonic Boom Prediction Workshop

Simulation results for the First AIAA Sonic Boom Prediction Workshop (LBW1) are presented using an inviscid, embedded-boundary Cartesian mesh method. The method employs adjoint-based error estimation and adaptive meshing to automatically determine resolution requirements of the computational domain. Results are presented for both mandatory and optional test cases. These include an axisymmetric body of revolution, a 69deg delta wing model and a complete model of the Lockheed N+2 supersonic tri-jet with V-tail and flow through nacelles. In addition to formal mesh refinement studies and examination of the adjoint-based error estimates, mesh convergence is assessed by presenting simulation results for meshes at several resolutions which are comparable in size to the unstructured grids distributed by the workshop organizers. Data provided includes both the pressure signals required by the workshop and information on code performance in both memory and processing time. Various enhanced techniques offering improved simulation efficiency will be demonstrated and discussed.

Predictions↗

Center for Efficient Exascale Discretizations Software Suite

The CEED Software suite is a collection of generally applicable software tools focusing on the following computational motives: PDE discretizations on unstructured meshes, high-order finite element and spectral element methods and unstructured adaptive mesh refinement. All of this software is being developed as part of CEED, a co-design Center for Efficient Exascale Discretizations, within DOE's Exascale Computing Project (ECP) program.

Kolev, Tzanio↗

Stage Separation Performance Analysis Project

Stage separation process is an important phenomenon in multi-stage launch vehicle operation. The transient flowfield coupled with the multi-body systems is a challenging problem in design analysis. The thermodynamics environment with burning propellants during the upper-stage engine start in the separation processes adds to the complexity of the-entire system. Understanding the underlying flow physics and vehicle dynamics during stage separation is required in designing a multi-stage launch vehicle with good flight performance. A computational fluid dynamics model with the capability to coupling transient multi-body dynamics systems will be a useful tool for simulating the effects of transient flowfield, plume/jet heating and vehicle dynamics. A computational model using generalize mesh system will be used as the basis of this development. The multi-body dynamics system will be solved, by integrating a system of six-degree-of-freedom equations of motion with high accuracy. Multi-body mesh system and their interactions will be modeled using parallel computing algorithms. Adaptive mesh refinement method will also be employed to enhance solution accuracy in the transient process.

Chen, Yen-Sen↗

Cart3D Simulations for the Second AIAA Sonic Boom Prediction Workshop

Simulation results are presented for all test cases prescribed in the Second AIAA Sonic Boom Prediction Workshop. For each of the four nearfield test cases, we compute pressure signatures at specified distances and off-track angles, using an inviscid, embedded-boundary Cartesian-mesh flow solver with output-based mesh adaptation. The cases range in complexity from an axisymmetric body to a full low-boom aircraft configuration with a powered nacelle. For efficiency, boom carpets are decomposed into sets of independent meshes and computed in parallel. This also facilitates the use of more effective meshing strategies - each off-track angle is computed on a mesh with good azimuthal alignment, higher aspect ratio cells, and more tailored adaptation. The nearfield signatures generally exhibit good convergence with mesh refinement. We introduce a local error estimation procedure to highlight regions of the signatures most sensitive to mesh refinement. Results are also presented for the two propagation test cases, which investigate the effects of atmospheric profiles on ground noise. Propagation is handled with an augmented Burgers' equation method (NASA's sBOOM), and ground noise metrics are computed with LCASB.

Prediction↗

Development of an Unstructured Mesh Code for Flows About Complete Vehicles

This report describes the research work undertaken at the Massachusetts Institute of Technology, under NASA Research Grant NAG4-157. The aim of this research is to identify effective algorithms and methodologies for the efficient and routine solution of flow simulations about complete vehicle configurations. For over ten years we have received support from NASA to develop unstructured mesh methods for Computational Fluid Dynamics. As a result of this effort a methodology based on the use of unstructured adapted meshes of tetrahedra and finite volume flow solvers has been developed. A number of gridding algorithms, flow solvers, and adaptive strategies have been proposed. The most successful algorithms developed from the basis of the unstructured mesh system FELISA. The FELISA system has been extensively for the analysis of transonic and hypersonic flows about complete vehicle configurations. The system is highly automatic and allows for the routine aerodynamic analysis of complex configurations starting from CAD data. The code has been parallelized and utilizes efficient solution algorithms. For hypersonic flows, a version of the code which incorporates real gas effects, has been produced. The FELISA system is also a component of the STARS aeroservoelastic system developed at NASA Dryden. One of the latest developments before the start of this grant was to extend the system to include viscous effects. This required the development of viscous generators, capable of generating the anisotropic grids required to represent boundary layers, and viscous flow solvers. We show some sample hypersonic viscous computations using the developed viscous generators and solvers. Although this initial results were encouraging it became apparent that in order to develop a fully functional capability for viscous flows, several advances in solution accuracy, robustness and efficiency were required. In this grant we set out to investigate some novel methodologies that could lead to the required improvements. In particular we focused on two fronts: (1) finite element methods and (2) iterative algebraic multigrid solution techniques.

Peraire, Jaime↗

Unstructured Mesh Methods for the Simulation of Hypersonic Flows

This report describes the research work undertaken at the Massachusetts Institute of Technology. The aim of this research is to identify effective algorithms and methodologies for the efficient and routine solution of hypersonic viscous flows about re-entry vehicles. For over ten years we have received support from NASA to develop unstructured mesh methods for Computational Fluid Dynamics. As a result of this effort a methodology based on the use, of unstructured adapted meshes of tetrahedra and finite volume flow solvers has been developed. A number of gridding algorithms flow solvers, and adaptive strategies have been proposed. The most successful algorithms developed from the basis of the unstructured mesh system FELISA. The FELISA system has been extensively for the analysis of transonic and hypersonic flows about complete vehicle configurations. The system is highly automatic and allows for the routine aerodynamic analysis of complex configurations starting from CAD data. The code has been parallelized and utilizes efficient solution algorithms. For hypersonic flows, a version of the, code which incorporates real gas effects, has been produced. One of the latest developments before the start of this grant was to extend the system to include viscous effects. This required the development of viscous generators, capable of generating the anisotropic grids required to represent boundary layers, and viscous flow solvers. In figures I and 2, we show some sample hypersonic viscous computations using the developed viscous generators and solvers. Although these initial results were encouraging, it became apparent that in order to develop a fully functional capability for viscous flows, several advances in gridding, solution accuracy, robustness and efficiency were required. As part of this research we have developed: 1) automatic meshing techniques and the corresponding computer codes have been delivered to NASA and implemented into the GridEx system, 2) a finite element algorithm for the solution of the viscous compressible flow equations which can solve flows all the way down to the incompressible limit and that can use higher order (quadratic) approximations leading to highly accurate answers, and 3) and iterative algebraic multigrid solution techniques.

Peraire, Jaime↗

High-Order Mesh hr-adaptivity for Surface Fitting to Implicit Geometries

We present an ℎ𝑟-adaptivity framework for morphing a given mesh to fit a target surface prescribed as the zero isocontour of a discrete function. In this framework, high-order meshing is posed as a variational minimization problem that depends on the mesh quality prescribed via the target matrix optimization paradigm (TMOP) and position of a subset of mesh nodes with respect to the target surface. The proposed formulation ensures that the variational problem is converged and mesh quality degradation near the surface is limited, even when the mesh topology is incompatible with the target surface. Additionally, a mesh subset-based approach and ℎ-refinement is introduced to efficiently increase fitting accuracy while reducing the computational cost of the mesh morphing problem. The ℎ𝑟-adaptivity technique extends to different element types in two- and three-dimensions, and can be used in existing finite element and spectral element frameworks to obtain high-order body-fitted meshes. Various numerical experiments demonstrate the robustness and accuracy of the fitting approach for problems of practical interest such as Lagrangian hydrodynamics and topology optimization.

97 MATHEMATICS AND COMPUTING↗

An adaptively-refined Cartesian mesh solver for the Euler equations

A method for adaptive refinement of a Cartesian mesh for the solution of the steady Euler equations is presented. The algorithm creates an initial uniform mesh and cuts the body out of that mesh. The mesh is then refined based on body curvature. Next, the solution is converged to a steady state using a linear reconstruction and Roe's approximate Riemann solver. Solution-adaptive refinement of the mesh is then applied to resolve high-gradient regions of the flow. The numerical results presented show the flexibility of this approach and the accuracy attainable by solution-based refinement.

De Zeeuw, Darren↗

Minimising the error in eigenvalue calculations involving the Boltzmann transport equation using goal-based adaptivity on unstructured meshes

This article presents a method for goal-based anisotropic adaptive methods for the finite element method applied to the Boltzmann transport equation. The neutron multiplication factor, k{sub eff}, is used as the goal of the adaptive procedure. The anisotropic adaptive algorithm requires error measures for k{sub eff} with directional dependence. General error estimators are derived for any given functional of the flux and applied to k{sub eff} to acquire the driving force for the adaptive procedure. The error estimators require the solution of an appropriately formed dual equation. Forward and dual error indicators are calculated by weighting the Hessian of each solution with the dual and forward residual respectively. The Hessian is used as an approximation of the interpolation error in the solution which gives rise to the directional dependence. The two indicators are combined to form a single error metric that is used to adapt the finite element mesh. The residual is approximated using a novel technique arising from the sub-grid scale finite element discretisation. Two adaptive routes are demonstrated: (i) a single mesh is used to solve all energy groups, and (ii) a different mesh is used to solve each energy group. The second method aims to capture the benefit from representing the flux from each energy group on a specifically optimised mesh. The k{sub eff} goal-based adaptive method was applied to three examples which illustrate the superior accuracy in criticality problems that can be obtained.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Automatically adaptive stabilized finite elements and continuation analysis for compaction banding in geomaterials

Under compressive creep, viscoplastic solids experiencing internal mass transfer processes can accommodate singular cnoidal wave solutions as material instabilities at the stationary wave limit. These instabilities appear when the loading rate is significantly faster than the material's capacity to diffusive internal perturbations, leading to localized failure features (e.g., cracks and compaction bands). These cnoidal waves, generally found in fluids, have strong nonlinearities that produce periodic patterns. Due to the singular nature of the solutions, the applicability of the theory is currently limited. Additionally, practical simulation tools require proper regularization to overcome the challenges that singularity induces. We focus on the numerical treatment of the governing equation using a nonlinear approach building on a recent adaptive stabilized finite element method. This automatic refinement method provides an error estimate that drives mesh adaptivity, a crucial feature for the problem at hand. We compare the performance of this adaptive strategy against analytical and standard finite element solutions. We then investigate the sensitivity of the diffusivity ratio, the parameter controlling the process, and identify multiple possible solutions with several stress peaks. We also show the evolution of the spacing between peaks for all solutions as a function of that parameter.

42 ENGINEERING↗

Characterizing GPU Energy Usage in Exascale-Ready Portable Science Applications

We characterize the GPU energy usage of two widely adopted exascale-ready applications representing two classes of particle and mesh solvers: (i) QMCPACK, a quantum Monte Carlo package, and (ii) AMReX-Castro, an adaptive mesh astrophysical code. We analyze power, temperature, utilization, and energy traces from double-/single (mixed)-precision benchmarks on NVIDIA’s A100 and H100 and AMD’s MI250X GPUs using queries in NVML and rocm_smi_lib, respectively. We explore application-specific metrics to provide insights on energy vs. performance trade-offs. Our results suggest that mixed-precision energy savings range between 6–25% on QMCPACK and 45% on AMReX-Castro. Also, we found gaps in the AMD tooling used on Frontier GPUs that need to be understood, while query resolutions on NVML have little variability between 1 ms-1 s. Overall, application level knowledge is crucial to define energy-cost/science-benefit opportunities for the codesign of future supercomputer architectures in the post-Moore era.

Godoy, William [ORNL] (ORCID:0000000225905178)↗

Angular-spatial hp -adaptivity for radiative transfer with discontinuous Galerkin spectral element methods

Radiative transfer is important for many science and engineering applications, and numerical simulations of radiative transfer can be challenging. For instance, the radiation field is seven-dimensional – three spatial, two angular, one wavelength, and one temporal – and often features steep gradients. Therefore, memory usage is a key issue. To reduce memory, some past work has investigated the use of adaptive mesh refinement (AMR), typically for either the spatial or angular coordinate, and typically for only h -adaptivity. Here, we propose the use of AMR for the spatial and angular coordinates together, and the use of h - and p -adaptivity together as hp -AMR for the potential for further memory savings. We implemented the proposed method for several test cases in two spatial and one angular dimension, with the discontinuous Galerkin spectral element method. These test cases featured highly anisotropic angular radiation, with or without steep spatial gradients. Our primary findings from these test cases were: (1) Angular hp -adaptivity can deliver the radiation solution with the same accuracy as, and with much less computational memory than, uniform angular h - or p -refinements, or angular h -adaptivity alone. This is most obvious when the incoming radiation is highly anisotropic, in which case the savings can be orders of magnitude. (2) Full spatial-angular hp -adaptivity is more efficient in solution representation, compared to solely spatial or solely angular -adaptivity. This is most evident when steep gradients are present in both the spatial and angular distribution. These results suggest that adaptive spatial- hp angular-refinement may perform well in large-scale seven-dimensional applications.

Adaptive refinement↗

Modifiable Array Data Structures for Mesh Topology

Topological data structures are useful in many areas, including the various mesh data structures used in finite element and finite volume applications. Here, we present a mesh data structure which is both flexible enough to support general mesh adaptivity and is compactly stored in a few large arrays. This structure can efficiently store full topological information for meshes with mixed element types. It allows both constant-time adjacency queries and constant-time addition and removal of mesh entities. We compare this structure to similar structures for finite elements and graphics and present its performance for adjacency queries. We also present its use in adaptive simulation applications.

97 MATHEMATICS AND COMPUTING↗

Adaptive finite element analysis of hypersonic laminar flows for aerothermal load predictions

The use of an adaptive mesh refinement procedure for analyzing hypersonic laminar flows with application to aerothermal load predictions is described. The adaptation procedure, which uses both quadrilateral and triangular elements, is implemented with the multistep Galerkin-Runge-Kutta scheme. Elements that lie in regions of strong gradients are refined based on indicators to obtain better definition of flow features. The effectiveness of the adaptive procedure is demonstrated by modeling Mach 11.7 flow over a 15-deg ramp. Numerical results are compared with predictions of strong interaction theories and experimental data. Surface quantities such as heating rates and pressure loads, critical for the effective design of high-speed vehicles, are found to be in good agreement with experimental values.

Ramakrishnan, R.↗

Controlling Reflections from Mesh Refinement Interfaces in Numerical Relativity

A leading approach to improving the accuracy on numerical relativity simulations of black hole systems is through fixed or adaptive mesh refinement techniques. We describe a generic numerical error which manifests as slowly converging, artificial reflections from refinement boundaries in a broad class of mesh-refinement implementations, potentially limiting the effectiveness of mesh- refinement techniques for some numerical relativity applications. We elucidate this numerical effect by presenting a model problem which exhibits the phenomenon, but which is simple enough that its numerical error can be understood analytically. Our analysis shows that the effect is caused by variations in finite differencing error generated across low and high resolution regions, and that its slow convergence is caused by the presence of dramatic speed differences among propagation modes typical of 3+1 relativity. Lastly, we resolve the problem, presenting a class of finite-differencing stencil modifications which eliminate this pathology in both our model problem and in numerical relativity examples.

Baker, John G.↗

WE-D-9A-01: A Novel Mesh-Based Deformable Surface-Contour Registration

Purpose: Initial guess is vital for 3D-2D deformable image registration (DIR) while dealing with large deformations for adaptive radiation therapy. A fast procedure has been developed to deform body surface to match 2D body contour on projections. This surface-contour DIR will provide an initial deformation for further complete 3D DIR or image reconstruction. Methods: Both planning CT images and come-beam CT (CBCT) projections are preprocessed to create 0–1 binary mask. Then the body surface and CBCT projection body contours are extracted by Canny edge detector. A finite element modeling system was developed to automatically generate adaptive meshes based on the image surface. After that, the projections of the CT surface voxels are computed and compared with corresponding 2D projection contours from CBCT scans. As a result, the displacement vector field (DVF) on mesh vertices around the surface was optimized iteratively until the shortest Euclidean distance between the pixels on the projections of the deformed CT surface and the corresponding CBCT projection contour is minimized. With the help of the tetrahedral meshes, we can smoothly diffuse the deformation from the surface into the interior of the volume. Finally, the deformed CT images are obtained by the optimal DVF applied on the original planning CT images. Results: The accuracy of the surface-contour registration is evaluated by 3D normalized cross correlation increased from 0.9176 to 0.9957 (sphere-ellipsoid phantom) and from 0.7627 to 0.7919 (H and N cancer patient data). Under the GPU-based implementation, our surface-contour-guided method on H and N cancer patient data takes 8 seconds/iteration, about 7.5 times faster than direct 3D method (60 seconds/iteration), and it needs fewer optimization iterations (30 iterations vs 50 iterations). Conclusion: The proposed surface-contour DIR method can substantially improve both the accuracy and the speed of reconstructing volumetric images, which is helpful for applying in adaptive radiotherapy. This research is supported by CPRIT individual investigator award RP110329.

60 APPLIED LIFE SCIENCES↗

Surface Remeshing with Robust High-Order Reconstruction

Remeshing is an important problem in variety of applications, such as finite element methods and geometry processing. Surface remeshing poses some unique challenges, as it must deliver not only good mesh quality but also good geometric accuracy. For applications such as finite elements with high-order elements (quadratic or cubic elements), the geometry must be preserved to high-order (third-order or higher) accuracy, since low-order accuracy may undermine the convergence of numerical computations. The problem is particularly challenging if the CAD model is not available for the underlying geometry, and is even more so if the surface meshes contain some inverted elements. We describe remeshing strategies that can simultaneously produce high-quality triangular meshes, untangling mildly folded triangles and preserve the geometry to high-order of accuracy. Our approach extends our earlier works on high-order surface reconstruction and mesh optimization by enhancing its robustness with a geometric limiter for under-resolved geometries. We also integrate high-order surface reconstruction with surface mesh adaptation techniques, which alter the number of triangles and nodes. We demonstrate the utilization of our method to meshes for high-order finite elements, biomedical image-based surface meshes, and complex interface meshes in fluid simulations.

Ray, Navamita↗