Search NASA⌕ Search

SEARCH · Search NASA

Results for “mesh optimization”

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 19 records
All sourcesNASA NTRSDOE OSTI
DOE OSTI2022

Accelerating high-order mesh optimization using finite element partial assembly on GPUs

In this paper we present a new GPU-oriented mesh optimization method based on high order finite elements. Our approach relies on node movement with fixed topology, through the Target-Matrix Optimization Paradigm (TMOP) and uses a global nonlinear solve over the whole computational mesh, i.e., all mesh nodes are moved together. A key property of the method is that the mesh optimization process is recast in terms of finite element operations, which allows us to utilize recent advances in the field of GPU-accelerated high order finite element algorithms. For example, we reduce data motion by using tensor factorization and matrix-free methods, which have superior performance characteristics compared to traditional full finite element matrix assembly and offer advantages for GPU based HPC hardware. Furthermore, we describe the major mathematical components of the method along with their efficient GPU-oriented implementation. In addition, we propose an easily reproducible mesh optimization test that can serve as a performance benchmark for the mesh optimization community.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Dyn$\mathrm{AMO}$: Multi-agent reinforcement learning for dynamic anticipatory mesh optimization with applications to hyperbolic conservation laws

Here we introduce DynAMO, a reinforcement learning paradigm for Dynamic Anticipatory Mesh Optimization. Adaptive mesh refinement is an effective tool for optimizing computational cost and solution accuracy in numerical methods for partial differential equations. However, traditional adaptive mesh refinement approaches for time-dependent problems typically rely only on instantaneous error indicators to guide adaptivity. As a result, standard strategies often require frequent remeshing to maintain accuracy. In the DynAMO approach, multi-agent reinforcement learning is used to discover new local refinement policies that can anticipate and respond to future solution states by producing meshes that deliver more accurate solutions for longer time intervals. By applying DynAMO to discontinuous Galerkin methods for the linear advection and compressible Euler equations in two dimensions, we demonstrate that this new mesh refinement paradigm can outperform conventional threshold-based strategies while also generalizing to different mesh sizes, remeshing and simulation times, and initial conditions.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Metric Type in the Target-matrix Mesh Optimization Paradigm

The Target Matrix Optimization Paradigm (TMOP) is a method for improving the accuracy, efficiency, and robustness of numerical solutions to partial differential equations by improving the geometric quality of the computational mesh, primarily through node movement. TMOP has been successfully applied to a number applications even though the paradigm was not fully understood at the time. With this work, TMOP can be seen to be a tightly woven fabric of interconnecting ideas and concepts that provides a powerful approach to mesh optimization. The central unifying concepts in TMOP are the concept of a Target Matrix and the concept of Metric Type. Target matrices are motivated by the desire to make mesh quality improvement application-specific and, when needed, solution-adaptive. Metric type plays an essential role because it provides, through the use of typed metrics, the bridge between application-specific quality and target construction. It is shown that there are eight theoretical metric types, including the shape and shape+size types used informally in the past. It is shown further that there exist well-posed metrics corresponding to six of the eight metric types. A well-posed metric is a metric that is typed and convex, polyconvex, or invex, and further, it is a metric that simplifies target construction.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2026

PDE-constrained high-order mesh optimization

Here, we present a novel framework for PDE-constrained r-adaptivity of high-order meshes. The proposed method formulates mesh movement as an optimization problem, with an objective function defined as a convex combination of a mesh quality metric and a measure of the accuracy of the PDE solution obtained via finite element discretization. The proposed formulation achieves optimized, well-defined high-order meshes by integrating mesh quality control, PDE solution accuracy, and robust gradient regularization. We adopt the Target-Matrix Optimization Paradigm to control geometric properties across the mesh, independent of the PDE of interest. To incorporate the accuracy of the PDE solution, we introduce error measures that control the finite element discretization error. The implicit dependence of these error measures on the mesh nodal positions is accurately captured by adjoint sensitivity analysis. Additionally, a convolution-based gradient regularization strategy is used to ensure stable and effective adaptation of high-order meshes. We demonstrate that the proposed framework can improve mesh quality and reduce the error by up to 10 times for the solution of Poisson and linear elasto-static problems. The approach is general with respect to the dimensionality, the order of the mesh, the types of mesh elements, and can be applied to any PDE that admits well-defined adjoint operators.

Computer science↗
DOE OSTI2020

Simulation-driven optimization of high-order meshes in ALE hydrodynamics

Here we propose tools for high-order mesh optimization and demonstrate their benefits in the context of multi-material Arbitrary Lagrangian-Eulerian (ALE) compressible shock hydrodynamic applications. The mesh optimization process is driven by information provided by the simulation which uses the optimized mesh, such as shock positions, material regions, known error estimates, etc. These simulation features are usually represented discretely, for instance, as finite element functions on the Lagrangian mesh. The discrete nature of the input is critical for the practical applicability of the algorithms we propose and distinguishes this work from approaches that strictly require analytical information. Our methods are based on node movement through a high-order extension of the Target-Matrix Optimization Paradigm (TMOP). The proposed formulation is fully algebraic and relies only on local Jacobian matrices, so it is applicable to all types of mesh elements, in 2D and 3D, and any order of the mesh. We discuss the notions of constructing adaptive target matrices and obtaining their derivatives, reconstructing discrete data in intermediate meshes, node limiting that enables improvement of global mesh quality while preserving space-dependent local mesh features, and appropriate normalization of the objective function. The adaptivity methods are combined with automatic ALE triggers that can provide robustness of the mesh evolution and avoid excessive remap procedures. The benefits of the new high-order TMOP technology are illustrated on several simulations performed in the high-order ALE application BLAST.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Local element operations for curved simplex meshes

Summary Mesh optimization procedures are generally a combination of node smoothing and discrete operations which affect a small number of elements to improve the quality of the overall mesh. These procedures are useful as a post‐processing step in mesh generation procedures and in applications such as fluid simulations with severely deforming domains. In order to perform high‐order mesh optimization, these ingredients must also be extended to high‐order (curved) meshes. In this work, we present a method to perform local element operations on curved meshes. The mesh operations discussed in this work are edge/face swaps, edge collapses, and edge splitting (more generally refinement) for triangular and tetrahedral meshes. These local operations are performed by first identifying the patch of elements which contain the edge/face being acted on, performing the operation as a “straight‐sided one" by placing the high‐order nodes via an isoparametric mapping from the master element, and smoothing the high‐order nodes on the elements in the patch by minimizing a Jacobian‐based high‐order mesh distortion measure. Since the initial “straight‐sided guess” from the placement of the nodes via the isoparametric mapping frequently results in invalid elements, the distortion measure must be regularized which allows for mesh untangling for the optimization to succeed. We present several examples in 2D and 3D to demonstrate these local operations and how they can be combined with a high‐order node smoothing procedure to maintain mesh quality when faced with severe deformations.

Shi, A.↗
DOE OSTI2025

Multi-material ALE remap with interface sharpening using high-order matrix-free finite element methods

The arbitrary Lagrangian-Eulerian (ALE) technique involves remapping field quantities from a Lagrangian mesh to an optimized mesh in a conservative, accurate and bounds-preserving manner. For methods based on arbitrary order finite elements, as described in a reference, material volume fractions are advected in pseudo-time using flux-corrected transport (FCT) without any form of interface reconstruction. In practice, this can lead to excessive propagation of small volume fractions throughout the domain. In addition, this method requires assembly of a global advection matrix to compute the bounds-preserving low-order FCT solution. In this work, we introduce a new approach for ALE remap using a high-order matrix-free technique which incorporates a flux modification to sharpen material interfaces in a conservative manner. Our approach begins with computing a bounds-preserving low-order solution to the ALE remap equations at the element level. We then compute a sharp interface solution (not guaranteed to be bounds-preserving) which comes from solving an augmented version of the ALE remap equations with a conservative flux modification which acts to sharpen material volume fractions based on their gradients and transport directions. Using the sharp interface solution, we make global corrections to the bounds-preserving solution while maintaining preservation of bounds. By blending with the sharpened solution at the global level we are able to globally conserve mass without hindering the remap pseudo-time step. This new interface-aware ALE remap method is based entirely on partial assembly techniques where globally assembled matrix operators are no longer needed, resulting in a globally matrix-free FCT method for multi-material, multi-field ALE remap with high performance on GPU architectures. We present results of our new remap method on 1D, 2D and 3D benchmarks and describe the algorithmic tailoring for GPU architectures that was developed.

Vargas, Arturo [Lawrence Livermore National Labora↗
DOE OSTI2023

Not so HOT Triangulations

Here, we propose primal–dual mesh optimization algorithms that overcome shortcomings of the standard algorithm while retaining some of its desirable features. “Hodge-Optimized Triangulations” defines the “HOT energy” as a bound on the discretization error of the diagonalized Delaunay Hodge star operator. HOT energy is a natural choice for an objective function, but unstable for both mathematical and algorithmic reasons: it has minima for collapsed edges, and its extrapolation to non-regular triangulations is inaccurate and has unbounded minima. We propose a different extrapolation with a stronger theoretical foundation, and avoid extrapolation by recalculating the objective just beyond the flip threshold. We propose new objectives, based on normalizations of the HOT energy, with barriers to edge collapses and other undesirable configurations. We propose mesh improvement algorithms coupling these. When HOT optimization nearly collapses an edge, we actually collapse the edge. Otherwise, we use the barrier objective to update positions and weights and remove vertices. By combining discrete connectivity changes with continuous optimization, we more fully explore the space of possible meshes and obtain higher quality solutions.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Exploring the Feasibility of INCONEL® ALLOY 740H® for Power Plant Headers: Integrating Machine Learning with Computational Fluid Dynamics (CFD)

This keynote presentation explores the behavior of headers—essential components of pipeline systems—using ANSYS simulation software and machine learning techniques. The study aims to predict the thermal and mechanical performance of headers under diverse conditions through both steady-state and transient simulations. We investigate critical parameters such as heat transfer coefficient, fluid velocity, and temperature to optimize header design. Conducted as part of a DOE project led by NCAT in collaboration with UNC Charlotte, this research encompasses multiple key topics. The initial section focuses on the behavior of header systems under steady-state conditions using ANSYS simulation. It underscores the importance of headers in industrial infrastructure, especially in the energy sector, and examines the implications of material selection and flow direction on heat transfer dynamics. Methodologically, we employ Computational Fluid Dynamics (CFD) analysis through ANSYS, detailing the development of models, material properties, geometry specifications, boundary conditions, and meshing strategies. Our simulations explore various operational parameters, including temperature and mass flow rates, crucial for predicting heat transfer coefficients and enhancing header design. Results from the study include parametric investigations into mesh sensitivity, viscosity model evaluations, and the effects of heat transfer locations, all validated against theoretical calculations. We conclude with insights on mesh optimization, the suitability of viscosity models, and recommendations for future research aimed at improving header system efficiency and sustainability in industrial applications.

20 FOSSIL-FUELED POWER PLANTS↗
DOE OSTI2023

An unstructured mesh based neutronics optimization workflow

We have developed a fully automated workflow to optimize the neutronics performance of the Second Target Station (STS) at the Oak Ridge National Laboratory’s Spallation Neutron Source. The optimization workflow starts with the parametrized solid CAD engineering models and converts them into the unstructured mesh (UM) models for the neutronics calculations with MCNP6.2. Calculations are executed and their results are loaded into the Dakota optimization toolkit. Dakota analyzes the results and proposes new geometry parameters for the next design iteration. The cycle repeats until the optimal parameters are found. The automated CAD to MCNP conversion, the use of high-fidelity UM models, and the use of modern optimizer are the key elements that advance the entire optimization workflow in comparison with the original workflow. The original workflow was based on a simplified constructive solid geometry (CSG) modeling with MCNPX, mcnp_pstudy tool, and an in-house optimizer. Herein to demonstrate the new workflow, we present a case of neutronics optimization of the moderator–reflector assembly (MRA). Apart from the MRA, the workflow can optimize other major STS components, such as the spallation target, neutron beamlines, radiation shielding, and various accelerator components. Importantly, the new workflow opens the door to the advanced multi-physics multi-parameter optimization and has the potential for use in other nuclear physics and accelerator applications.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗