Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Algorithms”

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

A positivity-preserving and conservative intersection-distribution-based remapping algorithm for staggered ALE hydrodynamics on arbitrary meshes

In this study, we introduce new intersection-distribution-based remapping tools for indirect staggered arbitrary Lagrangian-Eulerian (ALE) simulations of multi-material shock hydrodynamics on arbitrary meshes. In addition to conserving momentum and total energy, the three-stage remapper proposed in this work preserves non-negativity of the internal energy. At the first stage, we construct slope-limited piecewise-linear reconstructions of all conserved quantities on zones of the source mesh and perform intersection-based remap to obtain bound-preserving zonal quantities on the target mesh. At the second stage, we define bound-preserving nodal quantities of the staggered ALE discretization as convex combinations of corner quantities. The nodal internal energy is corrected in a way which keeps it non-negative, while providing exact conservation of total energy. At the final stage, we distribute the non-negative nodal internal energy to corners, zones and materials using non-negative weights. Proofs of positivity preservation are provided for each stage. This work is a natural extension of our paper [14] in which a similar intersection-distribution-based remapping procedure was employed. The original version used a nodal kinetic energy fix which did not provably ensure positivity preservation for the zonal internal energy after the final distribution stage. The new algorithm cures this potential drawback by using ‘coordinated’ limiters for piecewise-linear reconstructions, remapping the internal energy to nodes and correcting it before redistribution. The effectiveness of the new nodal fix is illustrated by numerical examples.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

On numerical energy conservation for an implicit particle-in-cell method coupled with a binary Monte-Carlo algorithm for Coulomb collisions

We report conventional particle-in-cell (PIC) methods suffer from enhanced numerical heating (explicit PIC) or cooling (semi-implicit PIC) when coupled with a binary Monte-Carlo algorithm for Coulomb collisions. In this work, a fully-implicit θ-PIC scheme (with adjustable time-biasing parameter 1/2 ≤ θ ≤) is considered. The discrete change in energy of a closed system after a time step for this scheme scales with (1/2 - θ)C θ , where C θ is a positive definite quantity that depends on the frequency spectrum of the energy in the fields. Collisions lead to additional energy in the field fluctuations associated with high-frequency light waves produced by a numerical Bremsstrahlung process, which can result in a large increase in the numerical cooling rate for θ > 1/2. However, for θ = 1/2, energy is exactly conserved. The energy in the field fluctuations on long time scales agrees with that calculated using the equipartition theorem for a classical system in thermodynamic equilibrium.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2023

Compression of tokamak boundary plasma simulation data using a maximum volume algorithm for matrix skeleton decomposition

This report demonstrates satisfactory data compression of SOLPS-ITER simulation output ranging from 2D fields, 1D profiles, and 0D scalar variables with a novel matrix decomposition approach. The singular value decomposition (SVD) scales poorly for large matrix sizes and is unsuited to the application on high dimensional data common to fusion plasma physics simulation. In this work, we employ the columns-submatrix-rows (CUR) matrix factorization technique in order to compute a low-rank approximation up to two orders of magnitude faster than the SVD, but within a nominal L2-norm relative error of ε = 10 –2 . In addition, the CUR approach maintains the original format of the data, in its extracted columns and rows, allowing for interpretable data storage at the original resolution of the simulation. We utilize an iterative algorithm to compute the CUR decomposition of simulation output by maximizing the volume, or linearly independent information content, of a low-rank submatrix contained within the data. Experiments over $\textit{n} × \textit{n}$ randomized test matrices with embedded rank-deficient features show that this maximum volume implementation of CUR matrix approximation has reduced asymptotic computational complexity on the order of n compared to the SVD, which scales approximately as $n^3$. These results show that the CUR technique can be used to effectively select time step snapshots (columns) of over 140 SOLPS-ITER output variables and the associated discretized coordinate timeseries (rows) allowing for reconstruction of the complete simulation dynamics.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2024

An asymptotic-preserving semi-Lagrangian algorithm for the anisotropic heat transport equation with arbitrary magnetic fields

Here, we extend the recently proposed semi-Lagrangian algorithm for the extremely anisotropic heat transport equation [Chacón et al., J. Comput. Phys ., 272 (2014)] to deal with arbitrary magnetic field topologies. The original scheme (which showed remarkable numerical properties) was valid for the so-called tokamak-ordering regime, in which the magnetic field magnitude was not allowed to vary much along field lines. The proposed extension maintains the attractive features of the original scheme (including the analytical Green's function, which is critical for tractability) with minor modifications, while allowing for completely general magnetic fields. The accuracy and generality of the approach are demonstrated by numerical experiment with an analytical manufactured solution.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2025

Implementation of a Mesh refinement algorithm into the quasi-static PIC code QuickPIC

Plasma-based acceleration (PBA) has emerged as a promising candidate for the accelerator technology used to build a future linear collider and/or an advanced light source. In PBA, a trailing or witness particle beam is accelerated in the plasma wave wakefield (WF) created by a laser or particle beam driver. The WF is often nonlinear and involves the crossing of plasma particle trajectories in real space and thus particle-in-cell methods are used. The distance over which the drive beam evolves is several orders of magnitude larger than the wake wavelength. This large disparity in length scales is amenable to the quasi-static approach. Three-dimensional (3D), quasi-static (QS), particle-in-cell (PIC) codes, e.g., QuickPIC, have been shown to provide high fidelity simulation capability with 2-4 orders of magnitude speedup over 3D fully explicit PIC codes. In PBA, the witness beam needs to be matched to the focusing forces of the WF to reduce the emittance growth. In some linear collider designs, the matched spot size of the witness beam can be 2 to 3 orders of magnitude smaller than the spot size (and wavelength) of the wakefield. Such an additional disparity in length scales is ideal for mesh refinement where the WF within the witness beam is described on a finer mesh than the rest of the WF. A mesh refinement scheme is described that has been implemented into the 3D QS PIC code, QuickPIC. Very fine (high) resolution is used in a small spatial region that includes the witness beam and progressively coarser resolutions in the rest of the simulation domain. A fast multigrid Poisson solver has been implemented for the field solve on the refined meshes and a Fast Fourier Transform (FFT) based Poisson solver is used for the coarse mesh. The code has been parallelized with both MPI and OpenMP, and the parallel scalability has also been improved by using pipelining. A preliminary adaptive mesh refinement technique is described to optimize the computational time for simulations with an evolving witness beam size. Several test problems are used to verify that the mesh refinement algorithm provides accurate results. Additionally, the results are benchmarked against highly resolved simulations exhibiting near-azimuthal symmetry, performed using QPAD—a novel hybrid QS PIC code that uses a PIC description in the coordinates (r, ct – z) and a gridless description in the azimuthal angle, Φ.

Linear collider↗
DOE OSTI2026

A cell-centered AMR-ALE framework for 3D multi-material hydrodynamics. Part I: Lagrangian and indirect Euler AMR algorithms

Many applications of physics and engineering involve wide ranges of time and spatial scales. The numerical simulation of localized small scales such as shock waves and material interfaces requires a large number of computational cells in these regions. For these applications, Lagrangian and Arbitrary-Lagrangian-Eulerian (ALE) related methods are engaging since the moving mesh feature naturally brings mesh cells on shock discontinuities and material interfaces are carefully captured. In addition, Adaptive-Mesh-Refinement (AMR) strategies aim to optimize computational resources by concentrating finer mesh cells only in areas of interest while using coarser cells elsewhere. A key but challenging AMR requirement consists in efficiently distributing the computational effort to achieve high accuracy without the prohibitive computational costs associated with uniformly fine grids. Here, in this document, the coupling of the p4est AMR library with a cell-centered Lagrangian scheme is presented with the goal to perform reliable 3D Lagrangian-AMR and indirect Euler-AMR multi-material simulations. In particular, it is shown that starting from a 3D indirect ALE code, the memory management and load balancing requirements can be delegated to an external library (here the p4est library) to unlock ALE-AMR capabilities. First, we present a strategy to transcribe the octant-based connectivity of the 3D AMR framework with that of an unstructured mesh of polygonal cells used in Lagrangian hydrodynamics. Then, we show how refinement and coarsening operations must be adapted to the particular Lagrangian framework to ensure the conservation of volume during those steps. Finally, several numerical test cases are presented that demonstrate the capabilities of the Lagrangian-AMR and indirect Euler-AMR algorithms.

3D cell-centered Lagrangian numerical scheme↗
DOE OSTI2026

A conservative discontinuous Galerkin algorithm for particle kinetics on smooth manifolds

A novel, conservative discontinuous Galerkin algorithm is presented for particle kinetics on manifolds. The motion of particles on the manifold is represented using both canonical and non-canonical Hamiltonian formulations. Our schemes apply to both formulations, but the canonical formulation results in a particularly efficient scheme that also conserves particle density and energy exactly. The collisionless update is coupled to a Bhatnagar-Gross-Krook (BGK) collision operator that provides a simplified model for relaxation to local thermodynamic equilibrium. An iterative scheme is constructed to ensure collisional invariants (density, momentum and energy) are preserved numerically. Rotation of the manifold is incorporated by modifying the Hamiltonian while ensuring a canonical formulation. Several test problems, including a kinetic version of the classical Sod shock problem, Kelvin-Helmholtz instability on the surfaces of a sphere and a hyperboloid, with and without rotations, are presented. A prospectus for further development of this approach to simulation of kinetic theory in general relativity is presented.

Discontinuous Galerkin↗
DOE OSTI2023

Development of window scheduler algorithm exploiting natural ventilation and thermal mass for building energy simulation and smart home controls

Building energy simulations often rely on abstract assumptions when it comes to natural ventilation, such as ‘windows always open [or closed]’ or ‘windows open when outdoor temperature is below a certain threshold.’ However, simulations based on these assumptions fail to fully exploit the cooling potential of natural ventilation, as its effectiveness can be enhanced or diminished by various factors, including the presence of thermal mass. This issue also extends to smart home controls, where determining the window schedule becomes challenging without information about the building's response to outdoor conditions. To address these issues, this study has developed an analytical model for window operation schedules that leverages the passive cooling from natural ventilation. The analytical model was validated against a Modelica simulation. A case study utilizing the BESTEST model of ANSI/ASHRAE Standard 140 underwent validation with EnergyPlus simulations, showing strong concordance. The algorithm provides window schedule recommendations adapted to various airflow rates, thermal masses, and climate variations. Notably, the case study demonstrated that proper window scheduling could reduce indoor temperature by up to 8 °C under the given simulation settings, thereby improving resilience and indicating potential energy savings. Furthermore, the paper explores the potential opportunities and challenges this approach presents, especially for building simulation and smart home applications.

42 ENGINEERING↗
DOE OSTI2022

Dynamic machine learning-based optimization algorithm to improve boiler efficiency

With decreasing computational costs, improvement in algorithms, and the aggregation of large industrial and commercial datasets, machine learning is becoming a ubiquitous tool for process and business innovations. Machine learning is still lacking applications in the field of dynamic optimization for real-time control. This work presents a novel framework for performing constrained dynamic optimization using a recurrent neural network model combined with a metaheuristic optimizer. The framework is designed to augment an existing control system and is purely data-driven, like most industrial Model Predictive Control applications. Several recurrent neural network models are compared as well as several metaheuristic optimizers. Hyperparameters and optimizer parameters are tuned with parameter sweeps, and the resulting values are reported. Further, the best parameters for each optimizer and model combination are demonstrated in closed-loop control of a dynamic simulation, and several recommendations are made for generalizing this framework to other systems. Up to 0.953% improvement is realized over the non-optimized case for a simulated coal-fired boiler. While this is not a large improvement in percentage, the total economic impact is $991,000 per year, and this study builds a foundation for future machine learning with dynamic optimization.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗
DOE OSTI2025

Emulation of radiation transport in 3D stochastic media using 1D planar Monte Carlo stochastic media radiation transport algorithms

A subset of stochastic media radiation transport problems involves those in which radiation is incident on a thin slab of stochastic material. Particle tracking in 3D for such problems is expensive, and 1D planar models lack accuracy because they only allow the material to change in one dimension. Therefore, we propose dimensional emulation, which through a slight modification allows existing 1D planar geometry stochastic media radiation transport models to reproduce results from the equivalent 3D models by allowing the material to change in all three dimensions, reproducing the fidelity of the 3D model for the low computational cost of the 1D planar model. In this work, we apply dimensional emulation to three Monte Carlo stochastic media radiation transport models: Chord Length Sampling (CLS), the Local Realization Preserving method (LRP), and a variant of Conditional Point Sampling (CoPS). For a common Markovian benchmark set, the 3D emulation variants of these algorithms are numerically verified to reproduce the results of the 3D variants within statistics while running 1.3 to 2 times faster in the implementation within Sandia National Laboratories open-source research code PlaybookMC. The 3D emulation variants are also shown to yield a 72%–92% reduction in error for the thin slab problems in comparison to the 1D benchmark. As a result, the 3D emulation variant of CLS and CoPS-1 are shown to reproduce 3D CLS results that were used to approximate results for a 3D spherical inclusion geometry benchmark set.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2025

Prediction of electric and magnetic fields from spectral data using machine learning algorithms for Doppler-free saturation spectroscopy diagnostics

The prediction of electric and magnetic field amplitudes from atomic spectral data is critical for plasma control in fusion devices such as tokamaks. Conventional approaches that rely on physics-based models are computationally expensive and unsuitable for real-time applications. In this work, we develop and benchmark three machine learning algorithms—simulation-based inference (SBI), fully connected neural networks (FCNN), and histogram-based gradient boosting regression (GBR-Hist)—to infer field intensities directly from Doppler-free saturation spectroscopy (DFSS) spectra. Synthetic datasets of spectra were generated using the EZSSS code and evaluated both with and without added Poisson noise to mimic experimental conditions. We find that SBI achieves the highest accuracy and robustness, FCNN provides a strong balance of accuracy and computational efficiency for real-time applications, and GBR-Hist offers the fastest inference but is more sensitive to noise. Furthermore, these results demonstrate the potential of machine learning to accelerate DFSS analysis and enhance its utility for plasma diagnostics and control.

Doppler-free saturation spectroscopy↗
DOE OSTI2024

A safe reinforcement learning algorithm for supervisory control of power plants

Traditional control theory-based methods require tailored engineering for each system and constant fine-tuning. In power plant control, one often needs to obtain a precise representation of the system dynamics and carefully design the control scheme accordingly. Model-free Reinforcement learning (RL) has emerged as a promising solution for control tasks due to its ability to learn from trial-and-error interactions with the environment. It eliminates the need for explicitly modeling the environment’s dynamics, which is potentially inaccurate. However, the direct imposition of state constraints in power plant control raises challenges for standard RL methods. To address this, we propose a chance-constrained RL algorithm based on Proximal Policy Optimization for supervisory control. Our method employs Lagrangian relaxation to convert the constrained optimization problem into an unconstrained objective, where trainable Lagrange multipliers enforce the state constraints. In conclusion, our approach achieves the smallest distance of violation and violation rate in a load-follow maneuver for an advanced Nuclear Power Plant design.

constrained optimization↗
DOE OSTI2026

Numerical implementation of the MOOSE subchannel module (SCM) algorithm

The subchannel module of moose (SCM), previously referred to as Pronghorn-SC, is a subchannel code designed to resolve single-phase flow fields and calculate the relevant flow variables, in nuclear reactor fuel-pin assemblies. The assemblies it models are: water-cooled, with bare fuel-pins in a square ducted, quadrilateral lattice and liquid-metal/water-cooled, with bare/wire-wrapped fuel pins in a hexagonal ducted, triangular lattice. Previous publications have presented the development, validation and verification of SCM. This work presents an comparative overview of the different solvers implemented within SCM. This includes the solver algorithm description, and a performance comparison. The two test cases chosen to demonstrate the solver performance were taken from the PSBT enthalpy mixing benchmark and the ORNL-19 pin benchmark.

22 - GENERAL STUDIES OF NUCLEAR REACTORS↗
DOE OSTI2021

GPU algorithms for Efficient Exascale Discretizations

In this paper we describe the research and development activities in the Center for Efficient Exascale Discretization within the US Exascale Computing Project, targeting state-of-the-art high-order finite-element algorithms for high-order applications on GPU-accelerated platforms. Furthermore, we discuss the GPU developments in several components of the CEED software stack, including the libCEED, MAGMA, MFEM, libParanumal, and Nek projects. We report performance and capability improvements in several CEED-enabled applications on both NVIDIA and AMD GPU systems.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

A coupled polygonal DEM-LBM technique based on an immersed boundary method and energy-conserving contact algorithm

Here we present a framework of coupling polygonal discrete elements and the lattice Boltzmann method using a direct forcing immersed boundary scheme. In this technique, an energy-conserving contact algorithm is utilized to handle the interactions between convex and concave polygonal particles. The surface of a polygon is represented by discrete boundary points which includes vertices of polygonal particles and/or points interpolated from vertices. The fluid-particle coupling is obtained through the interactions of the boundary points and the imaginary fluid particles using a direct-forcing immersed boundary method. Validations of the proposed technique are made by single particle and multiple arbitrarily-shaped particle sedimentation tests, and the effect of particle shape is illustrated using a drafting-kissing-tumbling benchmark.

42 ENGINEERING↗
DOE OSTI2020

A new framework to map fine resolution cropping intensity across the globe: Algorithm, validation, and implication

We report accurate estimation of cropping intensity (CI), an indicator of food production, is well aligned with the ongoing efforts to achieve sustainable development goals (SDGs) under diminishing natural resources. The advancement in satellite remote sensing provides unprecedented opportunities for capturing CI information in a spatially continuous manner. However, challenges remain due to the lack of generalizable algorithms for accurately and efficiently mapping global CI with a fine spatial resolution. In this study, we developed a 30-m planetary-scale CI mapping framework with the reconstructed time series of Normalized Difference Vegetation Index (NDVI) from multiple satellite images. Using a binary crop phenophase profile indicating growing and non-growing periods, we estimated pixel-by-pixel CI by enumerating the total number of valid cropping cycles during the study years. Based on the Google Earth Engine cloud computing platform, we implemented the framework to estimate CI during 2016–2018 in eight geographic regions across continents that are representative of global cropping system diversity. Comparison with PhenoCam network data in four cropland sites suggests that the proposed framework is capable of capturing the seasonal dynamics of cropping practices. Spatially, overall accuracies based on validation samples range from 80.0% to 98.9% across different regions worldwide. Regarding the CI classes, single cropping systems are associated with more robust and less biased estimations than multiple cropping systems. Finally, our CI estimates reveal high agreement with two widely used land surface phenology products, including Vegetation Index and Phenology V004 (VIP4) and Moderate Resolution Imaging Spectroradiometer Land Cover Dynamics (MCD12Q2), meanwhile providing much more spatial details. Due to its robustness, the developed CI framework can be potentially generalized to produce global fine resolution CI products for food security and other applications.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2023

Generating high-resolution total canopy SIF emission from TROPOMI data: Algorithm and application

Solar-induced chlorophyll fluorescence (SIF) is a rapidly advancing front in modeling global terrestrial gross primary production (GPP). Canopy total SIF emissions (SIF total ) are mechanistically linked to the plant photosynthesis, and can be estimated from satellite observed SIF (SIF obs ) through radiative transfer modeling. However, the current satellite SIF obs and thus SIF total are available only at coarse spatial resolutions from several kilometers to tens of kilometers, inhibiting the application at fine spatial scales. Here, in this work, we proposed an algorithm to generate both global high-resolution SIF total (HSIF total ) and high-resolution SIF obs (HSIF obs ) at 1 km from low-resolution SIF obs (LSIF obs ) from the TROPOspheric Monitoring Instrument (TROPOMI), which has a spatial resolution at nadir of 3.5 km by 5.6–7 km. Our statistical method is based on the law of energy conservation and uses satellite derived fraction of absorbed photosynthetically active radiation, fluorescence efficiency, and the escape probability of fluorescence. We evaluated the accuracy of our HSIF total using the Orbiting Carbon Observatory-2 SIF (R 2 = 0.78). We found that the spatial resolution had clear effects on the relationship between HSIF total and GPP. We also compared HSIF total to 8-day averaged tower GPP from 135 flux sites and found that they were better correlated when HSIF total was averaged over a 1-km radius around the tower than when averaged over a larger radius. Our study provided a unique high-resolution HSIF total product, which will advance the estimation of GPP by extrapolating site-level relationships to the global scale.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2022

Improving convergence of the Matrix Power Control Algorithm for random vibration testing

Herein, this paper describes modifications to the Matrix Power Control Algorithm (MPCA) to improve convergence for Random Vibration Control (RVC) testing. In particular, this paper presents Multiple-Input Multiple-Output (MIMO) implementations of MPCA in simulation and experiment. An Euler–Bernoulli beam model was simulated with applied base excitations and the Box Assembly with Removable Component (BARC) was used in experiment to validate results. The Bayesian optimization package Dragonfly was used to optimize control parameters. Additionally, a moving-average was employed and optimized to improve the measured response feedback for MPCA, reduce the number of averages needed to be taken between control updates, and further improve convergence. The key results of this paper show that the performance of MPCA can be improved by tuning the control parameters and by applying an optimized moving-average. Furthermore, it is demonstrated that convergence can be achieved within 12 drive-frames, which greatly enhances vibration control capability.

42 ENGINEERING↗