Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “approximation 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 739 records · Page 41

A Quantum Approach for Implementing Fixed-Point Arithmetic in Solving Ordinary Differential Equations

Differential equations (DEs) serve as fundamental tools in mathematical modeling across scientific disciplines, yet classical numerical solvers face limitations with large-scale or computationally intensive problems. This study explores a quantum-inspired approach to solving DEs, combining quantum-inspired techniques with classical methods. It focuses on fixed-point arithmetic on quantum circuits, utilizing basic quantum gates to manipulate DE solutions. We expand upon the techniques introduced by Zanger et al. [Quantum, 5, 502 (2021)] by offering a precise computation for a fixed-point signed multiplication scheme, while also presenting a quantum circuit capable of executing the fixed-point division algorithm. We demonstrate the feasibility of our approach through the simulation of a linear Ordinary Differential Equation (ODE), where initial conditions and parameters are encoded into quantum circuits using fixed-point representation. By executing sequences of quantum gates mimicking numerical integration steps, we obtain approximate solutions to the ODE with specified fixed-point precision.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Numerical methods for nonlocal and fractional models

Partial differential equations (PDEs) are used, with huge success, to model phenomena arising across all scientific and engineering disciplines. However, across an equally wide swath, there exist situations in which PDE models fail to adequately model observed phenomena or are not the best available model for that purpose. On the other hand, in many situations, nonlocal models that account for interaction occurring at a distance have been shown to more faithfully and effectively model observed phenomena that involve possible singularities and other anomalies. In this article, we consider a generic nonlocal model, beginning with a short review of its definition, the properties of its solution, its mathematical analysis, and specific concrete examples. We then provide extensive discussions about numerical methods, including finite element, finite difference, and spectral methods, for determining approximate solutions of the nonlocal models considered. In that discussion, we pay particular attention to a special class of nonlocal models that are the most widely studied in the literature, namely those involving fractional derivatives. The article ends with brief considerations of several modeling and algorithmic extensions which serve to show the wide applicability of nonlocal modeling.

97 MATHEMATICS AND COMPUTING↗

Reinforcement Learning-based Output Structured Feedback for Distributed Multi-Area Power System Frequency Control

Load frequency control (LFC) is a key factor to maintain the stable frequency in multi-area power systems. As the modern power systems evolve from centralized to decentralized paradigm, LFC needs to consider the decentralized scheme that considers limited information from the information-exchange graph for the generator control of each interconnected area. This paper aims to solve a data-driven constrained LQR problem with mean-variance risk constraints and output structured feedback, and applies this framework to solve the LFC problem in multi-area power systems. By reformulating the constrained optimization problem into a minimax problem, the stochastic gradient descent max-oracle (SGDmax) algorithm with zero-order policy gradient (ZOPG) is adopted to find the optimal feedback gain from the learning, while guaranteeing the convergence. In addition, to improve the adaptation of the proposed learning method to new or varying models, we construct an emulator grid that approximates the dynamics of a physical grid and performs training based on this model. Once the feedback gain is obtained from the emulator grid, it is applied to the physical grid with a robustness test to check whether the controller from the approximated emulator applies to the actual system. Numerical tests show that the obtained feedback controller can successfully control the frequency of each area, while mitigating the uncertainty from the loads, with reliable robustness that ensures the adaptability of the obtained feedback gain to the actual physical grid.

Kwon, Kyung-bin↗

Error Characteristics and Scale Dependence of Current Satellite Precipitation Estimates Products in Hydrological Modeling

Satellite precipitation estimates (SPEs) are promising alternatives to gauge observations for hydrological applications (e.g., streamflow simulation), especially in remote areas with sparse observation networks. However, the existing SPEs products are still biased due to imperfections in retrieval algorithms, data sources and post-processing, which makes the effective use of SPEs a challenge, especially at different spatial and temporal scales. In this study, we used a distributed hydrological model to evaluate the simulated discharge from eight quasi-global SPEs at different spatial scales and explored their potential scale effects of SPEs on a cascade of basins ranging from approximately 100 to 130,000 km 2 . The results indicate that, regardless of the difference in the accuracy of various SPEs, there is indeed a scale effect in their application in discharge simulation. Specifically, when the catchment area is larger than 20,000 km2, the overall performance of discharge simulation emerges an ascending trend with the increase of catchment area due to the river routing and spatial averaging. Whereas below 20,000 km 2 , the discharge simulation capability of the SPEs is more randomized and relies heavily on local precipitation accuracy. Our study also highlights the need to evaluate SPEs or other precipitation products (e.g., merge product or reanalysis data) not only at the limited station scale, but also at a finer scale depending on the practical application requirements. Here we have verified that the existing SPEs are scale-dependent in hydrological simulation, and they are not enough to be directly used in very fine scale distributed hydrological simulations (e.g., flash flood). More advanced retrieval algorithms, data sources and bias correction methods are needed to further improve the overall quality of SPEs.

DTVGM↗

Rapid Initial-State Preparation for the Quantum Simulation of Strongly Correlated Molecules

Studies on quantum algorithms for ground-state energy estimation often assume perfect ground-state preparation; however, in reality the initial state will have imperfect overlap with the true ground state. Here, we address that problem in two ways: by faster preparation of matrix-product-state (MPS) approximations and by more efficient filtering of the prepared state to find the ground-state energy. We show how to achieve unitary synthesis with a Toffoli complexity about 7 × lower than that in prior work and use that to derive a more efficient MPS-preparation method. For filtering, we present two different approaches: sampling and binary search. For both, we use the theory of window functions to avoid large phase errors and minimize the complexity. We find that the binary-search approach provides better scaling with the overlap at the cost of a larger constant factor, such that it will be preferred for overlaps less than about 0.003 . Finally, we estimate the total resources to perform ground-state energy estimation of Fe - S cluster systems, including the Fe Mo cofactor by estimating the overlap of different MPS initial states with potential ground states of the Fe Mo cofactor using an extrapolation procedure. With a modest MPS bond dimension of 4000 , our procedure produces an estimate of approximately 0.9 overlap squared with a candidate ground state of the Fe Mo cofactor, producing a total resource estimate of 7.3 × 10 10 Toffoli gates; neglecting the search over candidates and assuming the accuracy of the extrapolation, this validates prior estimates that have used perfect ground-state overlap. This presents an example of a practical path to prepare states of high overlap in a challenging-to-compute chemical system. Published by the American Physical Society 2025

Berry, Dominic W. (ORCID:0000000334461449)↗

An ICA-Based HVAC Load Disaggregation Method Using Smart Meter Data

This paper presents an independent component analysis (ICA) based unsupervised-learning method for heat, ventilation, and air-conditioning (HVAC) load disaggregation using row-resolution (i.e., 15 minutes) smart meter data. We first demonstrate that the electricity consumption profiles on mild-temperature days can be used to approximate the base load on hot days. A residual load profile can then be calculated by subtracting the mild-day load profile from the hot-day load profile. The residual load profiles are processed using ICA for HVAC load extraction. An optimization-based algorithm is proposed for post-adjustment of the ICA results, considering two bounding factors for enhancing the robustness of the ICA algorithm. First, we use the hourly HVAC energy bounds computed from the relationship between HVAC load and temperature to remove unrealistic HVAC load spikes. Second, we exploit the dependency between the daily nocturnal and diurnal loads extracted from historical meter data to smooth the base load profile. Pecan Street data with sub-metered HVAC data were used to test and verify the proposed methods. Simulation results demonstrated that the proposed method is computationally efficient and robust across multiple customers.

Kim, Hyeonjin↗

Scalable Algorithms for Inverse Problems With High-Dimensional Parameter Spaces

Inverse problems, which involve inferring unknown parameters from observed data, present significant computational challenges, especially in large-scale settings with high-dimensional unknown parameters and nonlinear relationships between the unknowns and observations. Bayesian inference provides an approach for addressing these problems, often relying on sequential sampling methods like Markov chain Monte Carlo (MCMC) to approximate the posterior distribution of the parameters. However, MCMC methods become computationally demanding as the dimensionality of the problem increases, particularly in large-scale systems where likelihood evaluations rely on solving partial differential equations (PDEs) on large spatial domains with finely resolved meshes. To overcome these limitations, recent advancements have focused on designing scalable computa tional techniques – for both PDE simulations and sampling strategies – to make Bayesian methods feasible for high-dimensional problems.

97 MATHEMATICS AND COMPUTING↗

Two-fluid physical modeling of superconducting resonators in the ARTEMIS framework

In this work, we implement a new London equation module for superconductivity in the GPU-enabled ARTEMIS framework, and couple it to a finite-difference time-domain solver for Maxwell's equations. We apply this two-fluid approach to model a superconducting coplanar waveguide (CPW) resonator. We validate our implementation by verifying that the theoretical skin depth and reflection coefficients can be obtained for several superconductive materials, with different London penetration depths, over a range of frequencies. Our convergence studies show that the algorithm is second-order accurate in both space and time, except at superconducting interfaces where the approach is spatially first-order. In our CPW simulations, we leverage the GPU scalability of our code to compare the two-fluid model to more traditional approaches that approximate superconducting behavior and demonstrate that superconducting physics can show comparable performance to the assumption of quasi-infinite conductivity as measured by the Q-factor.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Ab-Initio Investigation of Finite Size Effects in Rutile Titania Nanoparticles with Semilocal and Nonlocal Density Functionals

In this work, we employ hybrid and generalized gradient approximation (GGA) level density functional theory (DFT) calculations to investigate the convergence of surface properties and electronic gap of rutile titania nanoparticles with particle size. The surface energies and electronic gaps are calculated for cuboidal particles with minimum dimension ranging from 3.7 Angstrom (24 atoms) to 10.3 Angstrom (384 atoms) using a highly-parallel real-space DFT code to enable hybrid level DFT calculations of larger nanoparticles than are typically practical. We deconvolute the geometric and electronic finite size effects in surface energy, and evaluate the influence of defects on electronic gap and density of states (DOS). The electronic finite size effects in surface energy vanish when the minimum length scale of the nanoparticles becomes greater than 10 Angstrom. We show that this length scale is consistent with a computationally efficient numerical analysis of the characteristic length scale of electronic interactions. The surface energy of nanoparticles having minimum dimension beyond this characteristic length can be approximated using slab calculations that account for the geometric defects. In contrast, the finite size effects on the electronic gap and DOS is highly dependent on the shape and size of these particles. Furthermore, the DOS for cuboidal particles and more realistic particles constructed using the Wulff algorithm reveal that defect states within the electronic gap play a key role in determining the eigen value distribution of nanoparticles and the electronic gap does not converge to the bulk limit for the particle sizes investigated.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Laminography as a tool for imaging large-size samples with high resolution

Despite the increased brilliance of the new generation synchrotron sources, there is still a challenge with high-resolution scanning of very thick and absorbing samples, such as a whole mouse brain stained with heavy elements, and, extending further, brains of primates. Samples are typically cut into smaller parts, to ensure a sufficient X-ray transmission, and scanned separately. Compared with the standard tomography setup where the sample would be cut into many pillars, the laminographic geometry operates with slab-shaped sections significantly reducing the number of sample parts to be prepared, the cutting damage and data stitching problems. In this work, a laminography pipeline for imaging large samples (>1 cm) at micrometre resolution is presented. The implementation includes a low-cost instrument setup installed at the 2-BM micro-CT beamline of the Advanced Photon Source. Additionally, sample mounting, scanning techniques, data stitching procedures, a fast reconstruction algorithm with low computational complexity, and accelerated reconstruction on multi-GPU systems for processing large-scale datasets are presented. The applicability of the whole laminography pipeline was demonstrated by imaging four sequential slabs throughout an entire mouse brain sample stained with osmium, in total generating approximately 12 TB of raw data for reconstruction.

47 OTHER INSTRUMENTATION↗

Transverse energy–energy correlations of jets in the electron–proton deep inelastic scattering at HERA

We study the event shape variables, transverse energy–energy correlation TEEC (cosφ) and its asymmetry ATEEC (cosφ) in deep inelastic scattering (DIS) at the electron–proton collider HERA, where φ is the angle between two jets defined using a transverse-momentum (k T ) jet algorithm. At HERA, jets are defined in the Breit frame, and the leading nontrivial transverse energy–energy correlations arise from the 3-jet configurations. With the help of the NLOJET++, these functions are calculated in the leading order (LO) and the next-to-leading order (NLO) approximations in QCD at the electron–proton center-of-mass energy $\sqrt{s}$ = 314 GeV. We restrict the angular region to -0.8 ≤ cosφ ≤ 0.8, as the forward- and backward-angular regions require resummed logarithmic corrections, which we have neglected in this work. Following experimental jet-analysis at HERA, we restrict the DIS-variables x, y = Q 2 /(xs), where Q 2 = -q 2 is the negative of the momentum transfer squared q 2 , to 0 ≤ x ≤ 1, 0.2 ≤ y ≤ 0.6, and the pseudo-rapidity variable in the laboratory frame (η lab ) to the range -1 ≤ η lab ≤ 2.5. The TEEC and ATEEC functions are worked out for two ranges in Q 2 , defined by 5.5GeV 2 ≤ Q 2 ≤ 80GeV 2 , called the low-Q 2 -range, and 150GeV 2 ≤ Q 2 ≤ 1000GeV 2 , called the high-Q 2 -range. We show the sensitivity of these functions on the parton distribution functions (PDFs), the factorization (μ F ) and renormalization (μ R ) scales, and on α s (M$^2_Z$). Of these the correlations are stable against varying the scale μ F and the PDFs, but they do depend on μ R . For the choice of the scale μ R =$\sqrt{\langle ET \rangle^2+Q^2}$, advocated in earlier jet analysis at HERA, the shape variables TEEC and ATEEC are found perturbatively robust. These studies are useful in the analysis of the HERA data, including the determination of α s (M$^2_Z$) from the shape variables.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Development of online pulse-finding algorithms for the Mu2e Stopping Target Monitor and an evaluation of the signal to background ratio for the Mu2e stopped-muon rate determination

This thesis presents a determination of the acceptance of the Mu2e Stopping Target Monitor (STM) detector for both signal and background events. The rate of X-rays of a specific energy in the STM is used to determine the rate of stopped muons in the aluminium stopping target, which is used as the normalisation for all Mu2e measurements, particularly the branching ratio for a charged lepton flavour violating (cLFV) process. The acceptance for the 347\,keV $2p-1s$ aluminium signal X-ray is determined to be $(8.03 \pm 0.05) \times 10^{-10}$\,cm$^{-2}$ and the acceptance for the background photons (at 347\,keV) to be $(3.19 \pm 0.21) \times 10^{-8}$\,cm$^{-2}$. This results in a signal-to-background ratio of approximately two which is significantly higher than had previously been estimated. These signal-to-background rates are used to determine the time required to achieve a statistical uncertainty of 10\% on the number of 347\,keV X-rays as a function of the detector resolution and back ground rate. For a resolution of 2\,keV, and the background rate determined in this thesis, approximately one minute of data is required. The three corrections needed to be applied to the measured 347\,keV rate to determine the rate of stopped muons are also determined and potential sources of bias arising from the background shape, background fit range and energy calibration are investigated and found to be insignificant. The raw energy of the particles in the STM detector comes from a 16-bit ADC digitising at $\sim 300$\,MHz. It is not possible to store all the raw digitisations and online algorithms have been developed to rapidly select pulses in the detector and reconstruct their energy. The performance of these algorithms has been characterised with simulated data as a function of detector rate and resolution and optimum operating points for the algorithms have been defined. The integrity of the algorithms has also been demonstrated and characterised on test-beam data at high r ates and with radioactive sources at low rates.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Graphically Contracted Function Construction with the Recursive Pairwise Merge Algorithm

A new implementation of a recursive pairwise merge algorithm to construct a GCF from a list of CSF expansion coefficients is presented. The essential new feature is the preallocation of some work arrays used within the intermediate steps of the merge procedure. This results in roughly an order of magnitude improvement in overall efficiency and also approximately eliminates a factor of n, the molecular orbital dimension, from the original implementation. Initial application of this merge procedure to a series of H m molecules shows that the GCF wave functions can be represented well both with delocalized canonical Hartree-Fock orbitals and with localized molecular orbitals. Finally, for a given wave function complexity, as measured by the average facet count, $\bar{\text {f}}$, the delocalized Hartree-Fock orbitals show smaller errors for small $\bar{\text {f}}$ values, while the localized orbitals show smaller errors for larger $\bar{\text {f}}$ values.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

X-ray diffraction at the National Ignition Facility

We report details of an experimental platform implemented at the National Ignition Facility to obtain in situ powder diffraction data from solids dynamically compressed to extreme pressures. Thin samples are sandwiched between tamper layers and ramp compressed using a gradual increase in the drive-laser irradiance. Pressure history in the sample is determined using high-precision velocimetry measurements. Up to two independently timed pulses of x rays are produced at or near the time of peak pressure by laser illumination of thin metal foils. The quasi-monochromatic x-ray pulses have a mean wavelength selectable between 0.6 Å and 1.9 Å depending on the foil material. The diffracted signal is recorded on image plates with a typical 2 θ x-ray scattering angle uncertainty of about 0.2° and resolution of about 1°. Analytic expressions are reported for systematic corrections to 2 θ due to finite pinhole size and sample offset. A new variant of a nonlinear background subtraction algorithm is described, which has been used to observe diffraction lines at signal-to-background ratios as low as a few percent. Variations in system response over the detector area are compensated in order to obtain accurate line intensities; this system response calculation includes a new analytic approximation for image-plate sensitivity as a function of photon energy and incident angle. This experimental platform has been used up to 2 TPa (20 Mbar) to determine the crystal structure, measure the density, and evaluate the strain-induced texturing of a variety of compressed samples spanning periods 2–7 on the periodic table.

47 OTHER INSTRUMENTATION↗

Machine learning interatomic potential for silicon-nitride (Si 3 N 4 ) by active learning

Silicon nitride (Si 3 N 4 ) is an extensively used material in the automotive, aerospace, and semiconductor industries. However, its widespread use is in contrast to the scarce availability of reliable interatomic potentials that can be employed to study various aspects of this material on an atomistic scale, particularly its amorphous phase. In this work, we developed a machine learning interatomic potential, using an efficient active learning technique, combined with the Gaussian approximation potential (GAP) method. Our strategy is based on using an inexpensive empirical potential to generate an initial dataset of atomic configurations, for which energies and forces were recalculated with density functional theory (DFT); thereafter, a GAP was trained on these data and an iterative re-training algorithm was used to improve it by learning on-the-fly. When compared to DFT, our potential yielded a mean absolute error of 8 meV/atom in energy calculations for a variety of liquid and amorphous structures and a speed-up of molecular dynamics simulations by 3–4 orders of magnitude, while achieving a first-rate agreement with experimental results. Our potential is publicly available in an open-access repository.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Parallel-in-Time Solution of Scalar Nonlinear Conservation Laws

Here, we consider the parallel-in-time solution of scalar nonlinear conservation laws in one spatial dimension. The equations are discretized in space with a conservative finite-volume method using weighted essentially nonoscillatory (WENO) reconstructions, and in time with high-order explicit Runge–Kutta methods. The solution of the global, discretized space-time problem is sought via a nonlinear iteration that uses a novel linearization strategy in cases of nondifferentiable equations. Under certain choices of discretization and algorithmic parameters, the nonlinear iteration coincides with Newton’s method, although, more generally, it is a preconditioned residual correction scheme. At each nonlinear iteration, the linearized problem takes the form of a certain discretization of a linear conservation law over the space-time domain in question. An approximate parallel-in-time solution of the linearized problem is computed with a single multigrid reduction-in-time (MGRIT) iteration; however, any other effective parallel-in-time method could be used in its place. The MGRIT iteration employs a novel coarse-grid operator that is a modified conservative semi-Lagrangian discretization and generalizes those we have developed previously for nonconservative scalar linear hyperbolic problems. Numerical tests are performed for the inviscid Burgers and Buckley–Leverett equations. For many test problems, the solver converges in just a handful of iterations with a convergence rate independent of mesh resolution, including problems with (interacting) shocks and rarefactions.

97 MATHEMATICS AND COMPUTING↗

Star–Galaxy Image Separation with Computationally Efficient Gaussian Process Classification

Abstract We introduce a novel method for discerning optical telescope images of stars from those of galaxies using Gaussian processes (GPs). Although applications of GPs often struggle in high-dimensional data modalities such as optical image classification, we show that a low-dimensional embedding of images into a metric space defined by the principal components of the data suffices to produce high-quality predictions from real large-scale survey data. We develop a novel method of GP classification hyperparameter training that scales approximately linearly in the number of image observations, which allows for application of GP models to large-size Hyper Suprime-Cam Subaru Strategic Program data. In our experiments, we evaluate the performance of a principal component analysis embedded GP predictive model against other machine-learning algorithms, including a convolutional neural network and an image photometric morphology discriminator. Our analysis shows that our methods compare favorably with current methods in optical image classification while producing posterior distributions from the GP regression that can be used to quantify object classification uncertainty. We further describe how classification uncertainty can be used to efficiently parse large-scale survey imaging data to produce high-confidence object catalogs.

79 ASTRONOMY AND ASTROPHYSICS↗

Requirements, Status, and Plans for Track Reconstruction at the sPHENIX Experiment

sPHENIX is a new experiment that is being constructed at the Relativistic Heavy Ion Collider at Brookhaven National Laboratory. The primary physics goals of sPHENIX are to measure jets, their substructure, and the upsilon resonances in p+p, p+Au and Au+Au collisions. To realize these goals, a tracking system composed of a time projection chamber and several silicon detectors will be used to identify tracks that correspond to jets and upsilon decays. However, the sPHENIX experiment will collect approximately 200 PB of data utilizing a finite-sized computing center; thus, performing track reconstruction in a timely manner is a challenge due to the large occupancy of heavy-ion collisions. The sPHENIX experiment, its track reconstruction, and the need for implementing faster track-fitting algorithms, such as that provided by the A Common Tracking Software package, into the sPHENIX software stack are discussed.

Osborn, Joe↗