Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “generalized algorithm”

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 1,027 records · Page 57
All sourcesNASA NTRSDOE OSTI
DOE OSTI2022

Approximating the linear response of physical chaos

Abstract Parametric derivatives of statistics are highly desired quantities in prediction, design optimization and uncertainty quantification. In the presence of chaos, the rigorous computation of these quantities is certainly possible, but mathematically complicated and computationally expensive. Based on Ruelle’s formalism, this paper shows that the sophisticated linear response algorithm can be dramatically simplified in higher-dimensional systems featuring statistical homogeneity in the physical space. We argue that the contribution of the SRB (Sinai–Ruelle–Bowen) measure gradient, which is an integral yet the most cumbersome part of the full algorithm, is negligible if the objective function is appropriately aligned with unstable manifolds. This abstract condition could potentially be satisfied by a vast family of real-world chaotic systems, regardless of the physical meaning and mathematical form of the objective function and perturbed parameter. We demonstrate several numerical examples that support these conclusions and that present the use and performance of a simplified linear response algorithm. In the numerical experiments, we consider physical models described by differential equations, including Lorenz 96 and Kuramoto–Sivashinsky.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2021

A Range and Performance Optimized Version of the Computer-Aided Speckle Interferometry Algorithm for Real-Time Displacement-Strain Field Monitoring

Abstract This work presents an optimized implementation of the Computer-Aided Speckle Interferometry algorithm which enables full-field determination of displacements and strains on commodity Graphics Processing Units at high resolution and frame rates. By combining careful control of the average speckle size in a laser speckle pattern with a simple sampling rate conversion scheme, a compact representation of the optical speckle is achieved. This allows for optimal use of Graphics Processing Unit architecture with robust range extension. The optimal mapping of the Computer-Aided Speckle Interferometry algorithm to Graphics Processing Unit architecture is shown in detail, and a straightforward method for disambiguating large displacements is illustrated. Lastly, this paper demonstrates a two-step subimage-tapering modification to the original algorithm that enables robust range enhancement while maintaining resolution. Results from numerical simulations on synthetic speckle patterns are shown, and runtime performance metrics are provided, with performance ranging up to 60 frames per second in some cases. The method is suitable for interactive experimental mechanics research, process and testing or any application where real-time high-resolution displacement-strain monitoring is needed. A .NET Framework class library enabling the incorporation of the algorithm into 3rd -party applications is available for download.

42 ENGINEERING↗
DOE OSTI2025

Directional finite difference method for directly solving 3D gyrokinetic field equations with enhanced accuracy

The gyrokinetic (GK) field equation is a three-dimensional (3D) elliptic equation, but it is often simplified to a set of two-dimensional (2D) equations by assuming that the field does not vary along a specific direction. However, this simplification can introduce inevitable 0th-order numerical errors, as nonlinear mode coupling in toroidal geometry can produce undesirable harmonic modes that violate the assumption. In this work, we propose a novel directional finite difference method (FDM) with a local coordinate transformation to better resolve the target field of interest. The directional FDM can accurately solve 3D GK field equations without simplifications, which can overcome the limitations of conventional methods. The accuracy and efficiency of different FDMs are analyzed in great detail for a variety of geometries, from simple 2D Cartesian coordinates to realistic 3D curvilinear coordinates. The 0th-order numerical errors of simplified 2D GK equations were found to be more problematic for low-harmonic modes and low aspect ratio geometries such as spherical tokamaks. On the other hand, the directional 3D FDM can accurately resolve a much wider range of harmonic modes aligned to the direction of interest, including the low-harmonic modes. In conclusion, we demonstrate that the directional 3D FDM is a highly effective algorithm for solving the 3D GK field equations, achieving accuracy improvements of 10 to 100 times or more, particularly for low-harmonic modes in spherical tokamaks.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2022

Fixed Depth Hamiltonian Simulation via Cartan Decomposition

Simulating quantum dynamics on classical computers is challenging for large systems due to the significant memory requirements. Simulation on quantum computers is a promising alternative, but fully optimizing quantum circuits to minimize limited quantum resources remains an open problem. In this study, we tackle this problem by presenting a constructive algorithm, based on Cartan decomposition of the Lie algebra generated by the Hamiltonian, which generates quantum circuits with time-independent depth. We highlight our algorithm for special classes of models, including Anderson localization in one-dimensional transverse field $\mathrm{XY}$ model, where $\mathscr{O}$(n 2 )-gate circuits naturally emerge. Compared to product formulas with significantly larger gate counts, our algorithm drastically improves simulation precision. In addition to providing exact circuits for a broad set of spin and fermionic models, our algorithm provides broad analytic and numerical insight into optimal Hamiltonian simulations.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2021

Fully Implicit Monte Carlo (FIMC) (September 2019-September 2020 Progress Report)

This research is focused on applying the NLem method to the full thermal radiative transfer (TRT) equations in the context of a Monte Carlo solution strategy. A framework has been developed for obtaining a solution to the TRT equations using the nonlinear elimination method (NLem) method. Current efforts are focused of the development and verification of the required Monte Carlo algorithm, diffusion algorithm, and material energy solver. Once all three pieces have been verified, the algorithms will then be coupled into a fully functioning method for applying NLem to the TRT equations.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2021

The PENELOPE Physics Models and Transport Mechanics. Implementation into Geant4

A translation of the PENELOPE physics subroutines to C++, designed as an extension of the GEANT4 toolkit, is presented. The Fortran code system PENELOPE performs Monte Carlo simulation of coupled electron-photon transport in arbitrary materials for a wide energy range, nominally from 50 eV up to 1 GeV. PENELOPE implements the most reliable interaction models that are currently available, limited only by the required generality of the code. In addition, the transport of electrons and positrons is simulated by means of an elaborate class II scheme in which hard interactions (involving deflection angles or energy transfers larger than pre-defined cutoffs) are simulated from the associated restricted differential cross sections. After a brief description of the interaction models adopted for photons and electrons/positrons, we describe the details of the class-II algorithm used for tracking electrons and positrons. The C++ classes are adapted to the specific code structure of GEANT4. They provide a complete description of the interactions and transport mechanics of electrons/positrons and photons in arbitrary materials, which can be activated from the G4ProcessManager to produce simulation results equivalent to those from the original PENELOPE programs. The combined code, named PENG4, benefits from the multi-threading capabilities and advanced geometry and statistical tools of GEANT4.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2024

Parallel hybrid quantum-classical machine learning for kernelized time-series classification

Supervised time-series classification garners widespread interest because of its applicability throughout a broad application domain including finance, astronomy, biosensors, and many others. Here, in this work, we tackle this problem with hybrid quantum-classical machine learning, deducing pairwise temporal relationships between time-series instances using a timeseries Hamiltonian kernel (TSHK). A TSHK is constructed with a sum of inner products generated by quantum states evolved using a parameterized time evolution operator. This sum is then optimally weighted using techniques derived from multiple kernel learning. Because we treat the kernel weighting step as a differentiable convex optimization problem, our method can be regarded as an end-to-end learnable hybrid quantum-classical-convex neural network, or QCC-net, whose output is a data set-generalized kernel function suitable for use in any kernelized machine learning technique such as the support vector machine (SVM). Using our TSHK as input to a SVM, we classify univariate and multivariate time-series using quantum circuit simulators and demonstrate the efficient parallel deployment of the algorithm to 127-qubit superconducting quantum processors using quantum multi-programming.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Analytical Identification Method of Generalized Short‐Circuit Ratio Using Phasor Measurement Units

This paper introduces a novel analytical approach for the identification of the admittance matrix and the generalized short-circuit ratio (gSCR) in power systems integrated with renewable energy sources. The proposed method leverages voltage and current measurements from phasor measurement units (PMUs) to construct a least squares objective function, which is then solved using matrix calculus and partial derivatives. Unlike conventional optimization algorithms, this approach provides an analytical solution that substantially reduces data requirements, enabling the efficient and accurate identification of the gSCR with smaller datasets. Additionally, its fixed computational complexity allows for real-time updates as new data are collected, ensuring continuous refinement of the system of equations and enabling rapid, precise gSCR calculations. The method also exhibits strong robustness against measurement noise, making it well-suited for practical applications in dynamic power systems. The combination of reduced data requirements, real-time adaptability, noise robustness and fixed computational load establishes this method as a highly efficient and reliable tool for real-time power system stability analysis. Case studies on an EPRI 36-bus system demonstrate the method's effectiveness, highlighting its accuracy in closely matching true gSCR values, even under diverse disturbances and noisy conditions.

Han, Zelei [Hohai University, Nanjing (China)] (OR↗
DOE OSTI2026

Morphological descriptors of nanoparticles: The link between atomistic structures and x-ray absorption spectra

Understanding and quantifying the morphology of nanoparticles are essential for linking their atomic structure to diverse applications and verifying theoretical models. While experimental information on the structure of nanoparticles in the size range below ∼5 nm can be extracted from x-ray absorption spectroscopy using a small number of descriptors—most commonly coordination numbers—developing an understanding of morphology descriptors from experimental data remains a challenge. Here, in this study, we introduce NanoGene, a genetic algorithm-based method for generating structurally diverse nanoparticle models guided by user-defined descriptors. We establish correlations among structural, size-related, and morphological descriptors and demonstrate how experimentally accessible parameters, such as coordination numbers, can be leveraged to infer otherwise inaccessible ones, such as the generalized coordination number or particle oblateness. Principal component and clustering analyses reveal the relative importance of descriptors, with the number of atoms emerging as a key discriminant of the nanoparticle structure. By providing both the methodology and an extensive dataset of nanoparticle geometries, this work offers a practical foundation for descriptor-based analysis and interpretation of experimental observations, bridging the gap between local atomic coordinates and global morphological characterization.

77 NANOSCIENCE AND NANOTECHNOLOGY↗
DOE OSTI2024

Robustness of neutron star merger simulations to changes in neutrino transport and neutrino-matter interactions

Binary neutron star mergers play an important role in nuclear astrophysics: Their gravitational wave and electromagnetic signals carry information about the equation of state of cold matter above nuclear saturation density, and they may be one of the main sources of r-process elements in the Universe. Neutrino-matter interactions during and after merger impact the properties of these electromagnetic signals and the relative abundances of the produced r-process elements. Existing merger simulations are, however, limited in their ability to realistically model neutrino transport and neutrino-matter interactions. Here, we perform a comparison of the impact of the use of state-of-the art two-moment or Monte Carlo transport schemes on the outcome of merger simulations, for a single binary neutron star system with a short-lived neutron star remnant [(5–10) ms]. We also investigate the use of different reaction rates in the simulations. While the best transport schemes generally agree well on the qualitative impact of neutrinos on the system, differences in the behavior of the high-density regions can significantly impact the collapse time and the properties of the hot tidal arms in this metastable merger remnant. The chosen interaction rates and transport algorithm as well as recent improvements by Radice et al. to the two-moment algorithms can all contribute to changes at the (10–30)% level in the global properties of the merger remnant and outflows. Furthermore, the limitations of previous moment schemes fixed by Radice et al. also appear sufficient to explain the large difference that we observed in the production of heavy-lepton neutrinos in a previous comparison of Monte Carlo and moment schemes in the context of a low-mass binary neutron star system.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2024

FARM User Guidance and Instructions

The FARM (Feasible Actuator Range Modifier) module is a component of the RAVEN-based FORCE framework for the analysis of Integrated Energy Systems (IES). FARM aids HERON in the solution of the power dispatch problem by evaluating feasible set-point signals to be issued to the control systems of the different IES unit components. Set-points need to satisfy limits on both production variables (i.e., the variables to be optimized such as the electrical power, etc.) and process variables tied to the service life of equipment (e.g., steam flowrate, vessel pressure, turbine firing temperature, etc.). To enforce all these limits, a two-stage approach is adopted. First, the power dispatcher algorithm in HERON module estimates set-points that meet the constraints on the production variables, e.g., power levels and power ramp rate limits. These constraints are called explicit constraints. Then, if necessary, FARM adjusts these set-points to ensure the respect of the limits on the process variables of interest, given the knowledge of the system dynamics acquired through machine learning algorithms. These constraints are called implicit constraints. From this standpoint, FARM constitutes a bridge between the HERON power dispatcher that adopts a simplified description of the IES unit (low-resolution physics) and the HYBRID high-fidelity models (high-resolution physics). In this report, the general workflow and the software requirements of FARM module are summarized, and the detailed instructions for installing FARM software, running built-in example cases, deriving Linear Parameter-Varying (LPV) state-space models, and using FARM for user-defined power dispatch problems are provided.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗
DOE OSTI2023

Dimension Reduction and Redundancy Removal through Successive Schmidt Decompositions

Quantum computers are believed to have the ability to process huge data sizes, which can be seen in machine learning applications. In these applications, the data, in general, are classical. Therefore, to process them on a quantum computer, there is a need for efficient methods that can be used to map classical data on quantum states in a concise manner. On the other hand, to verify the results of quantum computers and study quantum algorithms, we need to be able to approximate quantum operations into forms that are easier to simulate on classical computers with some errors. Motivated by these needs, in this paper, we study the approximation of matrices and vectors by using their tensor products obtained through successive Schmidt decompositions. We show that data with distributions such as uniform, Poisson, exponential, or similar to these distributions can be approximated by using only a few terms, which can be easily mapped onto quantum circuits. The examples include random data with different distributions, the Gram matrices of iris flower, handwritten digits, 20newsgroup, and labeled faces in the wild. Similarly, some quantum operations, such as quantum Fourier transform and variational quantum circuits with a small depth, may also be approximated with a few terms that are easier to simulate on classical computers. Furthermore, we show how the method can be used to simplify quantum Hamiltonians: In particular, we show the application to randomly generated transverse field Ising model Hamiltonians. The reduced Hamiltonians can be mapped into quantum circuits easily and, therefore, can be simulated more efficiently.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Topological Optimization with Big Steps

Using persistent homology to guide optimization has emerged as a novel application of topological data analysis. Existing methods treat persistence calculation as a black box and backpropagate gradients only onto the simplices involved in particular pairs. We show how the cycles and chains used in the persistence calculation can be used to prescribe gradients to larger subsets of the domain. In particular, we show that in a special case, which serves as a building block for general losses, the problem can be solved exactly in linear time. This relies on another contribution of this paper, which eliminates the need to examine a factorial number of permutations of simplices with the same value. Here, we present empirical experiments that show the practical benefits of our algorithm: the number of steps required for the optimization is reduced by an order of magnitude.

96 KNOWLEDGE MANAGEMENT AND PRESERVATION↗
DOE OSTI2020

Efficient and robust phase-split computations in the internal energy, volume, and moles ( UVN ) space

Phase-split computations in an isolated system, which in general may be defined as one where the total internal energy (U), volume (V), and the number of moles (N = N 1 , N 2 ,..., N n ) of the components are fixed at some specified set of values, involves the determination of the temperature (T), pressure (P), plus the amount and composition of the various phases that constitute the system. A simpler, but analogous problem is one where T, P, and N are specified instead. In TPN space, one may first perform a stability analysis to determine whether the system is stable, meaning whether at equilibrium it will split up into multiple phases or remain in single phase. If the single-phase state is unstable, the stability analysis reliably provides a good set of initial guesses in the subsequent phase-split computations. In UVN space, however, we demonstrate that the stability analysis (which is the main subject of our earlier study [1]) may not in general provide good enough initial guesses; we offer alternative strategies for setting up good initial guesses. Furthermore, we show that a combination of successive substitution iteration (SSI) and Newton's method---two iterative methods that are prevalent in the literature in TPN space---facilitates a robust and efficient algorithm for phase-split computations in isolated systems. Finally, this combination has so far not been applied in UVN space.

02 PETROLEUM↗
DOE OSTI2024

Bridging Hydrological Ensemble Simulation and Learning Using Deep Neural Operators

Ensemble-based simulation and learning (ESnL) has long been used in hydrology for parameter inference, but computational demands of process-based ESnL can be quite high. To address this issue, we propose a deep neural operator learning approach. Neural operators are generic machine learning algorithms that can learn functional mappings between infinite-dimensional spaces, providing a highly flexible tool for scientific machine learning. Our approach is built upon DeepONet, a specific deep neural operator, and is designed to address several common problems in hydrology, namely, model parameter estimation, prediction at ungaged locations, and uncertainty quantification. Here we demonstrate the effectiveness of our DeepONet-based workflow using an existing large model ensemble created for an eastern U.S. watershed that is instrumented with 10 streamflow gages. Results suggest DeepONet achieves high efficiency in learning an ML surrogate model from the model ensemble, with the modified Kling-Gupta Efficiency exceeding 0.9 on holdout test sets. Parameter inference, carried out using the trained DeepONet surrogate model and genetic algorithm, also yields robust results. Additionally, we formulate and train a separate DeepONet model for physics-informed, seq-to-seq streamflow forecasting, which further reduces biases in the pre-trained DeepONet surrogate model. While this study focuses primarily on a single watershed, our approach is general and may be extended to enable learning from model ensembles across multiple basins or models. Thus, this research represents a significant contribution to the application of hybrid machine learning in hydrology.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2021

Ultrafast time-resolved x-ray absorption spectroscopy of ionized urea and its dimer through ab initio nonadiabatic dynamics

Investigating the early dynamics of chemical systems following ionization is essential for our understanding of radiation damage. However, experimental as well as theoretical investigations are very challenging due to the complex nature of these processes. Time-resolved x-ray absorption spectroscopy on a femtosecond timescale, in combination with appropriate simulations, is able to provide crucial insights into the ultrafast processes that occur upon ionization due to its element-specific probing nature. In this theoretical study, we investigate the ultrafast dynamics of valence-ionized states of urea and its dimer employing Tully's fewest switches surface hopping approach using Koopmans' theorem to describe the ionized system. We demonstrate that following valence ionization through a pump pulse, the time-resolved x-ray absorption spectra at the carbon, nitrogen, and oxygen K-edges reveal rich insights into the dynamics. Excited states of the ionized system give rise to time-delayed blueshifts in the x-ray absorption spectra as a result of electronic relaxation dynamics through nonadiabatic transitions. Moreover, our statistical analysis reveals specific structural dynamics in the molecule that induce time-dependent changes in the spectra. For the urea monomer, we elucidate the possibility to trace effects of specific molecular vibrations in the time-resolved x-ray absorption spectra. For the urea dimer, where ionization triggers a proton transfer reaction, we show how the x-ray absorption spectra can reveal specific details on the progress of proton transfer.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2020

Topological background discrimination in the PandaX-III neutrinoless double beta decay experiment

The PandaX-III experiment plans to search for neutrinoless double beta decay (0ν ββ ) of 136 Xe in the China JinPing underground Laboratory (CJPL). The experiment will use a high pressure gaseous time projection chamber (TPC) to register both the energy and the electron track topology of an event. This article is devoted to demonstrate our particular detector setup capabilities for the identification of 0ν ββ and the consequent background reduction. As software tool we use REST, a framework developed for the reconstruction and simulation of TPC-based detector systems. We study the potential for background reduction by introducing appropriate parameters based on the properties of 0ν ββ events. We exploit for the first time not only the energy density of the electron track-ends, but also the electron scattering angles produced by an electron near the end of its trajectory. To implement this, we have added new algorithms for detector signal and track processing inside REST. Their assessment shows that background can be reduced by about 7 orders of magnitude while keeping 0ν ββ efficiency above 20% for the PandaX-III baseline readout scheme, a two-dimensional 3 mm pitch stripped readout. More generally, we use the potential of REST to handle 2D/3D data to assess the impact on signal-to-background significance at different detector granularities, and to validate the PandaX-III baseline choice. Finally, we demonstrate the additional potential to discriminate surface background events generated at the readout plane in the absence of to, by making use of event parameters related with the diffusion of electrons.

Majorana↗
DOE OSTI2026

Fast Fourier transform evaluation of the Fresnel integral for gravitational-wave lensing

Gravitational waves (GWs) exhibit wave-optics effects when their wavelength is comparable to the scale of the gravitational lens. This may occur in lensing from galactic subhalos in GWs emitted by binary black-hole mergers and is gaining interest as a novel probe of dark matter. Predictions for observables in these cases ultimately rely on evaluating a Fresnel integral that quantifies the effect of lensing on the amplitude of a GW at a given frequency. However, numerical evaluation of this Fresnel integral is tricky, and several algorithms and publicly available codes that implement it have been developed. Here, we show that the dependence of this integral on the lens position can be written as a two-dimensional Fourier transform. Modern FFT techniques then enable rapid evaluation at all-sky positions simultaneously for general lenses without symmetry. Vectorization of FFT routines allows for derivatives with respect to model parameters to be obtained with only incremental additional computational cost. If the lens is axisymmetric, further speedups can be achieved with recently developed techniques for nonuniform fast Hankel transforms. To demonstrate, we make available Fresnel Integral Optimization with Nonuniform Transforms (fiona), an efficient and accurate code that is significantly faster than current methods for dense source grids, reaching 2 orders of magnitude speedups for ∼10 6 GW-emitting points. As part of FIONA , we developed code that provides vectorized nonuniform fast Hankel transforms that may have other uses (e.g., calculation of cosmological two-point correlation functions) beyond those considered here.

dark matter↗