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

h5bench: A unified benchmark suite for evaluating HDF5 I/O performance on pre‐exascale platforms

Summary Parallel I/O is a critical technique for moving data between compute and storage subsystems of supercomputers. With massive amounts of data produced or consumed by compute nodes, high‐performant parallel I/O is essential. I/O benchmarks play an important role in this process; however, there is a scarcity of I/O benchmarks representative of current workloads on HPC systems. Toward creating representative I/O kernels from real‐world applications, we have created h5bench , a set of I/O kernels that exercise hierarchical data format version 5 (HDF5) I/O on parallel file systems in numerous dimensions. Our focus on HDF5 is due to the parallel I/O library's heavy usage in various scientific applications running on supercomputing systems. The various tests benchmarked in the h5bench suite include I/O operations (read and write), data locality (arrays of basic data types and arrays of structures), array dimensionality (one‐dimensional arrays, two‐dimensional meshes, three‐dimensional cubes), I/O modes (synchronous and asynchronous). In this paper, we present the observed performance of h5bench executed along several of these dimensions on existing supercomputers (Cori and Summit) and pre‐exascale platforms (Perlmutter, Theta, and Polaris). h5bench measurements can be used to identify performance bottlenecks and their root causes and evaluate I/O optimizations. As the I/O patterns of h5bench are diverse and capture the I/O behaviors of various HPC applications, this study will be helpful to the broader supercomputing and I/O community.

97 MATHEMATICS AND COMPUTING↗

Iteration-based Linearized Distribution-level Locational Marginal Price for Three-phase Unbalanced Distribution Systems

Distributed energy resources (DERs) are rocking the utilities’ business landscape. It calls for competitive market environments that incentivize DERs to form maximum operating efficiency. Among proposed pricing schemes, distribution-level locational marginal price (DLMP) is effective in signaling the marginal generation cost differences driven by energy losses and network constraints. It can be derived from a distribution-level optimal power flow (OPF) framework, as it essentially presents the sensitivity of optimized generation cost towards incremental loads. However, due to the high resistance-to-inductance ratio and unbalanced characteristics of distribution networks, computational affordable DLMPs are highly challenged. This article provides a linear-approximated DLMP that can be solved efficiently and generalized to account for reactive power flow, three-phase unbalanced loads and meshed network structure. The successive linear programming technique is introduced to enhance the model accuracy. Case studies on an IEEE 123-Bus system validate its accuracy against a nonlinear benchmark and capability in offering proper incentives.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Choosing Transport Events for Initiating Splitting and Rouletting

A study was performed to determine which transport events should be used to initiate a weight window lookup to achieve the best variance reduction performance. A weight window lookup potentially triggers particle splitting (in important regions of phase space) or rouletting (in unimportant regions), thereby optimizing computational effort. Potential initiating transport events include collisions (both pre- and post-collision), geometry surface crossings, traversing a mean-free path, and streaming across a weight window boundary. Permutations of these initiating events were tested on an urban model with background radiation sources and a spent fuel cask with a neutron dose mesh tally. Generally, all methods perform better with finer weight window meshes. Tracking on weight windows performs well for coarse weight window meshes, while a combination of splitting each mean-free path, geometric surface crossing, and before collisions performs well for fine weight window meshes.

42 ENGINEERING↗

Method and apparatus for shape-based energy analysis of solids

A computer-readable medium stores instructions including storing a model of a physical structure and defining a mesh for the model. The mesh includes finite elements, each defined by a respective set of edges. The instructions include, for each finite element, identifying a governing differential equation and a set of complementary functions that exactly satisfy the governing differential equation. The instructions include determining an applied physical stimulus for the physical structure. The instructions include generating an energy optimization model that minimizes a difference between internal energy and external energy of the finite elements in response to the applied physical stimulus. The model includes a matrix of respective scalar multipliers for the complementary functions for each finite element. The instructions include transforming the matrix and calculating a physical parameter of interest. The instructions include, in response to the physical parameter not satisfying a design parameter, updating the model of the physical structure.

Spears, Robert E.↗

EMGeo 3.0

EMGeo 3.0 an algorithm that improves both the computational capabilities of joint 3D electromagnetic, EM and magnetotelluric and acoustic seismic wavefield simulation and inverse modeling. This seismic wavefield module requires that data be transformed first to the Laplace-Fourier Domain before processing. The inverse modeling is based upon non-liner conjugated gradients and 3D finite differences approximations of the seismic, EM and MT wavefields. Improved modeling efficiencies are obtain by separating the modeling grid from the simulation grid. This grid separation method allows for treatment of very large data sets and imaging volumes. Further computational efficiency is obtained by combining different levels of parallezation using the Message Passing Interface (MPI). Bound constraints are employed in the imaging process to insure stability. Additional acceleration of the inverse modeling is achieved by preconditioning the conjugate gradient optimizer using an approximate Hessian. The algorithm includes improved capabilities to accurately treat models that exhibit transverse anisotropy in the electrical conductivity. However, the seismic acoustic velocity is assumed to be isotropic. Models exhibiting topography and bathymetry can be treated. The software also includes a set of pre and post processing tools for designing input model meshes and data plotting.

Gregory Newman, Michael Commer↗

Analysis of the SiMPL Method for Density-Based Topology Optimization

We present a rigorous convergence analysis of a new method for density-based topology optimization that provides pointwise bound-preserving design updates and faster convergence than other popular first-order topology optimization methods. Due to its strong bound preservation, the method is exceptionally robust, as demonstrated in numerous examples here and in the companion article [D. Kim et al., Struct. Multidiscip. Optim., 68 (2025), 74]. Furthermore, it is easy to implement with clear structure and analytical expressions for the updates. Our analysis covers two versions of the method, characterized by the employed line search strategies. We consider a modified Armijo backtracking line search and a Bregman backtracking line search. For both line search algorithms, our algorithm delivers a strict monotone decrease in the objective function and further intuitive convergence properties, e.g., strong and pointwise convergence of the density variables on the active sets, norm convergence to zero of the increments, convergence of the Lagrange multipliers, and more. In addition, the numerical experiments demonstrate apparent mesh-independent convergence of the algorithm. Here, we refer to the new algorithm as the SiMPL method (pronounced “simple”), which stands for Sigmoidal Mirror descent with a Projected Latent variable.

97 MATHEMATICS AND COMPUTING↗

Multi-plane moment-of-fluid interface reconstruction in 3D

Moment-of-fluid (MOF) methods for interface reconstruction approximate the region occupied by material in each mesh element only through reference to its geometric moments. Here, we present a 3D MOF method that represents the material (POM) in each cell as the convex intersection of the cell and multiple half-spaces, each selected to minimize the least-squares error between computed moments of the approximated material and provided reference moments. This optimization problem is highly non-linear and non-convex, making the numerical result very sensitive to the initial guess. To create an effective initial guess in each cell, we construct an ellipsoid from 0th–2nd order reference moments such that its shape corresponds with that of the POM. Within this ellipsoid we inscribe a polyhedron, and initialize the minimization problem with the half-spaces defined by each of its faces. The inscribed polyhedron has minimally 4 faces, and using up to 3rd order moments permits optimization over up to 20 unknown values. We therefore define MOF methods that utilize 4, 5, or 6 half-spaces, correspondingly initialized with the faces of a single inscribed tetrahedron, triangular prism, or hexahedron. Stability of the non-linear optimization is further improved with a prepossessing step that normalizes the reference moments according to the axes of the reference ellipsoid. Using this approach, the non-linear least-squares solver reliably converges to a near-global minimum from a single initial guess. We demonstrate accuracy and robustness using single-cell and multi-cell examples over a wide spectrum of geometry. In particular, we demonstrate our ability to exactly reproduce several important and complex features defined by up to four half-spaces, such as corners, filaments, filament tips, and embedded material in the cell.

3D interface reconstruction↗

ePLAS Development for Jet Modeling and Applications

Plasma jets provide an alternate approach to the creation of high energy density laboratory plasmas (HEDLP). For the Plasma Liner Experiment (PLX), typically 30 partially ionized argon jets, produced with mini-rail guns, will be focused into a central volume for subsequent magnetic compression into high density plasma liners that can reach high (0.1 Mbar) peak pressures upon stagnation. The jets are typically 2.5 cm in radius traveling at Mach number 30. Ultimate success will require optimized tuning of the rail configurations, the nozzles injecting the gases, and the careful implementation of pre-ionization. The modeling of plasma jet transport is particularly challenging, due the large space (100 sq cm) and time scales (microseconds) involved. Even traditional implicit methods are insufficient, due to the usual need to track electrons explicitly on the mesh. Wall emission and chemistry must be managed, as must ionization of the jet plasma. Ions in the jets are best followed as particles to account properly for collisions upon jet merger. This Phase I Project developed the code ePLAS to attack and successfully surmount many of these challenges. It invented a new 'super implicit' electromagnetic scheme, using implicit electron moment currents that allowed for modeling of jets over multi-cm and multi-picoseconds on standard, single processor 2 GHz PCs. It enabled merger studies of two jets, in preparation for the multi-jet merger problem. The Project explored particle modeling for the ions, and prepared for the future addition of a grid-base jet ion collision model. Access was added to tabular equations of state for the study of ionization effects in merging jets. The improved code was discussed at the primary plasma meetings (IEEE and APS) during the Project period. Collaborations with National Laboratory and industrial partners were nurtured. Code improvements were made to facilitate code use. See: http://www.researchapplicationscorp.com. The ePLAS code enjoys EAR99 export control treatment, permitting distribution to most foreign countries without a license.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Recovery Act: Federspiel Controls (now Vigilent) and State of California Department of General Services Data Center Energy Efficient Cooling Control Demonstration. Final technical project report

Eight State of California data centers were equipped with an intelligent energy management system to evaluate the effectiveness, energy savings, dollar savings and benefits that arise when powerful artificial intelligence-based technology measures, monitors and actively controls cooling operations. Control software, wireless sensors and mesh networks were used at all sites. Most sites used variable frequency drives as well. The system dynamically adjusts temperature and airflow on the fly by analyzing real-time demands, thermal behavior and historical data collected on site. Taking into account the chaotic interrelationships of hundreds to thousands of variables in a data center, the system optimizes the temperature distribution across a facility while also intelligently balancing loads, outputs, and airflow. The overall project will provide a reduction in energy consumption of more than 2.3 million kWh each year, which translates to $240,000 saved and a reduction of 1.58 million pounds of carbon emissions. Across all sites, the cooling energy consumption was reduced by 41%. The average reduction in energy savings across all the sites that use VFDs is higher at 58%. Before this case study, all eight data centers ran the cooling fans at 100% capacity all of the time. Because of the new technology, cooling fans run at the optimum fan speed maintaining stable air equilibrium while also expending the least amount of electricity. With lower fan speeds, the life of the capital investment made on cooling equipment improves, and the cooling capacity of the data center increases. This case study depicts a rare technological feat: The same process and technology worked cost effectively in eight very different environments. The results show that savings were achieved in centers with diverse specifications for the sizes, ages and types of cooling equipment. The percentage of cooling energy reduction ranged from 19% to 78% while keeping temperatures substantially within the limits recommended by the American Society of Heating, Refrigeration, and Air-Conditioning Engineers (ASHRAE) for data center facilities.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Zgoubi Users' Guide

The computer code zgoubi calculates trajectories of charged particles in magnetic and electric fields. At the origin specially adapted to the definition and adjustment of beam lines and magnetic spectrometers, it has so evolved that it allows the study of systems including complex sequences of optical elements such as dipoles, quadrupoles, arbitrary multipoles, FFAG magnets and other magnetic or electric devices, and is able as well to handle periodic structures. Compared to other codes, it presents several peculiarities, as follows - a non-exhaustive list : • a numerical method for integrating the Lorentz equation, based on Taylor series, which optimizes computing time and provides high accuracy and strong symplecticity, • spin tracking, using the same numerical method as for the Lorentz equation, • account of stochastic photon emission, and its effects on particle dynamics, • calculation of the synchrotron radiation electric field and spectra in arbitrary magnetic fields, from the ray-tracing outcomes, • the possibility of using a mesh, which allows ray-tracing from simulated or measured (1-D, 2-D or 3-D) electric and magnetic field maps, • a number Monte Carlo procedures : unlimited number of trajectories, in-flight decay, stochastic radiation, etc., • built-in fitting procedures allowing arbitrary variables and a large variety of constraints, easily expandable, • multi-turn tracking in circular accelerators including features proper to machine parameter calculation and survey, • simulation of time-varying power supplies, and • simulation of arbitrary radio-frequency programs. The initial version of zgoubi was dedicated to ray-tracing in magnetic elements, beam lines, spectrometers. It was perfected for the purpose of studying, and operating, the four spectrometers SPES I, II, III, IV at the Laboratoire National SATURNE (CEA-Saclay, France), and, later, SPEG at GANIL (Caen, France). Developments regarding spin tracking and ray-tracing in combined electric and magnetic fields were implemented, in the late 1980s and early 1990s respectively. In the mid-1990s, the computation of synchrotron radiation electromagnetic impulse and spectra was introduced, for the purpose of synchrotron radiation diagnostic R&D at LEP, and further applied to the design of the SR diagnostics installations at LHC in the early 2000s. In the mean time, several new optical elements were added, such as electro-magnetic and other electrostatic lenses. Used since several years for special studies in periodic machines (e.g., SATURNE at Saclay, COSY at Julich, LEP and LHC at CERN), zgoubi has also undergone extensive developments regarding storage ring related features. Many developments have been accomplished since the early 2000s in the frame of a number of project design and beam dynamics studies, as the neutrino factory, lepton and hadron colliders, spin studies at AGS and RHIC, etc. As a consequence the list of optical elements and the compendium of numerical methods, so-called “Glossary of Keywords” list, pp. 7 and 169, has stretched with new simulation and computing procedures, ranging from fitting (FIT2 procedure ; additional constraints) to overlapping magnetic field capabilities (DIPOLES, FFAG), spin manipulation (SPINR), optical elements (BEAMBEAM), radiation damping tools (SRLOSS) and many others (FAISTORE, MAP2D-E, OPTICS, PICKUPS, TWISS, etc.). The graphic interface to zgoubi (zpop, Part D) has undergone extensive developments, making it a convenient companion tool to the use of zgoubi.

43 PARTICLE ACCELERATORS↗

Optimal control model of technology transition.

This paper discusses the use of optimization software to solve an optimal control problem arising in the modeling of technology transition. We set up a series of increasingly complex models with such features as learning-by-doing, adjustment cost, and capital investment. The models are written in continuous time and then discretized by using different methods to transform them into large-scale nonlinear programs. We use a modeling language and numerical optimization methods to solve the optimization problem. Our results are consistent with findings in the literature and highlight the impact the discretization choice has on the solution and accuracy. The primary goal of this paper is to develop solution methods for use in policy work. To do this, we will need to expand the model to include realistic features such as additional technologies and capital conversion. Our modeling approach allows us to add new technologies with minimal effort. For example, Figure 5 presents the solution to the capital model that includes a third technology, say, nuclear fusion, that is emission free but even more expensive (A{sub 3} > A{sub n}). We observe that industry first transitions to the intermediate technology but eventually adopts the cleanest one. We note that our solutions have few areas of large curvature and are relatively smooth elsewhere. On such smooth segments, we can achieve adequate precision with relatively large periods, which means fewer variables and increased computation speed. But we still need a small step length during the transition period. Adaptive mesh refinement methods have been developed to automatically identify the areas where extra precision is needed. Betts (2001) describes how the computation time can be reduced by a factor of 2.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗

Enriched immersed finite element and isogeometric analysis: algorithms and data structures

Immersed finite element methods provide a convenient analysis framework for problems involving geometrically complex domains, such as those found in topology optimization and microstructures for engineered materials. However, their implementation remains a major challenge due to, among other things, the need to apply nontrivial stabilization schemes and generate custom quadrature rules. This article introduces the robust and computationally efficient algorithms and data structures comprising an immersed finite element preprocessing framework. The input to the preprocessor consists of a background mesh and one or more geometries defined on its domain. The output is structured into groups of elements with custom quadrature rules formatted such that common finite element assembly routines may be used without or with only minimal modifications. The key to the preprocessing framework is the construction of material topology information, concurrently with the generation of a quadrature rule, which is then used to perform enrichment and generate stabilization rules. While the algorithmic framework applies to a wide range of immersed finite element methods using different types of meshes, integration, and stabilization schemes, the preprocessor is presented within the context of the extended isogeometric analysis. This method utilizes a structured B-spline mesh, a generalized Heaviside enrichment strategy considering the material layout within individual basis functions’ supports, and face-oriented ghost stabilization. Using a set of examples, the effectiveness of the enrichment and stabilization strategies is demonstrated alongside the preprocessor’s robustness in geometric edge cases. Additionally, the performance and parallel scalability of the implementation are evaluated.

Computer implementation↗

Hands-on Performance Tuning of 3D Finite Difference Earthquake Simulation on GPU Fermi Chipset

3D simulation of earthquake ground motion is one of the most challenging computational problems in science. The emergence of graphic processing units (GPU) as an effective alternative to traditional general purpose processors has become increasingly capable in terms of accelerating scientific computing research. In this paper, we describe our experiences in porting AWP-ODC, a 3D finite difference seismic wave propagation code, to the latest GPU Fermi chipset. We completely rewrote this Fortran-based 13-point asymmetric stencil computation code in C and MPI-CUDA in order to take advantage of the powerful GPU computing capabilities. Our new CUDA code implemented the asymmetric 3D stencil on Fermi to make the best use of GPU on-chip memory for an aggressive parallel efficiency. Benchmark on NVIDIA Tesla M2090 demonstrated 10x speedup versus the original fully optimized AWP-ODC FORTRAN MPI code running on a single Intel Nehalem 2.4 GHz CPU socket (4 cores/CPU), and 15x speedup versus the same MPI code running on a single AMD Istanbul 2.6 GHz CPU socket (6 cores/CPU). Sustained single-GPU performance of 143.8 GFLOPS in single precision is benchmarked for the testing case of 128x128x960 mesh size.

3D Stencil Computation↗

LC-Opt: Benchmarking Reinforcement Learning and Agentic AI for End-to-End Liquid Cooling Optimization in Data Centers

Liquid cooling is critical for thermal management in high-density data centers with the rising AI workloads. However, machine learning-based controllers are essential to unlock greater energy efficiency and reliability, promoting sustainability. We present LC-Opt, a Sustainable Liquid Cooling (LC) benchmark environment, for reinforcement learning (RL) control strategies in energy-efficient liquid cooling of high-performance computing (HPC) systems. Built on the baseline of a high-fidelity digital twin of Oak Ridge National Lab's Frontier Supercomputer cooling system, LC-Opt provides detailed Modelica-based end-to-end models spanning site-level cooling towers to data center cabinets and server blade groups. RL agents optimize critical thermal controls like liquid supply temperature, flow rate, and granular valve actuation at the IT cabinet level, as well as cooling tower (CT) setpoints through a Gymnasium interface, with dynamic changes in workloads. This environment creates a multi-objective real-time optimization challenge balancing local thermal regulation and global energy efficiency, and also supports additional components like a heat recovery unit (HRU). We benchmark centralized and decentralized multi-agent RL approaches, demonstrate policy distillation into decision and regression trees for interpretable control, and explore LLM-based methods that explain control actions in natural language through an agentic mesh architecture designed to foster user trust and simplify system management. LC-Opt democratizes access to detailed, customizable liquid cooling models, enabling the ML community, operators, and vendors to develop sustainable data center liquid cooling control solutions.

Naug, Avisek [Hewlett Packard Enterprise]↗

Formation and Transportation of an Intense Sub-Millisecond Electron Beam in a Longitudinal Magnetic Field in the Source with a Mesh Plasma Cathode

The limiting parameters of an intense sub-millisecond electron beam generated in the source with a plasma cathode on the basis of a low-pressure multi-arc discharge with mesh stabilization of the cathode (emission) plasma boundary and mobile anode (beam) plasma boundary are investigated. It is demonstrated that the limiting parameters of the electron beam in the examined electrode system are limited by its energy content on a level of about 4 kJ the excess of which leads to an electric breakdown of the accelerating gap. The optimal pressures are determined at which the beam during its transportation in the longitudinal magnetic field with a preset configuration has maximal parameters for the given electrode system. Different mechanisms of electric breakdown initiation and methods for increasing the electric strength of the high-voltage accelerating gap in this electrode system are discussed.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Fully coupled simulation of cosmic reionization. I. numerical methods and tests

Here, we describe an extension of the Enzo code to enable fully coupled radiation hydrodynamical simulation of inhomogeneous reionization in large similar to(100 Mpc)(3) cosmological volumes with thousands to millions of point sources. We solve all dynamical, radiative transfer, thermal, and ionization processes self-consistently on the same mesh, as opposed to a postprocessing approach which coarse-grains the radiative transfer. But, we employ a simple subgrid model for star formation which we calibrate to observations. The numerical method presented is a modification of an earlier method presented in Reynolds et al. differing principally in the operator splitting algorithm we use to advance the system of equations. Radiation transport is done in the gray flux-limited diffusion (FLD) approximation, which is solved by implicit time integration split off from the gas energy and ionization equations, which are solved separately. This results in a faster and more robust scheme for cosmological applications compared to the earlier method. The FLD equation is solved using the hypre optimally scalable geometric multigrid solver from LLNL. By treating the ionizing radiation as a grid field as opposed to rays, our method is scalable with respect to the number of ionizing sources, limited only by the parallel scaling properties of the radiation solver. We test the speed and accuracy of our approach on a number of standard verification and validation tests. We show by direct comparison with Enzo's adaptive ray tracing method Moray that the well-known inability of FLD to cast a shadow behind opaque clouds has a minor effect on the evolution of ionized volume and mass fractions in a reionization simulation validation test. Finally, we illustrate an application of our method to the problem of inhomogeneous reionization in a 80 Mpc comoving box resolved with 3200(3) Eulerian grid cells and dark matter particles.

79 ASTRONOMY AND ASTROPHYSICS↗

Learning Robust Marking Policies for Adaptive Mesh Refinement

Here in this work, we revisit the marking decisions made in the standard adaptive finite element method (AFEM). Experience shows that a naïve marking policy leads to inefficient use of computational resources for adaptive mesh refinement (AMR). Consequently, using AMR in practice often involves ad-hoc or time-consuming offline parameter tuning to set appropriate parameters for the marking subroutine. To address these practical concerns, we recast AMR as a Markov decision process in which refinement parameters can be selected on-the-fly at run time, without the need for pre-tuning by expert users. In this new paradigm, the refinement parameters are also chosen adaptively via a marking policy that can be optimized using methods from reinforcement learning. We use the Poisson equation to demonstrate our techniques on h- and hp-refinement benchmark problems, and our experiments suggest that superior marking policies remain undiscovered for many classical AFEM applications. Furthermore, an unexpected observation from this work is that marking policies trained on one family of PDEs are sometimes robust enough to perform well on problems far outside the training family. For illustration, we show that a simple hp-refinement policy trained on 2D domains with only a single re-entrant corner can be deployed on far more complicated 2D domains, and even 3D domains, without significant performance loss. For reproduction and broader adoption, we accompany this work with an open-source implementation of our methods.

97 MATHEMATICS AND COMPUTING↗

The fluid dynamic approach to equidistribution methods for grid generation and adaptation

The equidistribution methods based on L{sub p} Monge-Kantorovich optimization [Finn and Delzanno, submitted to SISC, 2009] and on the deformation [Moser, 1965; Dacorogna and Moser, 1990, Liao and Anderson, 1992] method are analyzed primarily in the context of grid generation. It is shown that the first class of methods can be obtained from a fluid dynamic formulation based on time-dependent equations for the mass density and the momentum density, arising from a variational principle. In this context, deformation methods arise from a fluid formulation by making a specific assumption on the time evolution of the density (but with some degree of freedom for the momentum density). In general, deformation methods do not arise from a variational principle. However, it is possible to prescribe an optimal deformation method, related to L{sub 1} Monge-Kantorovich optimization, by making a further assumption on the momentum density. Some applications of the L{sub p} fluid dynamic formulation to imaging are also explored.

99 GENERAL AND MISCELLANEOUS↗