SEARCH · Engineering Papers

Results for “discretization”

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.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 721 records · Page 40

All sources NASA NTRS DOE OSTI

DOE OSTI2026

Getting Started with Evaluations with Means and Uncertainties (EMU 3.0)

One of the most fundamental quantities in nuclear physics is the reaction cross section. A cross section represents the probability that a nuclear reaction will resolve through a given channel given a target nucleus and a projectile with a certain energy. A nuclear evaluation is a set of discrete data and interpolation rules to convert those discrete nuclear reaction data—such as the cross section—into a continuous function at arbitrary energies. Evaluated nuclear data files that can appear in Evaluated Nuclear Data File (ENDF) and Generalized Nuclear Data Structure (GNDS) formats, storing a “most-complete” discretized representation of nuclear data, based on both experimental measurements and theory models.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

DOE OSTI2025

Virtual element approximations of the time-fractional nonlinear convection-diffusion equation on polygonal meshes

We extend the Virtual Element Method to a two-dimensional unsteady nonlinear convection-diffusion equation characterized by a fractional-order derivative with respect to the time variable. Our methodology is based on three fundamental technical components: a fractional version of the Grunwald-Letnikov approximation, discrete maximal regularity, and the regularity theory associated with non-linearity. We prove the method's well-posedness, i.e., the approximate solution's existence and uniqueness to the time-fractional convection-diffusion equation with a Lipschitz nonlinear source term. The fully discrete scheme inherently maintains stability and consistency by leveraging the discrete maximal regularity and the energy projection operator. The convergence in the L 2 -norm and H 1 -norm to various mesh configurations is validated by numerical results, underlining the practical effectiveness of the proposed method.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2026

Data-driven particle dynamics: Structure-preserving coarse-graining for emergent behavior in non-equilibrium systems

Multiscale systems are ubiquitous in science and technology, but are notoriously challenging to simulate as short spatiotemporal scales must be appropriately linked to emergent bulk physics. When expensive high-dimensional dynamical systems are coarse-grained into low-dimensional models, the entropic loss of information leads to emergent physics which are dissipative, history-dependent, and stochastic. To machine learn coarse-grained dynamics from time-series observations of particle trajectories, we propose a framework using the metriplectic bracket formalism that preserves these properties by construction; most notably, the framework guarantees discrete notions of the first and second laws of thermodynamics, conservation of momentum, and a discrete fluctuation-dissipation balance crucial for capturing non-equilibrium statistics. We introduce the mathematical framework abstractly before specializing to a particle discretization. As labels are generally unavailable for entropic state variables, we introduce a novel self-supervised learning strategy to identify emergent structural variables. We validate the method on benchmark systems and demonstrate its utility on two challenging examples: (1) coarse-graining star polymers at challenging levels of coarse-graining while preserving non-equilibrium statistics, and (2) learning models from high-speed video of colloidal suspensions that capture coupling between local rearrangement events and emergent stochastic dynamics. We provide open-source implementations in both PyTorch and LAMMPS, enabling large-scale inference and extensibility to diverse particle-based systems.

Computational Engineering, Finance, and Science (c↗

DOE OSTI2020

Improving climate model coupling through a complete mesh representation: a case study with E3SM (v1) and MOAB (v5.x)

One of the fundamental factors contributing to the spatiotemporal inaccuracy in climate modeling is the mapping of solution field data between different discretizations and numerical grids used in the coupled component models. The typical climate computational workflow involves evaluation and serialization of the remapping weights during the preprocessing step, which is then consumed by the coupled driver infrastructure during simulation to compute field projections. Tools like Earth System Modeling Framework (ESMF) and TempestRemap offer capability to generate conservative remapping weights, while the Model Coupling Toolkit (MCT) that is utilized in many production climate models exposes functionality to make use of the operators to solve the coupled problem. However, such multistep processes present several hurdles in terms of the scientific workflow and impede research productivity. In order to overcome these limitations, we present a fully integrated infrastructure based on the Mesh Oriented datABase (MOAB) library, which allows for a complete description of the numerical grids and solution data used in each submodel. Through a scalable advancing-front intersection algorithm, the supermesh of the source and target grids are computed, which is then used to assemble the high-order, conservative, and monotonicity-preserving remapping weights between discretization specifications. The Fortran-compatible interfaces in MOAB are utilized to directly link the submodels in the Energy Exascale Earth System Model (E3SM) to enable online remapping strategies in order to simplify the coupled workflow process. We demonstrate the superior computational efficiency of the remapping algorithms in comparison with other state-of-the-science tools and present strong scaling results on large-scale machines for computing remapping weights between the spectral element atmosphere and finite volume discretizations on the polygonal ocean grids.

58 GEOSCIENCES↗

DOE OSTI2024

CICE on a C-grid: new momentum, stress, and transport schemes for CICEv6.5

Abstract. This article presents the C-grid implementation of the CICE sea ice model, including the C-grid discretization of the momentum equation, the boundary conditions (BCs), and the modifications to the code required to use the incremental remapping transport scheme. To validate the new C-grid implementation, many numerical experiments were conducted and compared to the B-grid solutions. In idealized experiments, the standard advection method (incremental remapping with C-grid velocities interpolated to the cell corners) leads to a checkerboard pattern. A modal analysis demonstrates that this computational noise originates from the spatial averaging of C-grid velocities at corners. The checkerboard pattern can be eliminated by adjusting the departure regions to match the divergence obtained from the solution of the momentum equation. We refer to this novel approach as the edge flux adjustment (EFA) method. The C-grid discretization with edge flux adjustment allows for transport in channels that are one grid cell wide – a capability that is not possible with the B-grid discretization nor with the C-grid and standard remapping advection. Simulation results match the predicted values of a novel analytical solution for one-grid-cell-wide channels.

Lemieux, Jean-François (ORCID:0000000320845759)↗

DOE OSTI2023

A comparison of eight optimization methods applied to a wind farm layout optimization problem

Abstract. Selecting a wind farm layout optimization method is difficult. Comparisons between optimization methods in different papers can be uncertain due to the difficulty of exactly reproducing the objective function. Comparisons by just a few authors in one paper can be uncertain if the authors do not have experience using each algorithm. In this work we provide an algorithm comparison for a wind farm layout optimization case study between eight optimization methods applied, or directed, by researchers who developed those algorithms or who had other experience using them. We provided the objective function to each researcher to avoid ambiguity about relative performance due to a difference in objective function. While these comparisons are not perfect, we try to treat each algorithm more fairly by having researchers with experience using each algorithm apply each algorithm and by having a common objective function provided for analysis. The case study is from the International Energy Association (IEA) Wind Task 37, based on the Borssele III and IV wind farms with 81 turbines. Of particular interest in this case study is the presence of disconnected boundary regions and concave boundary features. The optimization methods studied represent a wide range of approaches, including gradient-free, gradient-based, and hybrid methods; discrete and continuous problem formulations; single-run and multi-start approaches; and mathematical and heuristic algorithms. We provide descriptions and references (where applicable) for each optimization method, as well as lists of pros and cons, to help readers determine an appropriate method for their use case. All the optimization methods perform similarly, with optimized wake loss values between 15.48 % and 15.70 % as compared to 17.28 % for the unoptimized provided layout. Each of the layouts found were different, but all layouts exhibited similar characteristics. Strong similarities across all the layouts include tightly packing wind turbines along the outer borders, loosely spacing turbines in the internal regions, and allocating similar numbers of turbines to each discrete boundary region. The best layout by annual energy production (AEP) was found using a new sequential allocation method, discrete exploration-based optimization (DEBO). Based on the results in this study, it appears that using an optimization algorithm can significantly improve wind farm performance, but there are many optimization methods that can perform well on the wind farm layout optimization problem, given that they are applied correctly.

17 WIND ENERGY↗

DOE OSTI2021

Method and system for in situ cross-linking of materials to produce three-dimensional features via electron beams from mobile accelerators

A method and system for in situ cross-linking of polymers, Bitumen, and other materials to produce arbitrary functional or ornamental three-dimensional features using electron beams provided by mobile accelerators comprises defining a desired pattern for imparting on a target area, mapping the target area, defining at least one discrete voxel in the target area according to the desired pattern to be imparted on the target area, assigning an irradiation value to each of the at least one discrete voxels, and delivering a dose of irradiation to each of the at least one discrete voxels according to the assigned irradiation value.

43 PARTICLE ACCELERATORS↗

DOE OSTI2021

Method and system for in situ cross-linking of materials to produce three-dimensional features via electron beams from mobile accelerators

Sauers, Aaron↗

DOE OSTI2023

Geiger-mode laser vibrometry methods and systems

Systems and methods for Geiger-mode laser vibrometry are described. An example method for laser vibrometry includes receiving a first time-series of single photon arrivals corresponding to a laser beam reflected from or transmitted through a target, the single photon arrivals including information corresponding to vibrations of the target, each single photon arrival separated in time from another single photon arrival, determining, based on two or more of the single photon arrivals, a discrete time sequence having a binary value, and generating a second time-series by assigning a non-binary value to each of the discrete time points, wherein each of the assigned non-binary values is determined based on a number of discrete time points lacking a photon arrival prior to receiving a photon.

Little, Liesl M.↗

DOE OSTI2022

Particle Swarm Optimisation for group structure optimization for radiotherapy shielding

Neutron transport simulations are ubiquitous in nuclear engineering because they allow one to model experimental systems and render a model platform for easy perturbation of experimental designs. In addition, simulations allow one to gain experimental insight without actually having to go through the trouble of building a physical experiment. Neutron transport simulations can be stochastic or deterministic based. Stochastic neutron transport simulations are typically simulated using the Monte Carlo method and yield very accurate solutions but are computationally expensive, while deterministic methods are typically faster but can be less accurate. Here we focus on optimizing the accuracy of deterministic neutron transport simulations for radiotherapy simulations. Deterministic neutron transport requires discretization of angle, energy, and space to appropriately analyze the system one is trying to model. Discretization of energy is challenging because of the highly variable neutron flux at certain neutron energies. Improper discretization of energy in the transport model can lead to erroneous results and therefore inaccurate interpretations of the solution. In this study, we evaluate Particle Swarm Optimization (PSO) as a mechanism for selecting optimal group structures for radiotherapy shielding. We tested the particle swarm optimization algorithm on radiotherapy shielding problems using Los Alamos National Laboratory's (LANL) main deterministic transport code PARTISN. Results show that the optimized energy group structures generated from the optimization algorithm outperformed LANL's standard energy group structures, and therefore demonstrate utility in using PSO to expedite computation times due to the increased accuracy obtained with a smaller but optimized group structure. (authors)

43 PARTICLE ACCELERATORS↗

DOE OSTI2024

NUMERICAL MODELING OF A SOLID OXIDE FUEL CELL FOR USE IN REAL-TIME SIMULATION AND CYBER-PHYSICAL SYSTEMS

Cyber-physical systems provide a mechanism with which to investigate the physical phenomena and behavior of traditionally cost-prohibitive or otherwise fragile equipment. For the National Energy Technology Laboratory (NETL), this approach resulted in the Hybrid Performance (Hyper) facility which features a gas turbine-SOFC hybrid cycle utilizing real turbomachinery and a simulated SOFC stack. This allows for the investigation of combined cycle performance and control strategies, in an exhaustive manner, both without fear of destroying delicate state-of-the-art fuel cells, and with the full accuracy of real-world turbomachinery. Issues arose between the transient response of the SOFC model being limited to a sample time of 80 milliseconds, due to the calculation time of the SOFC model taking on average 40 milliseconds to calculate for a given timestep with spikes in calculation time reaching the 80 millisecond threshold. In order to be able to match the speed of transients from the turbomachinery and likewise better discern transient behavior, it was determined that the SOFC model must be optimized to operate at a sample time of 5 milliseconds. Therefore, it is necessary to optimize the SOFC model in order to decrease the calculation time from around 40 milliseconds, down to at the most 5 milliseconds. To do this, both the electrochemical algorithm and the thermal algorithm used to simulate the physical behavior of the SOFC are investigated to determine where improvements can be made. To this end the rootfinding numerical recipes of the electrochemical algorithm are investigated as the complex electrochemistry requires a highly iterative nested dual convergence loop to resolve the voltage-current relationship, and likewise the temporal discretization of the thermal algorithm is modified for the sake of higher accuracy and stability. Ultimately the new electrochemical algorithm featuring higher order rootfinding schemes proves to be efficient enough to reach the sub 5 millisecond target, signifying an order of magnitude reduction in calculation time, and when coupled with the new temporal discretization similar calculation time characteristics show that a fully implicit, higher order temporal discretization can also successfully be used if desired. Ultimately this result means that the cyber-physical simulation system can operate at higher sample rates, and resolve transient events at significantly higher resolution and fidelity.

Arias, Jesus↗

DOE OSTI2024

Infrastructure-scale additive manufacturing using mobile electron accelerators

Sauers, Aaron↗

DOE OSTI2025

A simple introduction to the SiMPL method for density-based topology optimization

We introduce a novel method for solving density-based topology optimization problems: Sigmoidal Mirror descent with a Projected Latent variable (SiMPL). The SiMPL method (pronounced as “the simple method”) optimizes a design using only first-order derivative information of the objective function. The bound constraints on the density field are enforced with the help of the (negative) Fermi–Dirac entropy, which is also used to define a non-symmetric distance function called a Bregman divergence on the set of admissible designs. This Bregman divergence leads to a simple update rule that is further simplified with the help of a so-called latent variable. Because the SiMPL method involves discretizing the latent variable, it produces a sequence of pointwise-feasible iterates, even when high-order finite elements are used in the discretization. Numerical experiments demonstrate that the method outperforms other popular first-order optimization algorithms. In conclusion, to outline the general applicability of the technique, we include examples with (self-load) compliance minimization and compliant mechanism optimization problems.

Calculus of Variations and Optimization↗

DOE OSTI2026

Enhancing photoionization rate calculations in low-temperature plasmas using spectral methods

Photoionization plays a central role in the development of streamer discharges and other non-equilibrium plasma phenomena. It creates seed electrons, which are essential for positive streamer propagation, allowing the ionization front to move forward. Because of this, accurate modeling of photoionization is very important for predicting streamer behavior and plasma evolution. The photoionization process in air (N 2 – O 2 mixture) is often described by the Zheleznyak model (1982). This model is usually solved through Helmholtz-type equations that approximate the Zheleznyak photoionization model (Zheleznyak et al. 1982) as Partial Differential Equations (PDEs). Conventional numerical methods, such as the Finite Difference Method (FDM) or Finite Volume Method (FVM), are widely used to solve these equations. Although they are prevalent, the computational cost of these methods due to their need for matrix operations and iterative solver is demanding. To address this challenge, this work develops a spectral solver based on the Fast Fourier Transform (FFT) combined with Discrete Cosine Transform (DCT) and Discrete Sine Transform (DST) to calculate the photoionization rate efficiently in an axisymmetric cylindrical domain. This method naturally satisfies the boundary conditions used in the model and converts the PDE into algebraic ones in spectral space. Thus, avoids the need for iterative matrix solvers. When compared with FDM results, it is demonstrated that the new solver not only maintains accuracy, but also reduces the computational cost, showing a performance increase of approximately 100 compared to FDM over a wide range of problem sizes. The method is parallelized using Message Passing Interface (MPI) and has been integrated into a fluid plasma model for streamer simulation. Here, this FFT-based approach provides a fast and reliable alternative for calculating photoionization in fluid models, helping large-scale plasma simulations run faster and efficiently, and allows higher-resolution simulation without extra computational cost.

Axisymmetric system↗

DOE OSTI2022

Route Optimization for Energy Efficient Airport Shuttle Operations - A Case Study from Dallas Fort Worth International Airport

Air travel and requisite surface traffic supporting passenger arrival/departure constitutes a significant portion of travel and emissions in cities with large airports. An airport trip can segment into three parts namely: i) travel from a location in the city to the airport; ii) travel from a parking lot or rental car center to the terminal (i.e., within the airport premises), and iii) travel inside the terminal. Depending on the airport access mode all or a part of these legs comprise a traveler’s journey to the airport. The priority of airport ground transport management teams is to provide passengers with a seamless travel experience within the airport, so it is understandable that within airport shuttle routes might not be optimized for minimizing energy consumption. Solutions that meet the dual objective of reducing energy consumption from airport shuttle operations without compromising on passenger travel experience are key to improving system efficiency. There is currently a dearth of research and tools that can inform airports in making such decisions. Addressing this need, this research effort puts forth an optimization model that generates optimal shuttle routes for a given set of constraints, and a discrete-event simulator that evaluates the optimal solutions in a stochastic environment to understand the tradeoffs between passenger wait times, and within airport shuttle energy consumption. The proposed set of tools are tested in the context of optimizing airport shuttles routes within the Dallas Fort Worth International Airport (DFW). In addition to shuttle spatial positioning, and passenger demand information, high-fidelity vehicle data was collected using data loggers installed on DFW shuttles. Results show that 20% energy reduction in shuttle operations is possible with a modest two-minute increase in average passenger wait times. The tools developed in this research effort are designed to be generalizable and can help optimize shuttle operations planning at any major airport.

air travel↗

DOE OSTI2020

Scalability of high-performance PDE solvers

Performance tests and analyses are critical to effective high-performance computing software development and are central components in the design and implementation of computational algorithms for achieving faster simulations on existing and future computing architectures for large-scale application problems. In this article, we explore performance and space-time trade-offs for important compute-intensive kernels of large-scale numerical solvers for partial differential equations (PDEs) that govern a wide range of physical applications. We consider a sequence of PDE-motivated bake-off problems designed to establish best practices for efficient high-order simulations across a variety of codes and platforms. We measure peak performance (degrees of freedom per second) on a fixed number of nodes and identify effective code optimization strategies for each architecture. In addition to peak performance, we identify the minimum time to solution at 80% parallel efficiency. The performance analysis is based on spectral and p-type finite elements but is equally applicable to a broad spectrum of numerical PDE discretizations, including finite difference, finite volume, and h-type finite elements.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2021

Exact-WKB, complete resurgent structure, and mixed anomaly in quantum mechanics on S 1

We investigate the exact-WKB analysis for quantum mechanics in a periodic potential, with N minima on S 1 . We describe the Stokes graphs of a general potential problem as a network of Airy-type or degenerate Weber-type building blocks, and provide a dictionary between the two. The two formulations are equivalent, but with their own pros and cons. Exact-WKB produces the quantization condition consistent with the known conjectures and mixed anomaly. The quantization condition for the case of N-minima on the circle factorizes over the Hilbert sub-spaces labeled by discrete theta angle (or Bloch momenta), and is consistent with ’t Hooft anomaly for even N and global inconsistency for odd N. By using Delabaere-Dillinger-Pham formula, we prove that the resurgent structure is closed in these Hilbert subspaces, built on discrete theta vacua, and by a transformation, this implies that fixed topological sectors (columns of resurgence triangle) are also closed under resurgence.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

DOE OSTI2021

TwInflation

The general structure of Hybrid Inflation remains a very well-motivated mechanism for lower-scale cosmic inflation in the face of improving constraints on the tensor-to-scalar ratio. However, as originally modeled, the “waterfall” field in this mechanism gives rise to a hierarchy problem (η–problem) for the inflaton after demanding standard effective field theory (EFT) control. We modify the hybrid mechanism and incorporate a discrete “twin” symmetry, thereby yielding a viable, natural and EFT-controlled model of non-supersymmetric low-scale inflation, “Twinflation”. Analogously to Twin Higgs models, the discrete exchange-symmetry with a “twin” sector reduces quadratic sensitivity in the inflationary potential to ultra-violet physics, at the root of the hierarchy problem. The observed phase of inflation takes place on a hilltop-like potential but without fine-tuning of the initial inflaton position in field-space. We also show that all parameters of the model can take natural values, below any associated EFT-cutoff mass scales and field values, thus ensuring straightforward theoretical control. We discuss the basic phenomenological considerations and constraints, as well as possible future directions.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗