Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “numerical 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 667 records · Page 37
All sourcesNASA NTRSDOE OSTI
DOE OSTI2020

Single-frame far-field diffractive imaging with randomized illumination

We introduce a single-frame diffractive imaging method called randomized probe imaging (RPI). In RPI, a sample is illuminated by a structured probe field containing speckles smaller than the sample’s typical feature size. Quantitative amplitude and phase images are then reconstructed from the resulting far-field diffraction pattern. The experimental geometry of RPI is straightforward to implement, requires no near-field optics, and is applicable to extended samples. When the resulting data are analyzed with a complimentary algorithm, reliable reconstructions which are robust to missing data are achieved. To realize these benefits, a resolution limit associated with the numerical aperture of the probe-forming optics is imposed. RPI therefore offers an attractive modality for quantitative X-ray phase imaging when temporal resolution and reliability are critical but spatial resolution in the tens of nanometers is sufficient. We discuss the method, introduce a reconstruction algorithm, and present two proof-of-concept experiments: one using visible light, and one using soft X-rays.

77 NANOSCIENCE AND NANOTECHNOLOGY↗
DOE OSTI2022

Practical jet flavour through NNLO

Abstract An infrared and collinear (IRC) safe definition of the partonic flavour of a jet is vital for precision predictions of quantum chromodynamics at colliders. Jet flavour definitions have been presented in the literature, but they are typically defined through modification of the jet algorithm to be sensitive to partonic flavour at every stage of the clustering. While this does ensure that the sum of flavours in a jet is IRC safe, a flavour-sensitive clustering procedure is difficult to apply to realistic data. We introduce a distinct and novel approach to jet flavour that can be applied to a collection of partons defined by any algorithm. Our definition of jet flavour is the sum of flavours of all partons that remain after Soft Drop grooming, reclustered with the "Image missing" <#comment/> algorithm. We prove that this prescription is IRC safe through next-to-next-to-leading order (NNLO), and so can interface with the most precise fixed-order calculations for jets available at present. We validate the IRC safety of this definition with numeric fixed-order codes and further show that jet flavour with Soft Drop reclustered with a generalised $$k_T$$ k T algorithm fails to be IRC safe at NNLO.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2026

FIRM: federated image reconstruction using multimodal tomographic data

Here, we propose a federated algorithm for reconstructing images using multimodal tomographic data sourced from dispersed locations, addressing the challenges of traditional unimodal approaches that are prone to noise and reduced image quality, as well as the limitations of centralized multimodal approaches that require extensive data transfer, leading to significant communication overhead, storage demands, and potential data privacy concerns. Our approach formulates a joint inverse optimization problem incorporating multimodality constraints and solves it in a federated framework through local gradient computations complemented by lightweight central operations, thereby ensuring data decentralization. Leveraging the connection between our federated algorithm and the quadratic penalty method, we introduce an adaptive step-size rule with guaranteed sublinear convergence. Numerical results demonstrate superior computational efficiency and improved image reconstruction quality compared to existing approaches.

federated algorithm↗
DOE OSTI2024

Online randomized interpolative decomposition with a posteriori error estimator for temporal PDE data reduction

Traditional low-rank approximation is a powerful tool for compressing large data matrices that arise in simulations of partial differential equations (PDEs), but suffers from high computational cost and requires several passes over the PDE data. The compressed data may also lack interpretability thus making it difficult to identify feature patterns from the original data. Here, to address these issues, we present an online randomized algorithm to compute the interpolative decomposition (ID) of large-scale data matrices in situ. Compared to previous randomized IDs that used the QR decomposition to determine the column basis, we adopt a streaming ridge leverage score-based column subset selection algorithm that dynamically selects proper basis columns from the data and thus avoids an extra pass over the data to compute the coefficient matrix of the ID. In particular, we adopt a single-pass error estimator based on the non-adaptive Hutch++ algorithm to provide real-time error approximation for determining the best coefficients. As a result, our approach only needs a single pass over the original data and thus is suitable for large and high-dimensional matrices stored outside of core memory or generated in PDE simulations. A strategy to improve the accuracy of the reconstructed data gradient, when desired, within the ID framework is also presented. We provide numerical experiments on turbulent channel flow and ignition simulations, and on the NSTX Gas Puff Image dataset, comparing our algorithm with the offline ID algorithm to demonstrate its utility in real-world applications.

Column subset selection↗
DOE OSTI2021

Decentralized Failure-Tolerant Optimization of Electric Vehicle Charging

We present a decentralized failure-tolerant algorithm for optimizing electric vehicle (EV) charging, using charging stations as computing agents. The algorithm is based on the alternating direction method of multipliers (ADMM) and it has the following features: (i) It handles capacity, peak demand, and ancillary services coupling constraints. (ii) It does not require a central agent collecting information and performing coordination (e.g. an aggregator), instead all agents exchange information and computations are carried out in a fully decentralized fashion. (iii) It can withstand the failure of any number of computing agents, as long as the remaining computing agents are in a connected communications network. We construct this algorithm by reformulating the optimal EV charging problem in a decomposable form, amenable to ADMM, and then developing efficient decentralized solution methods for the subproblems dealing with coupling constraints. We conduct numerical experiments on industry-scale synthetic EV charging datasets, with up to 1,152 charging stations, using a high performance computing cluster. The experiments demonstrate that the proposed algorithm can solve the optimal EV charging problem fast enough to permit the integration of EV charging with real-time electricity markets, even in the presence of failures.

42 ENGINEERING↗
DOE OSTI2024

An integrated EOS, pore‐crush, strength and damage model framework for near‐field ground‐shock

Abstract An integrated Equation of State (EOS) and strength/pore‐crush/damage model framework is provided for modeling near to source (near‐field) ground‐shock response, where large deformations and pressures necessitate coupling EOS with pressure‐dependent plastic yield and damage. Nonlinear pressure‐dependence of strength up to high‐pressures is combined with a Modified Cam‐Clay‐like cap‐plasticity model in a way to allow degradation of strength from pore‐crush damage, what we call the “Yp‐Cap” model. Nonlinear hardening under compaction allows modeling the crush‐out of pores in combination with a fully saturated EOS, that is, for modeling partially saturated ground‐shock response, where air‐filled voids crush. Attention is given to algorithmic clarity and efficiency of the provided model, and the model is employed in example numerical simulations, including finite element simulations of underground explosions to exemplify its robustness and utility.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2024

Weighted Composition Operators for Learning Nonlinear Dynamics

Operator theoretic methods in dynamical system have been dominated by the use of Koopman operators and their continuous time counterparts, such as Koopman Generators and Liouville Operators. The advantage gained from their use primarily stems from the ability to extract subspaces and eigenfunctions within a space of observables that are invariant with respect to the Koopman operator over that space. When this occurs, a dynamic mode decomposition of the systems state provides a linear model for the dynamical system. Not all Koopman operators have eigenfunctions that may be exploited in this manner. However, the framework can still be leveraged for approximations using other operators. In this setting, we present a different operator for the study of dynamical systems, the weighted composition operator. These operators are compact for a wide range of dynamics and spaces, and through their interactions with occupation kernels and vector valued kernels, they admit an estimation of the underlying dynamics. Here, this manuscript presents a new algorithm for the data driven study of dynamical systems from data, and also provides two numerical experiments where convergence is achieved as a proof of concept.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Bayesian sparse learning with preconditioned stochastic gradient MCMC and its applications

Deep neural networks have been successfully employed in an extensive variety of research areas, including solving partial differential equations. Despite its significant success, there are some challenges in effectively training DNN, such as avoiding overfitting in over-parameterized DNNs and accelerating the optimization in DNNs with pathological curvature. Here, we propose a Bayesian type sparse deep learning algorithm. The algorithm utilizes a set of spike-and-slab priors for the parameters in the deep neural network. The hierarchical Bayesian mixture will be trained using an adaptive empirical method. That is, one will alternatively sample from the posterior using preconditioned stochastic gradient Langevin Dynamics (PSGLD), and optimize the latent variables via stochastic approximation. The sparsity of the network is achieved while optimizing the hyperparameters with adaptive searching and penalizing. A popular SG-MCMC approach is Stochastic gradient Langevin dynamics (SGLD). However, considering the complex geometry in the model parameter space in nonconvex learning, updating parameters using a universal step size in each component as in SGLD may cause slow mixing. To address this issue, we apply a computationally manageable preconditioner in the updating rule, which provides a step-size parameter to adapt to local geometric properties. Moreover, by smoothly optimizing the hyperparameter in the preconditioning matrix, our proposed algorithm ensures a decreasing bias, which is introduced by ignoring the correction term in the preconditioned SGLD. According to the existing theoretical framework, we show that the proposed algorithm can asymptotically converge to the correct distribution with a controllable bias under mild conditions. Numerical tests are performed on both synthetic regression problems and learning solutions of elliptic PDE, which demonstrate the accuracy and efficiency of the present work.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2025

Validation and moisture content sensitivity analysis of cross-laminated timber wall assemblies in EnergyPlus

Cross-laminated timber buildings are becoming more common in North America, with many numerical studies showing potential energy savings. However, no studies have validated any EnergyPlus heat transfer algorithms or quantified their accuracy in simulating CLT in building envelopes. This study empirically validates the heat flux predictions for each of EnergyPlus's heat transfer algorithms (Conduction Transfer Functions (CTF), Effective Moisture Penetration Depth (EMPD), Conduction Finite Difference (CondFD), and Heat and Moisture Transfer (HAMT)) for two different CLT ply thicknesses with both summer and winter boundary conditions measured in controlled lab experiments. It also evaluates the model sensitivity of heat flux and heating and cooling loads to moisture content. The 1D validation shows that the HAMT model is the most accurate among all algorithms. All EnergyPlus's heat flux predictions are accurate independent of CLT plate thickness for summer conditions. However, the three constant property algorithms (CTF, EMPD, and CondFD) underpredict heat flux throughout the whole day during winter conditions. The 1D sensitivity analysis indicates that elevated moisture content can increase peak heat fluxes through the material by up to 20 %. Finally, the whole building model sensitivity analysis shows increased heating load and slight cooling load variation due to increased moisture content when using constant property models. The analysis shows significantly lower peak thermal demand (7 % lower heating and 6 % lower cooling) and monthly thermal load (8 % less cooling and 6 % less heating) predictions when using HAMT vs a constant property model.

42 ENGINEERING↗
DOE OSTI2023

Accurate simulation of direct laser acceleration in a laser wakefield accelerator

In a laser wakefield accelerator (LWFA), an intense laser pulse excites a plasma wave that traps and accelerates electrons to relativistic energies. When the pulse overlaps the accelerated electrons, it can enhance the energy gain through direct laser acceleration (DLA) by resonantly driving the betatron oscillations of the electrons in the plasma wave. The traditional particle-in-cell (PIC) algorithm, although often the tool of choice to study DLA, contains inherent errors due to numerical dispersion and the time staggering of the electric and magnetic fields. Furthermore, conventional PIC implementations cannot reliably disentangle the fields of the plasma wave and laser pulse, which obscures interpretation of the dominant acceleration mechanism. Here, a customized field solver that reduces errors from both numerical dispersion and time staggering is used in conjunction with a field decomposition into azimuthal modes to perform PIC simulations of DLA in an LWFA. Comparisons with traditional PIC methods, model equations, and experimental data show improved accuracy with the customized solver and convergence with an order-of-magnitude fewer cells. Furthermore, the azimuthal-mode decomposition reveals that the most energetic electrons receive comparable energy from DLA and LWFA.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2024

Steady-state properties of multi-orbital systems using quantum Monte Carlo

A precise dynamical characterization of quantum impurity models with multiple interacting orbitals is challenging. In quantum Monte Carlo methods, this is embodied by sign problems. A dynamical sign problem makes it exponentially difficult to simulate long times. A multi-orbital sign problem generally results in a prohibitive computational cost for systems with multiple impurity degrees of freedom even in static equilibrium calculations. Here, we present a numerically exact inchworm method that simultaneously alleviates both sign problems, enabling simulation of multi-orbital systems directly in the equilibrium or nonequilibrium steady-state. The method combines ideas from the recently developed steady-state inchworm Monte Carlo framework [Erpenbeck et al., Phys. Rev. Lett. 130, 186301 (2023)] with other ideas from the equilibrium multi-orbital inchworm algorithm [Eidelstein et al., Phys. Rev. Lett. 124, 206405 (2020)]. We verify our method by comparison with analytical limits and numerical results from previous methods.

Chemistry↗
DOE OSTI2022

Absorption of charged particles in perfectly matched layers by optimal damping of the deposited current

Perfectly matched layers (PMLs) are widely used in particle-in-cell simulations, in order to absorb electromagnetic waves that propagate out of the simulation domain. However, when charged particles cross the interface between the simulation domain and the PMLs, a number of numerical artifacts can arise. Here, in order to mitigate these artifacts, we introduce a PML algorithm whereby the current deposited by the macroparticles in the PML is damped by an analytically derived optimal coefficient. The benefits of this algorithm are illustrated in practical simulations. In particular, it is shown that this algorithm is well suited for particles exiting the box in near-normal incidence, in the sense that the fields behave as if the exiting particle is propagating in an infinite vacuum.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2024

Dynamical simulation via quantum machine learning with provable generalization

Much attention has been paid to dynamical simulation and quantum machine learning (QML) independently as applications for quantum advantage, while the possibility of using QML to enhance dynamical simulations has not been thoroughly investigated. Here we develop a framework for using QML methods to simulate quantum dynamics on near-term quantum hardware. We use generalization bounds, which bound the error a machine learning model makes on unseen data, to rigorously analyze the training data requirements of an algorithm within this framework. Our algorithm is thus resource efficient in terms of qubit and data requirements. Furthermore, our preliminary numerics for the XY model exhibit efficient scaling with problem size, and we simulate 20 times longer than Trotterization on IBMQ-Bogota. Published by the American Physical Society 2024

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Electromagnetic Transient Simulation of Large-Scale Inverter-Based Resources With High-Granularity

The power grid is undergoing a significant transformation with the rapid increase in inverter-based resources (IBRs), including large-scale photovoltaic (PV) plants. Ensuring reliable and resilient grid operation in this new paradigm necessitates high-granularity electromagnetic transient (EMT) modeling that accurately captures the behavior of individual inverters and their interactions within IBR plants. Central to this approach is the detailed representation of both the IBR plant’s collector system and the dynamics of individual inverters. To achieve this, a high-granularity EMT model of a large-scale PV plant has been developed using advanced simulation algorithms, including matrix splitting and the Schur complement. These proposed techniques significantly enhance simulation speed, numerical stability, and accuracy while improving the modularity and efficiency of the collector system’s representation. The effectiveness of the proposed methods is validated through simulations of a representative large-scale PV plant consisting of 125 individual PV inverters, 25 IBR unit transformers, and a 52-bus collector system.

Choi, Jongchan [Oak Ridge National Laboratory (ORN↗
DOE OSTI2023

HamLib: A Library of Hamiltonians for Benchmarking Quantum Algorithms and Hardware

For a considerable time, large datasets containing problem instances have proven valuable for analyzing computer hardware, software, and algorithms. One notable example of the value of large datasets is ImageNet [1], a vast repository of images that has been instrumental in testing numerous deep learning packages. Similarly, in the domain of computational chemistry and materials science, the availability of extensive datasets such as the Protein Data Bank [2], the Materials Project [3], and QM9 [4] has greatly facilitated the evaluation of new algorithms and software approaches, while also promoting standardization within the field. These well-defined datasets and problem instances, in turn, serve as the foundation for creating benchmarking suites like MLPerf [5] and LINPACK [6], [7]. These suites enable fair and rigorous comparisons of different methodologies and solutions, fostering continuous advancements in various areas of computer science and beyond.

Sawaya, Nicolas PD↗
DOE OSTI2025

Two-Stage Distributionally Robust Conic Linear Programming over 1-Wasserstein Balls

Here, this paper studies two-stage distributionally robust conic linear programming under constraint uncertainty over type-1 Wasserstein balls. We present optimality conditions for the dual of the worst-case expectation problem, which characterizes worst-case uncertain parameters for its inner maximization problem. This condition offers an alternative proof, a counterexample, and an extension to previous works. Additionally, the condition highlights the potential advantage of a specific distance metric for out-of-sample performance, as exemplified in a numerical study on a facility location problem with demand uncertainty. Furthermore, cutting-plane-based algorithms, equipped with a unified scenario generation framework, are proposed for addressing both unbounded support and second-stage dual feasible regions, with a finite convergence proof under less stringent assumptions.

Wasserstein↗
DOE OSTI2022

Development of Explainable Data-Driven Turbulence Models with Application to Liquid Fuel Nuclear Reactors

Liquid fuel nuclear reactors offer innovative possibilities in terms of nuclear reactor designs and passive safety systems. Molten Salts Reactors (MSRs) with a fast spectrum are a particular type of these reactors using liquid fuel. MSFRs often involve large open cavities in their core in which the liquid fuel circulates at a high speed to transport the heat generated by the nuclear reactions into the heat exchangers. This high-speed flow yields a turbulent field with large Reynolds numbers in the reactor core. Since the nuclear power, the neutron precursor’s transport and the thermal exchanges are strongly coupled in the MSFR’s core cavity, having accurate turbulent models for the liquid fuel flow is necessary to avoid introducing significant errors in the numerical simulations of these reactors. Nonetheless, high-accuracy simulations of the turbulent flow field in the reactor cavity of these reactors are usually prohibitively expensive in terms of computational resources, especially when performing multiphysics numerical calculations. Therefore, in this work, we propose a novel method using a modified genetic algorithm to optimize the calculation of the Reynolds Shear Stress Tensor (RST) used for turbulence modeling. The proposed optimization methodology is particularly suitable for advanced liquid fuel reactors such as the MSFRs since it allows the development of high-accuracy but still low-computational-cost turbulence models for the liquid fuel. We demonstrate the applicability of this approach by developing high accuracy Reynolds-Averaged Navier–Stokes (RANS) models (averaged flow error less than 5%) for a low and a large aspect ratio in a Backward-Facing Step (BFS) section particularly challenging for RANS models. The newly developed turbulence models better capture the flow field after the boundary layer tipping, over the extent of the recirculation bubble, and near the boundary layer reattachment region in both BFS configurations. The main reason for these improvements is that the developed models better capture the flow field turbulent anisotropy in the bulk region of the BFS. Then, we illustrate the interest in using this turbulence modeling approach for the case of an MSFR by quantifying the impact of the turbulence modeling on the reactor key parameters.

42 ENGINEERING↗
DOE OSTI2025

Thermal Radiation Transport with Tensor Trains

We present a novel tensor network algorithm to solve the time-dependent, gray thermal radiation transport equation. The method invokes a tensor train (TT) decomposition for the specific intensity. The efficiency of this approach is dictated by the rank of the decomposition. When the solution is “low rank,” the memory footprint of the specific intensity solution vector may be significantly compressed. The algorithm, following a step-then-truncate approach of a traditional discrete ordinates method, operates directly on the compressed state vector, thereby enabling large speedups for low-rank solutions. To achieve these speedups, we rely on a recently developed rounding approach based on the Gram-SVD. We detail how familiar S N algorithms for (gray) thermal transport can be mapped to this TT framework and present several numerical examples testing both the optically thick and thin regimes. The TT framework finds low-rank structure and supplies up to ≃60× speedups and ≃1000× compressions for problems demanding large angle counts, thereby enabling previously intractable SN calculations and supplying a promising avenue to mitigate ray effects.

79 ASTRONOMY AND ASTROPHYSICS↗