Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “APPROXIMATIONS”

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 397 records · Page 22
All sourcesNASA NTRSDOE OSTI
DOE OSTI2025

Construction of approximate invariants for non-integrable Hamiltonian systems

We present a method to construct high-order polynomial approximate invariants (AI) for non integrable Hamiltonian dynamical systems, and apply it to a modern ring-based particle accelerator. Taking advantage of a special property of one-turn transformation maps in the form of a square matrix, AIs can be constructed order-by-order iteratively. Evaluating AI with simulation data, we observe that AI’s fluctuation is actually a measure of chaos. Through minimizing the fluctuations, the stable region of long-term motions, i.e., the dynamic aperture of the accelerator, could be enlarged.

43 PARTICLE ACCELERATORS↗
DOE OSTI2025

Atomistic Modeling of the Interphase Structure between Alumina and Al12Fe2Cr Quasicrystal Approximant

Molecular dynamics simulations are performed to study the stability of an fcc metallic interlayer phase between an iron aluminide quasicrystal approximant (QCA) phase (84.2 Al, 5.7 Fe, 5.4 Ni, and 4.7 at.% Cr) and aluminum oxides (α-Al 2 O 3 and γ-Al 2 O 3 ). The presence of the interlayer phase was experimentally observed in some regions of the inner diameter surface of a TPBAR cladding tube. The simulations employed existing many-body (MEAM and EAM) interatomic potentials to describe atomic interactions in the interlayer and QCA phases, and Buckingham+Coulomb pair interactions for the alumina and between the alumina and the QCA (or fcc). Interface systems of QCA/alumina, fec/alumina, and QCA/fcc are modeled and the fracture energy of the interfaces is calculated. Based on the fracture energies, for the γ-Al 2 O 3 , both MEAM and EAM suggest that the fcc interlayer phase would not form. For the α-Al 2 O 3 , the MEAM predicts that the fcc phase would form, however, the EAM predicts that it forms only if the α-Al 2 O 3 is Al-terminated at the interface. For the O-terminated α-Al 2 O 3 , the EAM predicts the fcc phase would not form, consistent with the results for γ-Al 2 O 3 .

36 MATERIALS SCIENCE↗
DOE OSTI2023

Exclusive $|V_{ub}|$ determinations using Padé Approximants

We determine the CKM parameter |V ub | from the exclusive semileptonic decays B→πℓν ℓ and B s →Kℓν ℓ , employing Lattice QCD theoretical information on the form factors in combination with experimental measurements of the differential branching ratio distributions. Using Pad\'{e} approximants to the participating form factors we obtain |V ub |=3.86(11)x10 -3 and |V ub |=3.58(9)x10 -3 from the analyses of the individual decay channels, respectively, and |V ub |=3.68(5)x10 -3 from a simultaneous analysis of both decays. Our results highlight the importance of the decay B s →Kμν μ in complementing the traditional B→πℓν ℓ one in the exclusive determination of |V ub | , and strengthens the case for precise measurements of the differential B s →Kℓν ℓ decay rate with a finer resolution of the q 2 bins, as it would definitely allow achieving more conclusive results for |V ub | .

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2020

Application of the Approximate Bayesian Computation Algorithm to Gamma-Ray Spectroscopy

Radioisotope identification (RIID) algorithms for gamma-ray spectroscopy aim to infer what isotopes are present and in what amounts in test items. RIID algorithms either use all energy channels in the analysis region or only energy channels in and near identified peaks. Because many RIID algorithms rely on locating peaks and estimating each peak’s net area, peak location and peak area estimation algorithms continue to be developed for gamma-ray spectroscopy. This paper shows that approximate Bayesian computation (ABC) can be effective for peak location and area estimation. Algorithms to locate peaks can be applied to raw or smoothed data, and among several smoothing options, the iterative bias reduction algorithm (IBR) is recommended; the use of IBR with ABC is shown to potentially reduce uncertainty in peak location estimation. Extracted peak locations and areas can then be used as summary statistics in a new ABC-based RIID. ABC allows for easy experimentation with candidate summary statistics such as goodness-of-fit scores and peak areas that are extracted from relatively high dimensional gamma spectra with photopeaks (1024 or more energy channels) consisting of count rates versus energy for a large number of gamma energies.

Burr, Tom↗
DOE OSTI2022

Optimal Power Dispatch of DGs in Radial and Mesh AC Grids: A Hybrid Solution Methodology between the Salps Swarm Algorithm and Successive Approximation Power Flow Method

In this paper, we address the problem of the optimal power dispatch of Distributed Generators (DGs) in Alternating Current (AC) networks, better known as the Optimal Power Flow (OPF) problem. We used, as the objective function, the minimization of power losses (P loss ) associated with energy transport, which are subject to the set of constraints that compose AC networks in an environment of distributed generation. To validate the effectiveness of the proposed methodology in solving the OPF problem in any network topology, we employed one 10-node mesh test system and three radial text systems: 10, 33, and 69 nodes. In each test system, DGs were allowed to inject 20%, 40%, and 60% of the power supplied by the slack generator in the base case. To solve the OPF problem, we used a master–slave methodology that integrates the optimization method Salps Swarm Algorithm (SSA) and the load flow technique based on the Successive Approximation (SA) method. Moreover, for comparison purposes, we employed some of the algorithms reported in the specialized literature to solve the OPF problem (the continuous genetic algorithm, the particle swarm optimization algorithm, the black hole algorithm, the antlion optimization algorithm, and the Multi-Verse Optimizer algorithm), which were selected because of their excellent results in solving such problems. The results obtained by the proposed solution methodology demonstrate its superiority and convergence capacity in terms of minimization of P loss in both radial and mesh systems. It provided the best reduction in minimum P loss in short processing times and showed excellent repeatability in each test system and scenario under analysis.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗
DOE OSTI2021

Approximating Nash Equilibrium in Day-ahead Electricity Market Bidding with Multi-agent Deep Reinforcement Learning

In this paper, a day-ahead electricity market bidding problem with multiple strategic generation company (GEN-CO) bidders is studied. The problem is formulated as a Markov game model, where GENCO bidders interact with each other todevelop their optimal day-ahead bidding strategies. Considering unobservable information in the problem, a model-free and data-driven approach, known as multi-agent deep deterministic policy gradient (MADDPG), is applied for approximating the Nash equilibrium (NE) in the above Markov game. The MADDPG algorithm has the advantage of generalization due to the automatic feature extraction ability of the deep neural networks. The algorithm is tested on an IEEE 30-bus system with three competitive GENCO bidders in both an uncongested caseand a congested case. Comparisons with a truthful bidding strategy and state-of-the-art deep reinforcement learning methods including deep Q network and deep deterministic policy gradient (DDPG) demonstrate that the applied MADDPG algorithm can find a superior bidding strategy for all the market participants with increased profit gains. In addition, the comparison with a conventional model-based method shows that the MADDPG algorithm has higher computational efficiency, which is feasible for real-world applications.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2026

Red Noise–based False Alarm Thresholds for Astrophysical Periodograms via Whittle’s Approximation to the Likelihood

Astronomers who search for periodic signals using Lomb–Scargle periodograms rely on false alarm level (FAL) estimates to identify statistically significant peaks. Although FALs are often calculated from white noise models, many astronomical time series suffer from red noise. Prewhitening is a statistical technique in which a continuum model is subtracted from the log power spectrum estimate, after which the observer can proceed with a white-noise treatment. Here we present a prewhitening-based method of calculating frequency-dependent FALs. We fit power laws and autoregressive models of order 1 to each Lomb–Scargle periodogram by minimizing the Whittle approximation to the negative log-likelihood (NLL), then calculate FALs based on the best-fit model power spectrum. Our technique is a novel extension of the Whittle NLL to datasets with uneven time sampling. We demonstrate FAL calculations using observations of α Cen B, GJ 581, HD 192310, synthetic data from the radial velocity (RV) fitting challenge, and Kepler observations of a differential rotator. The Kepler data analysis shows that only true rotation signals are detected by red noise FALs, while white noise FALs suggest all spurious peaks in the low-frequency range are significant. A high-frequency sinusoid injected into α Cen B logR$'$ HK observations exceeds the 1% red noise FAL despite having only 8.9% of the power of the dominant rotation signal. In a periodogram of HD 192310 RVs, peaks associated with differential rotation and planets are detected against the 5% red noise FAL without iterative model fitting or subtraction. The software for calculating red noise–based FALs is available on GitHub.

Astrostatistics (1882)↗
DOE OSTI2022

Approximating Density Probability Distribution Functions Across Cosmologies

Using a suite of self-similar cosmological simulations, we measure the probability distribution functions (PDFs) of real-space density, redshift-space density, and their geometric mean. We find that the real-space density PDF is well-described by a function of two parameters: ns, the spectral slope, and σL, the linear rms density fluctuation. For redshift-space density and the geometric mean of real- and redshift-space densities, we introduce a third parameter, ${s}_{L}=\sqrt{\langle {\left({{dv}}_{\mathrm{pec}}^{L}/{dr}\right)}^{2}\rangle }/H$. We find that density PDFs for the LCDM cosmology is also well-parameterized by these three parameters. As a result, we are able to use a suite of self-similar cosmological simulations to approximate density PDFs for a range of cosmologies. We make the density PDFs publicly available and provide an analytical fitting formula for them.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2024

Anomaly Detection and Approximate Similarity Searches of Transients in Real-time Data Streams

Abstract We present Lightcurve Anomaly Identification and Similarity Search ( LAISS ), an automated pipeline to detect anomalous astrophysical transients in real-time data streams. We deploy our anomaly detection model on the nightly Zwicky Transient Facility (ZTF) Alert Stream via the ANTARES broker, identifying a manageable ∼1–5 candidates per night for expert vetting and coordinating follow-up observations. Our method leverages statistical light-curve and contextual host galaxy features within a random forest classifier, tagging transients of rare classes ( spectroscopic anomalies), of uncommon host galaxy environments ( contextual anomalies), and of peculiar or interaction-powered phenomena ( behavioral anomalies). Moreover, we demonstrate the power of a low-latency (∼ms) approximate similarity search method to find transient analogs with similar light-curve evolution and host galaxy environments. We use analogs for data-driven discovery, characterization, (re)classification, and imputation in retrospective and real-time searches. To date, we have identified ∼50 previously known and previously missed rare transients from real-time and retrospective searches, including but not limited to superluminous supernovae (SLSNe), tidal disruption events, SNe IIn, SNe IIb, SNe I-CSM, SNe Ia-91bg-like, SNe Ib, SNe Ic, SNe Ic-BL, and M31 novae. Lastly, we report the discovery of 325 total transients, all observed between 2018 and 2021 and absent from public catalogs (∼1% of all ZTF Astronomical Transient reports to the Transient Name Server through 2021). These methods enable a systematic approach to finding the “needle in the haystack” in large-volume data streams. Because of its integration with the ANTARES broker, LAISS is built to detect exciting transients in Rubin data.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2025

Analytical Approximations for Beamstrahlung at Very High Energy Electron-Positron Colliders

Among the many effects that occur in beam-beam electron-positron collisions at TeV energies, emission of hard synchrotron radiation, or beamstrahlung, has special importance. Beamstrahlung determines the energy spectrum of the most energetic electrons, positrons, and photons and supplies the initial condition for the calculation of all other QED processes. In this paper, we show that the description of beamstrahlung simplifies in the limit of large quantum parameter $Υ$, which is realized in 10 TeV collider designs. The beamstrahlung spectra for electrons and photons are given in terms of universal functions. We supply approximations to these functions that will be useful for more general studies of the beam-beam interaction at very high energies.

Accelerator Physics (physics.acc-ph)↗
DOE OSTI2022

Evaluation of a quasi-steady-state approximation of the cloud droplet growth equation (QDGE) scheme for aerosol activation in global models using multiple aircraft data over both continental and marine environments

This research introduces a numerically efficient aerosol activation scheme and evaluates it by using stratus and stratocumulus cloud data sampled during multiple aircraft campaigns in Canada, Chile, Brazil, and China. The scheme employs a quasi-steady-state approximation of the cloud droplet growth equation (QDGE) to efficiently simulate aerosol activation, the vertical profile of supersaturation, and the activated cloud droplet number concentration (CDNC) near the cloud base. The calculated maximum supersaturation values using the QDGE scheme were compared with multiple parcel model simulations under various aerosol and environmental conditions. The differences are all below 0.18 %, indicating good performance and accuracy of the QDGE scheme. We evaluated the QDGE scheme by specifying observed environmental thermodynamic variables and aerosol information from 31 cloud cases as input and comparing the simulated CDNC with cloud observations. The average of mean relative error ($\overline{MRE}$) of the simulated CDNC for cloud cases in each campaign ranges from 17.30 % in Brazil to 25.90 % in China, indicating that the QDGE scheme successfully reproduces observed variations in CDNC over a wide range of different meteorological conditions and aerosol regimes. Additionally, we carried out an error analysis by calculating the maximum information coefficient (MIC) between the MRE and input variables for the individual campaigns and all cloud cases. MIC values were then sorted by aerosol properties, pollution level, environmental humidity, and dynamic condition according to their relative importance to MRE. Based on the error analysis, we found that the magnitude of MRE is more relevant to the specification of input aerosol pollution level in marine regions and aerosol hygroscopicity in continental regions than to other variables in the simulation.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2022

Novel Relaxation Time Approximation: A Consistent Calculation of Transport Coefficients with QCD-inspired Relaxation Times

We use a novel formulation of the relaxation time approximation to consistently calculate the bulk and shear viscosity coefficients using QCDinspired energy-dependent relaxation times and phenomenological thermal masses obtained from fits to lattice QCD thermodynamics. The matching conditions are conveniently chosen to simplify the computations.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2022

Mechanical properties of zeolite-templated carbons from approximate density functional theory calculations

Zeolite-templated carbon (ZTC) is a unique porous carbonaceous material whose structure is ordered at the nanometre scale, enabling a representative periodic description at the atomistic level. Utilizing an existing, well-defined reference model for ZTCs, a structural library of varying compositions was developed by refinement using density-functional tight-binding (DFTB) potentials parameterized for materials science applications. We first determined the quantum chemical-refined structures of models with CH, CHO, CHON, CHOB, and CHOBN compositions with various degrees of heteroatom substitution. These structural models comprise the characteristic morphological features of highly porous carbon materials, such as open-blade surfaces, edges, saddles, and closed-strut formations, spanning a range of curvatures and characteristic sizes. Second, we carried out alternating compression and expansion of the CHO model unit cell to determine the lowest energy structure as well as to obtain its bulk modulus in order to demonstrate a close connection between macroscopic observations and atomic-scale structures. Further, the agreement between experimental measurements and the computational model is remarkable and demonstrates the power of approximate density functional theory as a cost-effective computational tool with chemical accuracy for the investigation of structure/property relationships in real-world carbon-based solids.

03 NATURAL GAS↗
DOE OSTI2020

Protein Molecular Dynamics Simulations with Approximate QM: What Can We Learn?

Classical force fields are essential for computer simulations of proteins and are typically parameterized to reproduce secondary and tertiary structure of isolated proteins. However, while protein-protein interactions are ubiquitous in nature, they are not considered in parameterization efforts and are far less understood than isolated proteins. A better characterization of intermolecular interactions is widely recognized as a key to revolutionizing drug and therapeutic developments with high-throughput computational screening. Urgently needed is a critical assessment of the performance of modern protein force fields against first-principles electronic structure methods and experiments. In a daring step toward this goal, we here describe a comparison of peptide folding dynamics as predicted by a molecular mechanics force field on the one hand and by an approximate electronic structure quantum mechanical (QM) method based on density-functional tight-binding (DFTB) on the other. We further compare the dynamics from straightforward DFTB simulations with a near-linear scaling version of DFTB for massively parallel computation based on the fragment molecular orbital (FMO-DFTB) method. We illustrate differences between the phenomenology of the folding dynamics from these three methods for a small model peptide, as well as charge polarization and dynamic fluctuations, point out possible correlations and implications for force field developers, and discuss the lessons learned that might become applicable to future predictive high-throughput computer screening for personalized neoantigen cancer therapy.

Irle, Stephan↗
DOE OSTI2021

Simulations of Quantum Circuits with Approximate Noise using qsim and Cirq

We introduce multinode quantum trajectory simulations with qsim, an open source high performance simulator of quantum circuits. qsim can be used as a backend of Cirq, a Python software library for writing quantum circuits. We present a novel delayed inner product algorithm for quantum trajectories which can result in an order of magnitude speedup for low noise simulation. We also provide tools to use this framework in Google Cloud Platform, with high performance virtual machines in a single mode or multinode setting. Multinode configurations are well suited to simulate noisy quantum circuits with quantum trajectories. Finally, we introduce an approximate noise model for Google's experimental quantum computing platform and compare the results of noisy simulations with experiments for several quantum algorithms on Google's Quantum Computing Service.

Isakov, Sergei V.↗
DOE OSTI2024

Deriving Effective Coupling Strength with Born-Oppenheimer Approximation

The development of high-fidelity quantum gates is paramount to the scalability of quantum processors. Tunable couplers have played a key role in the realization of these low error rate quantum gates in superconducting circuits. However, the derivation of the effective coupling strength between the qubits is usually enabled by a Schrieffer-Wolff transformation, which is complex and requires prior-knowledge of the proper generator for the transformation. We propose a simpler method of obtaining this effective coupling using an approach similar to the Born-Oppenheimer approximation.

Wichmann, Conrad↗
DOE OSTI2023

Faster approximate subgraph counts with privacy

One of the most common problems studied in the context of differential privacy for graph data is counting the number of non-induced embeddings of a subgraph in a given graph. These counts have very high global sensitivity. Therefore, adding noise based on powerful alternative techniques, such as smooth sensitivity and higher-order local sensitivity have been shown to give significantly better accuracy. However, all these alternatives to global sensitivity become computationally very expensive, and to date efficient polynomial time algorithms are known only for few selected subgraphs, such as triangles, k-triangles, and k-stars. In this paper, we show that good approximations to these sensitivity metrics can be still used to get private algorithms. Using this approach, we much faster algorithms for privately counting the number of triangles in real-world social networks, which can be easily parallelized. We also give a private polynomial time algorithm for counting any constant size subgraph using less noise than the global sensitivity; we show this can be improved significantly for counting paths in special classes of graphs

Nguyen, Dung↗
DOE OSTI2026

Self-consistent mean-field quantum approximate optimization

We introduce a self-consistent mean-field quantum optimization algorithm that approximates the ground state of classical Ising Hamiltonians. The algorithm decomposes the problem into independent subproblems and treats the interactions between them in a mean-field manner. These interactions are captured by a common environment, constructed self-consistently through a variational quantum circuit, and which modifies the subproblems to account for mutual influence while maintaining computational independence. Consequently, subproblems can be solved individually, avoiding the computational cost of the full problem. We explore the properties of the generated environment and assess the algorithm's performance through extensive numerical simulations on Sherrington-Kirkpatrick spin glasses. Furthermore, we apply it experimentally to a weighted maximum clique problem applied to molecular docking. This framework enables the solution of problems that would otherwise exceed the qubit and gate counts of current quantum hardware.

Dupont, Maxime [Rigetti Computing] (ORCID:00000001↗