Engineering Papers⌕ Search

SEARCH · Engineering Papers

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 523 records · Page 29
All sourcesNASA NTRSDOE OSTI
DOE OSTI2021

Efficient exascale discretizations: High-order finite element methods

Efficient exploitation of exascale architectures requires rethinking of the numerical algorithms used in many large-scale applications. These architectures favor algorithms that expose ultra fine-grain parallelism and maximize the ratio of floating point operations to energy intensive data movement. One of the few viable approaches to achieve high efficiency in the area of PDE discretizations on unstructured grids is to use matrix-free/partially assembled high-order finite element methods, since these methods can increase the accuracy and/or lower the computational time due to reduced data motion. In this paper we provide an overview of the research and development activities in the Center for Efficient Exascale Discretizations (CEED), a co-design center in the Exascale Computing Project that is focused on the development of next-generation discretization software and algorithms to enable a wide range of finite element applications to run efficiently on future hardware. CEED is a research partnership involving more than 30 computational scientists from two US national labs and five universities, including members of the Nek5000, MFEM, MAGMA and PETSc projects. We discuss the CEED co-design activities based on targeted benchmarks, miniapps and discretization libraries and our work on performance optimizations for large-scale GPU architectures. We also provide a broad overview of research and development activities in areas such as unstructured adaptive mesh refinement algorithms, matrix-free linear solvers, high-order data visualization, and list examples of collaborations with several ECP and external applications.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

End-to-end GPU acceleration of low-order-refined preconditioning for high-order finite element discretizations

In this article, we present algorithms and implementations for the end-to-end GPU acceleration of matrix-free low-order-refined preconditioning of high-order finite element problems. The methods described here allow for the construction of effective preconditioners for high-order problems with optimal memory usage and computational complexity. The preconditioners are based on the construction of a spectrally equivalent low-order discretization on a refined mesh, which is then amenable to, for example, algebraic multigrid preconditioning. The constants of equivalence are independent of mesh size and polynomial degree. For vector finite element problems in H(curl) and H(div) (e.g., for electromagnetic or radiation diffusion problems), a specially constructed interpolation–histopolation basis is used to ensure fast convergence. Detailed performance studies are carried out to analyze the efficiency of the GPU algorithms. The kernel throughput of each of the main algorithmic components is measured, and the strong and weak parallel scalability of the methods is demonstrated. The different relative weighting and significance of the algorithmic components on GPUs and CPUs is discussed. Results on problems involving adaptively refined nonconforming meshes are shown, and the use of the preconditioners on a large-scale magnetic diffusion problem using all spaces of the finite element de Rham complex is illustrated.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

High-Resolution Simulations of Geological CO 2 Injection: Application to the SPE11 Benchmark

Geological carbon sequestration (GCS) will play a critical role in decarbonization and in facilitating the transition to clean energy systems. Because CO 2 is highly mobile, ensuring its safe and permanent injection into subsurface geological formations involves monitoring over larger spatial domains and longer time periods than is typical for hydrocarbon reservoirs. This can benefit from simulation tools capable of modeling key CO 2 trapping mechanisms, particularly those optimized for speed and scalability on high-performance computing systems. Using isothermal versions of the SPE11B and SPE11C benchmark cases, we conduct a mesh refinement study simulating CO 2 injection into kilometer-scale rock formations at centimeter resolution with the GEOS open-source simulation framework. We focus on how mesh refinement improves the accuracy of convective mixing in both 2D and 3D simulations. The computational costs associated with achieving a converged solution highlight the need for predictive upscaling techniques. A systematic performance scaling analysis—including both central processing unit (CPU) and graphics processing unit (GPU) architectures—complements the “Results” section.

Geosciences↗
DOE OSTI2021

"Hybrid fracture/matrix modeling for well completion options evaluation"

Orientation and completion for well pairs that have been subjected to multi-zonal stimulation play a critical role in the long-term performance of an Enhanced Geothermal Reservoir. Here we present the development of a methodology to rapidly and efficiently numerically simulate mixed fracture-matrix flow systems for evaluation of well design and completion options. The methodology is based on a loose coupling framework, allowing the fracture and matrix systems to be meshed separately. The fracture system includes the integration of fracture growth and aperture data from well stimulation simulations of stochastically generated fracture networks. Automatic mesh refinement is used in the matrix simulation to resolve heat transfer near the fracture network. This simulation framework is used to efficiently determine optimal production and injection well placement using adaptive sampling.

15 GEOTHERMAL ENERGY↗
NASA NTRS1998

PLUM: Parallel Load Balancing for Unstructured Adaptive Meshes

Dynamic mesh adaption on unstructured grids is a powerful tool for computing large-scale problems that require grid modifications to efficiently resolve solution features. Unfortunately, an efficient parallel implementation is difficult to achieve, primarily due to the load imbalance created by the dynamically-changing nonuniform grid. To address this problem, we have developed PLUM, an automatic portable framework for performing adaptive large-scale numerical computations in a message-passing environment. First, we present an efficient parallel implementation of a tetrahedral mesh adaption scheme. Extremely promising parallel performance is achieved for various refinement and coarsening strategies on a realistic-sized domain. Next we describe PLUM, a novel method for dynamically balancing the processor workloads in adaptive grid computations. This research includes interfacing the parallel mesh adaption procedure based on actual flow solutions to a data remapping module, and incorporating an efficient parallel mesh repartitioner. A significant runtime improvement is achieved by observing that data movement for a refinement step should be performed after the edge-marking phase but before the actual subdivision. We also present optimal and heuristic remapping cost metrics that can accurately predict the total overhead for data redistribution. Several experiments are performed to verify the effectiveness of PLUM on sequences of dynamically adapted unstructured grids. Portability is demonstrated by presenting results on the two vastly different architectures of the SP2 and the Origin2OOO. Additionally, we evaluate the performance of five state-of-the-art partitioning algorithms that can be used within PLUM. It is shown that for certain classes of unsteady adaption, globally repartitioning the computational mesh produces higher quality results than diffusive repartitioning schemes. We also demonstrate that a coarse starting mesh produces high quality load balancing, at a fraction of the cost required a fine initial mesh. Results indicate that our parallel load balancing strategy will remain viable on large numbers of processors.

Oliker, Leonid↗
DOE OSTI2016

Challenges of Monte Carlo Transport

These are slides from a presentation for Parallel Summer School at Los Alamos National Laboratory. Solving discretized partial differential equations (PDEs) of interest can require a large number of computations. We can identify concurrency to allow parallel solution of discrete PDEs. Simulated particles histories can be used to solve the Boltzmann transport equation. Particle histories are independent in neutral particle transport, making them amenable to parallel computation. Physical parameters and method type determine the data dependencies of particle histories. Data requirements shape parallel algorithms for Monte Carlo. Then, Parallel Computational Physics and Parallel Monte Carlo are discussed and, finally, the results are given. The mesh passing method greatly simplifies the IMC implementation and allows simple load-balancing. Using MPI windows and passive, one-sided RMA further simplifies the implementation by removing target synchronization. The author is very interested in implementations of PGAS that may allow further optimization for one-sided, read-only memory access (e.g. Open SHMEM). The MPICH_RMA_OVER_DMAPP option and library is required to make one-sided messaging scale on Trinitite - Moonlight scales poorly. Interconnect specific libraries or functions are likely necessary to ensure performance. BRANSON has been used to directly compare the current standard method to a proposed method on idealized problems. The mesh passing algorithm performs well on problems that are designed to show the scalability of the particle passing method. BRANSON can now run load-imbalanced, dynamic problems. Potential avenues of improvement in the mesh passing algorithm will be implemented and explored. A suite of test problems that stress DD methods will elucidate a possible path forward for production codes.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2024

Localized Evaluation for Constructing Discrete Vector Fields

Topological abstractions offer a method to summarize the behavior of vector fields, but computing them robustly can be challenging due to numerical precision issues. One alternative is to represent the vector field using a discrete approach, which constructs a collection of pairs of simplices in the input mesh that satisfies criteria introduced by Forman's discrete Morse theory. While numerous approaches exist to compute pairs in the restricted case of the gradient of a scalar field, state-of-the-art algorithms for the general case of vector fields require expensive optimization procedures. This paper introduces a fast, novel approach for pairing simplices of two-dimensional, triangulated vector fields that do not vary in time. The key insight of our approach is that we can employ a local evaluation, inspired by the approach used to construct a discrete gradient field, where every simplex in a mesh is considered by no more than one of its vertices. Specifically, we observe that for any edge in the input mesh, we can uniquely assign an outward direction of flow. We can further expand this consistent notion of outward flow at each vertex, which corresponds to the concept of a downhill flow in the case of scalar fields. Working with outward flow enables a linear-time algorithm that processes the (outward) neighborhoods of each vertex one-by-one, similar to the approach used for scalar fields. Here, we couple our approach to constructing discrete vector fields with a method to extract, simplify, and visualize topological features. Empirical results on analytic and simulation data demonstrate drastic improvements in running time, produce features similar to the current state-of-the-art, and show the application of simplification to large, complex flows.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

A two-dimensional numerical study of the magneto-Rayleigh–Taylor instability with FLASH: Application to the staged Z-pinch concept

Magnetically driven implosions involving a liner collapsing onto a target are inherently vulnerable to the magneto-Rayleigh–Taylor instability (MRTI). Among the various approaches proposed to achieve fusion conditions within the target, the staged Z-pinch (SZP) concept employs a high-Z liner, the advantages of which remain an active area of investigation. Consequently, ongoing design optimization efforts are essential, while critical physical processes such as magnetic field (B-field) diffusion and radiation transport increase the complexity of required simulations. In this study, we utilize the new capabilities of the FLASH code to simulate in 2D, for the first time using this code, staged Z-pinch configurations (designated SZP1 and SZP1*), focusing on their stability. First, a comparison of simulation results with theoretical predictions of MRTI growth provide new insights into the often-overlooked influences of high mesh resolution and initial perturbation seeding on instability dynamics. These findings then lead to a discussion on potential improvements for future SZP experiments. These include the use of an axial B-field stabilization and the optimization of radiation transport processes during the implosion. The results presented herein establish the framework for simulating multi-dimensional Z pinches using the FLASH code and pave the way for the development of innovative experimental configurations leveraging its advanced simulation capabilities.

Adaptive mesh refinement↗
NASA NTRSDate not supplied

Hailstorm Analyses and Detection Derived from Current and Historical Satellite Data and Convective Environmental Parameters

We seek to demonstrate the extent to which hailstorms can be detected using a combination of geostationary (GEO) visible and infrared metrics of storm intensity and convective environmental parameters from reanalysis. Hailstorm identifications from low-Earth-orbiting (LEO) passive microwave sensors and maximum expected size of hail (MESH) from ground-based radar serve as a proxy for hail events. Data are analyzed for two warm seasons over the contiguous United States (CONUS). A neural network (NN) is trained to predict hailstorm detection dependent on optimal multi-variate weighting of observed and modeled input. The NN results are then applied to a 15-year Meteosat Second Generation climatology over South Africa to depict where hailstorms are most likely to occur. We also explore the impact of GEO imager resolution on our ability to discriminate hailstorms by matching GOES-13 (4 km) and GOES-16 (2 km) storm intensity metrics against hail characteristics using LEO, MESH, and spotter reports over CONUS during 2017, when both satellites were simultaneously imaging. Such analysis allows us to assess the feasibility of assembling a severe storm climate data record back to GOES-8, in the mid-1990’s. Finer spatial resolution of GOES-16 better resolves the updraft characteristics and intensities that are inherently linked to hail formation; however, GOES-13 can be normalized to achieve comparable detection capability. When intelligently combined with model-derived convective environmental parameters, GEO-derived storm intensity metrics enable high-spatial resolution hail risk assessment at hourly intervals throughout the diurnal cycle anywhere around the world and an improved understanding of hailstorms in the climate system.

Kyle F Itterly↗
DOE OSTI2025

Exact signed distance fields using parallel Fast Sweeping Method

Signed distance fields are often used in multiphysics simulations to track material interfaces. We present a simple methodology based on the fast sweeping method to generate the exact signed distance from triangular meshes and linear paths on Cartesian grids. The methodology propagates the closest primitive to the boundary to the rest of the domain following the characteristics. A local upwind criterion is used to decide between the new and existing closest primitive at each grid point while capturing the correct sign of the global function. The methodology has optimal computational complexity and runs efficiently in distributed-memory architectures. We include 2D and 3D test cases along with a resolution study up to 0.512 trillion zones and 1,000 computer cores. The solution strategy can also be applied to other types of meshes or collections of primitives.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Design optimization of gap distance for the capillary limitation of a heat pipe with annular-type wick structure

In this study, an experimental investigation was conducted on the rising height and contact angle of fluid in an annular wick-type heat pipe. The annular wick-type heat pipe was characterized by a small gap between the wick structure and tube wall, which compensated for the pressure drop along the porous media and created additional capillary force. To describe and model the advantage of this gap, the rising of a wetting liquid in the gap between a vertical solid plate and a mesh (with a small angle between them) was experimentally measured and analyzed. An additional experiment was performed to investigate the effect of curvature on the capillary rise using tubes and meshes of varying radii. Resultantly, we confirmed that the linear combination of the contact angles of the solid plate and mesh could be applied to calculate the rising height from the Laplace–Young equation. Furthermore, the effect of curvature on the rising height of the liquid was negligible. These results were extended to the investigation of finding the optimal gap distance for the annular wick-type heat pipe by referring to previous studies. We observed that a gap distance of 1.27 mm provided the largest permeability (K) over the effective pore radius (r eff ) value for a heat pipe with ethanol, which in turn resulted in the highest capillary limitation. For a sodium heat pipe, a gap distance of 0.84 mm resulted in the highest capillary limitation.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2020

A cross-sectional aeroelastic analysis and structural optimization tool for slender composite structures

A fully open-source available framework for the parametric cross-sectional analysis and design optimization of slender composite structures, such as helicopter or wind turbine blades, is presented. The framework—Structural Optimization and Aeroelastic Analysis (SONATA)—incorporates two structural solvers, the commercial tool VABS, and the novel open-source code ANBA4. SONATA also parameterizes the design inputs, postprocesses and visualizes the results, and generates the structural inputs to a variety of aeroelastic analysis tools. It is linked to the optimization library OpenMDAO. This work presents the methodology and explains the fundamental approaches of SONATA. Structural characteristics were successfully verified for both VABS and ANBA4 using box beam examples from literature, thereby verifying the parametric approach to generating the topology and mesh in a cross section as well as the solver integration. The framework was furthermore exercised by analyzing and evaluating a fully resolved highly flexible wind turbine blade. Computed structural characteristics correlated between VABS and ANBA4, including off-diagonal terms. Stresses, strains, and deformations were recovered from loads derived through coupling with aeroelastic analysis. The framework, therefore, proves effective in accurately analyzing and optimizing slender composite structures on a high-fidelity level that is close to a three-dimensional finite element model.

42 ENGINEERING↗
DOE OSTI2021

MADLens, a python package for fast and differentiable non-Gaussian lensing simulations

Here, we present MADLens a python package for producing non-Gaussian lensing convergence maps at arbitrary source redshifts with unprecedented precision. MADLens is designed to achieve high accuracy while keeping computational costs as low as possible. A MADLens simulation with only particles produces convergence maps whose power agrees with theoretical lensing power spectra up to within the accuracy limits of HaloFit. This is made possible by a combination of a highly parallelizable particle-mesh algorithm, a sub-evolution scheme in the lensing projection, and a machine-learning inspired sharpening step. Further, MADLens is fully differentiable with respect to the initial conditions of the underlying particle-mesh simulations and a number of cosmological parameters. These properties allow MADLens to be used as a forward model in Bayesian inference algorithms that require optimization or derivative-aided sampling. Another use case for MADLens is the production of large, high resolution simulation sets as they are required for training novel deep-learning-based lensing analysis tools. We make the MADLens package publicly available under a Creative Commons License

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2017

A generalized Ewald decomposition for screened Coulomb interactions

Medium-range interactions occur in a wide range of systems, including charged-particle systems with varying screening lengths. We generalize the Ewald method to charged systems described by interactions involving an arbitrary dielectric response function ϵ(𝐤). We provide an error estimate and optimize the generalization to find the break-even parameters that separate a neighbor list-only algorithm from the particle-particle particle-mesh algorithm. We examine the implications of different choices of the screening length for the computational cost of computing the dynamic structure factor. We then use our new method in molecular dynamics simulations to compute the dynamic structure factor for a model plasma system and examine the wave-dispersion properties of this system.

Dharuman, Gautham↗
DOE OSTI2015

Resistive Network Optimal Power Flow: Uniqueness and Algorithms

The optimal power flow (OPF) problem minimizes the power loss in an electrical network by optimizing the voltage and power delivered at the network buses, and is a nonconvex problem that is generally hard to solve. By leveraging a recent development on the zero duality gap of OPF, we propose a second-order cone programming convex relaxation of the resistive network OPF, and study the uniqueness of the optimal solution using differential topology, especially the Poincare-Hopf Index Theorem. We characterize the global uniqueness for different network topologies, e.g., line, radial, and mesh networks. This serves as a starting point to design distributed local algorithms with global behaviors that have low complexity, are computationally fast, and can run under synchronous and asynchronous settings in practical power grids.

Tan, CW↗
DOE OSTI2015

Large-scale 3D geoelectromagnetic modeling using parallel adaptive high-order finite element method

Here, we have investigated the use of the adaptive high-order finite-element method (FEM) for geoelectromagnetic modeling. Because high-order FEM is challenging from the numerical and computational points of view, most published finite-element studies in geoelectromagnetics use the lowest order formulation. Solution of the resulting large system of linear equations poses the main practical challenge. We have developed a fully parallel and distributed robust and scalable linear solver based on the optimal block-diagonal and auxiliary space preconditioners. The solver was found to be efficient for high finite element orders, unstructured and nonconforming locally refined meshes, a wide range of frequencies, large conductivity contrasts, and number of degrees of freedom (DoFs). Furthermore, the presented linear solver is in essence algebraic; i.e., it acts on the matrix-vector level and thus requires no information about the discretization, boundary conditions, or physical source used, making it readily efficient for a wide range of electromagnetic modeling problems. To get accurate solutions at reduced computational cost, we have also implemented goal-oriented adaptive mesh refinement. The numerical tests indicated that if highly accurate modeling results were required, the high-order FEM in combination with the goal-oriented local mesh refinement required less computational time and DoFs than the lowest order adaptive FEM.

58 GEOSCIENCES↗
NASA NTRS1990

Topology and boundary shape optimization as an integrated design tool

The optimal topology of a two dimensional linear elastic body can be computed by regarding the body as a domain of the plane with a high density of material. Such an optimal topology can then be used as the basis for a shape optimization method that computes the optimal form of the boundary curves of the body. This results in an efficient and reliable design tool, which can be implemented via common FEM mesh generator and CAD type input-output facilities.

Bendsoe, Martin Philip↗
NASA NTRS1995

Grid generation and surface modeling for CFD

When computing the flow around complex three dimensional configurations, the generation of the mesh is the most time consuming part of any calculation. With some meshing technologies this can take of the order of a man month or more. The requirement for a number of design iterations coupled with ever decreasing time allocated for design leads to the need for a significant acceleration of this process. Of the two competing approaches, block-structured and unstructured, only the unstructured approach will allow fully automatic mesh generation directly from a CAD model. Using this approach coupled with the techniques described in this paper, it is possible to reduce the mesh generation time from man months to a few hours on a workstation. The desire to closely couple a CFD code with a design or optimization algorithm requires that the changes to the geometry be performed quickly and in a smooth manner. This need for smoothness necessitates the use of Bezier polynomials in place of the more usual NURBS or cubic splines. A two dimensional Bezier polynomial based design system is described.

Connell, Stuart D.↗