Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Error estimation”

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 577 records · Page 32
All sourcesNASA NTRSDOE OSTI
DOE OSTI2026

Stochastic Microgrid Scheduling With Chance‐Constrained Resilience Consideration

Traditionally, it is assumed that microgrids transition seamlessly from grid‐connected operation to islanded mode in the event of sudden main grid outages. In reality, the islanding process, especially unintentional islanding, is rarely seamless. Instead, it is subject to voltage and frequency fluctuations caused by the instantaneous disconnection of the point of common coupling (PCC) switch, variations in loads and renewable generation output and even the protection tripping of distributed energy resources (DERs). To mitigate these fluctuations and facilitate a smooth islanding process, we propose a stochastic microgrid scheduling model that incorporates chance‐constrained resilience measures. Specifically, the resilience measure is defined as the probability of successful islanding (PSI), that is, the probability that a microgrid can mitigate the generation‐demand imbalance caused by the disconnection of the PCC switch, variations in load and renewable generation and DER tripping. This measure is modelled using chance constraints. Unlike existing reliability and resilience indices, which typically neglect the possibility of microgrid/DER failure under extreme events and assume their survival while primarily focussing on reducing impact duration or magnitude, the proposed PSI‐based framework explicitly addresses microgrid and DER survival during the islanding transition. The formulated nonlinear chance constraints are approximated using a multiinterval approach and equivalently represented as a mixed‐integer linear programming (MILP) formulation. Case study results validate the proposed method, showing that the PSI estimation error is reduced to less than 8%, compared to approximately 28% with existing methods. Various sensitivity analyses on the DER tripping rate and PSI settings were performed to validate the robustness of the proposed method. In particular, the necessity of accounting for DER tripping in the PSI calculation was demonstrated.

chance constrained optimization↗
DOE OSTI2020

Rapid data-driven model reduction of nonlinear dynamical systems including chemical reaction networks using ℓ 1 -regularization

We develop a new data-driven paradigm for efficient model reduction of a broad class of nonlinear dynamical systems. Our model reduction method directly enables the interpretation of key components of the dynamical system, unlike traditional projection-based model reduction methods that focus on reducing computational complexity more than interpretability. Our method is not application specific and is simple to implement on nonlinear dynamical systems arising from a variety of different fields. It requires minimal parameterization using a single parameter to trade-off between model complexity and estimation error. We use a data-driven paradigm to formulate model reduction as an efficient convex optimization problem that scales polynomially in the original size of the complex system, enabling systems with as many as thousands of components to be reduced in a matter of minutes.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2021

Shock-ramp analysis test problem

Quasi-isentropic (ramp) compression is now a well-established experimental method and so are the analysis techniques to give Lagrangian sound speed, pressure, and density along the sample material's isentrope. A shock followed by ramp compression is a natural extension to investigate, for example, shock melt and refreeze on compression, or isentropes of states off the Hugoniot or principal isentrope. In practice, graded-density impactors produce initial shocks, compression by shaped laser pulses may be unable to produce a smooth pressure increase from zero, and incidental perturbations on the drive pulse may also give rise to shocks, so robust shock-ramp analysis methods will be needed. Appropriate analysis methods are needed for shock-ramp experiments, based on those for quasi-isentropic compression, and these require validation. This paper describes three different analyses of a shock-ramp test problem, including an assessment of their estimated errors. The methods tested were based on hydrodynamic characteristics or integration backward in space. All methods gave the known Lagrangian sound speed to within ~1%, and pressure and volume to within less than 2% and 1%, demonstrating that the analysis methods of isentropic compression experiments can be confidently extended to the analysis of shock and ramp compression.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
DOE OSTI2025

Demonstration of TOFFEE: A Response Uncertainty Quantification Tool

A key characteristic in neutron transport is nuclear data. Cross-section uncertainty is not used in MCNP6.3 to propagate response uncertainty without external analysis. Here, the TOol For Fast Error Estimation (TOFFEE) is a Python-based code developed to automate the propagation of cross-section uncertainty for MCNP evaluations. TOFFEE implements the sandwich rule to calculate the uncertainty from cross sections with sensitivity coefficients from MCNP6.3 and ENDF/B covariance data. In this paper, TOFFEE has been tested with benchmark experiments, and it has been compared to the uncertainty quantification capabilities of Sampler and TSUNAMI, within SCALE, to verify the application’s capabilities.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

SILIA: software implementation of a multi-channel, multi-frequency lock-in amplifier for spectroscopy and imaging applications

In this work, we describe a software implementation of a multi-channel, multi-frequency Lock-in Amplifier (SILIA) to extract modulated signals from noisy data distributed over multiple channels of arbitrary number and size. This software implementation emulates the functionality of a multi-channel, multi-frequency lock-in amplifier in a post-processing step following data acquisition. Unlike most traditional lock-in amplifiers, SILIA can work with any number of input channels and is especially useful to analyze data distributed over many channels. We demonstrate the versatility and performance for extracting weak signals in spectroscopy and fluorescence microscopy. We also discuss more general applications and exhibit a method to automatically estimate error from a lock-in result.

47 OTHER INSTRUMENTATION↗
DOE OSTI2020

Speeding up particle track reconstruction using a parallel Kalman filter algorithm

One of the most computationally difficult problems expected for the High-Luminosity Large Hadron Collider (HL-LHC) is determining the trajectory of charged particles during event reconstruction. Algorithms used at the LHC today rely on Kalman filtering, which builds physical trajectories incrementally while incorporating material effects and error estimation. Recognizing the need for faster computational throughput, we have adapted Kalman-filter-based methods for highly parallel, many-core SIMD architectures that are now prevalent in high-performance hardware. In this paper, we discuss the design and performance of the improved tracking algorithm, referred to as mkFit. A key piece of the algorithm is the Matriplex library, containing dedicated code to optimally vectorize operations on small matrices. The physics performance of the mkFit algorithm is comparable to the nominal CMS tracking algorithm when reconstructing tracks from simulated proton-proton collisions within the CMS detector. We study the scaling of the algorithm as a function of the parallel resources utilized and find large speedups both from vectorization and multi-threading. mkFit achieves a speedup of a factor of 6 compared to the nominal algorithm when run in a single-threaded application within the CMS software framework.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗
DOE OSTI2021

Measuring cosmological distances using cluster edges as a standard ruler

ABSTRACT The line-of-sight velocity dispersion profile of galaxy clusters exhibits a ‘kink’ corresponding to the spatial extent of orbiting galaxies. Because the spatial extent of a cluster is correlated with the amplitude of the velocity dispersion profile, we can utilize this feature as a gravity-calibrated standard ruler. Specifically, the amplitude of the velocity dispersion data allows us to infer the physical cluster size. Consequently, observations of the angular scale of the ‘kink’ in the profile can be translated into a distance measurement to the cluster. Assuming the relation between cluster radius and cluster velocity dispersion can be calibrated from simulations, we forecast that with existing data from the Sloan Digital Sky Survey we will be able to measure the Hubble constant with 3.0 per cent precision. Implementing our method with data from the Dark Energy Spectroscopic Instrument (DESI) will result in a 1.3 per cent measurement of the Hubble constant. Adding cosmological supernova data improves the uncertainty of the DESI measurement to 0.7 per cent. While these error estimates are statistical only, they provide strong motivation for pursuing the necessary simulation program required to characterize and calibrate the systematic uncertainties impacting our proposed measurement. Whether or not our proposed measurement can in fact result in competitive H0 constraints will depend on what the eventual systematics floor for this method is.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2023

Using angular two-point correlations to self-calibrate the photometric redshift distributions of DECaLS DR9

Calibrating the redshift distributions of photometric galaxy samples is essential in weak lensing studies. The self-calibration method combines angular auto- and cross-correlations between galaxies in multiple photometric redshift (photo-z) bins to reconstruct the scattering rates matrix between redshift bins. In this paper, we test a recently proposed self-calibration algorithm using the DECaLS Data Release 9 and investigate to what extent the scattering rates are determined. We first mitigate the spurious angular correlations due to imaging systematics by a machine learning based method. We then improve the algorithm for χ 2 minimization and error estimation. Finally, we solve for the scattering matrices, carry out a series of consistency tests, and find reasonable agreements: (1) finer photo-z bins return a high-resolution scattering matrix, and it is broadly consistent with the low-resolution matrix from wider bins; (2) the scattering matrix from the Northern Galactic Cap is almost identical to that from Southern Galactic Cap; (3) the scattering matrices are in reasonable agreement with those constructed from the power spectrum and the weighted spectroscopic subsample. We also evaluate the impact of cosmic magnification. Although it changes little the diagonal elements of the scattering matrix, it affects the off-diagonals significantly. The scattering matrix also shows some dependence on scale cut of input correlations, which may be related to a known numerical degeneracy between certain scattering pairs. In conclusion, this work demonstrates the feasibility of the self-calibration method in real data and provides a practical alternative to calibrate the redshift distributions of photometric samples.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2025

Ansatz-Free Hamiltonian Learning with Heisenberg-Limited Scaling

Learning the unknown interactions that govern a quantum system is crucial for quantum information processing, device benchmarking, and quantum sensing. The problem, known as Hamiltonian learning, is well understood under the assumption that interactions are local, but this assumption may not hold for arbitrary Hamiltonians. Previous methods all require high-order inverse polynomial dependency with precision, unable to surpass the standard quantum limit and reach the gold-standard Heisenberg-limited scaling. Whether Heisenberg-limited Hamiltonian learning is possible without prior assumptions about the interaction structures, a challenge we term ansatz-free Hamiltonian learning , remains an open question. In this work, we present a quantum algorithm to learn arbitrary sparse Hamiltonians without any structure constraints using only black-box queries of the system’s real-time evolution and minimal digital controls to attain Heisenberg-limited scaling in estimation error. Our method is also resilient to state-preparation-and-measurement errors, enhancing its practical feasibility. We numerically demonstrate our ansatz-free protocol for learning physical Hamiltonians and validating analog quantum simulations, benchmarking our performance against the state-of-the-art Heisenberg-limited learning approach. Moreover, we establish a fundamental trade-off between total evolution time and quantum control on learning arbitrary interactions, revealing the intrinsic interplay between controllability and total evolution-time complexity for any learning algorithm. These results pave the way for further exploration into Heisenberg-limited Hamiltonian learning in complex quantum systems under minimal assumptions, potentially enabling new benchmarking and verification protocols.

machine learning↗
DOE OSTI2020

Detectability of standing accretion shock instabilities activity in supernova neutrino signals

We introduce a novel methodology for establishing the presence of standing accretion shock instabilities (SASI) in the dynamics of a core collapse supernova from the observed neutrino event rate at water- or ice- based neutrino detectors. The methodology uses a likelihood ratio in the frequency domain as a test- statistics; it is also employed to assess the potential to estimate the frequency and the amplitude of the SASI modulations of the neutrino signal. The parameter estimation errors are consistent with the minimum possible errors as evaluated from the inverse of the Fisher information matrix, and close to the theoretical minimum for the SASI amplitude. Using results from a core-collapse simulation of a 15 solar-mass star by Kuroda et al. [Astrophys. J. 851, 62 (2017).] as a test bed for the method, we find that SASI can be identified with high confidence for a distance to the supernova of up to ~6 kpc for IceCube and up to ~3 kpc for a 0.4 Mt mass water Cherenkov detector. This methodology will aid the investigation of a future galactic supernova.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2022

Spectral density reconstruction with Chebyshev polynomials

Accurate calculations of the spectral density in a strongly correlated quantum many-body system are of fundamental importance to study its dynamics in the linear response regime. Typical examples are the calculation of inclusive and semiexclusive scattering cross sections in atomic nuclei and transport properties of nuclear and neutron star matter. Integral transform techniques play an important role in accessing the spectral density in a variety of nuclear systems. However, their accuracy is in practice limited by the need to perform a numerical inversion which is often ill-conditioned. Here, in the present work we extend a recently proposed quantum algorithm which circumvents this problem. We show how to perform controllable reconstructions of the spectral density over a finite energy resolution with rigorous error estimates. An appropriate expansion in Chebyshev polynomials allows for efficient simulations also on classical computers. We apply our idea to obtain the local density of states for graphene in a magnetic field as a proof of principle. This paves the way for future applications in nuclear and condensed matter physics.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2022

Asymptotic optimality of twist-untwist protocols for Heisenberg scaling in atom-based sensing

Twist-untwist protocols for quantum metrology consist of a serial application of (1) unitary nonlinear dynamics (e.g., spin squeezing or Kerr nonlinearity), (2) parameterized dynamics U ( φ ) (e.g., a collective rotation or phase space displacement), and (3) time reversed application of step 1. Such protocols are known to produce states that allow Heisenberg scaling for experimentally accessible estimators of φ even when the nonlinearities are applied for times much shorter than required to produce Schrödinger cat states. In this work, we prove that, asymptotically in the number of particles, twist-untwist protocols provide the lowest estimation error among quantum metrology protocols that utilize two calls to a weakly nonlinear evolution and a readout involving only first and second moments of a total spin operator n → · J → . We consider the following physical settings: all-to-all interactions generated by one-axis twisting J z 2 (e.g., interacting Bose gases), constant finite range spin-spin interactions of distinguishable or bosonic atoms (e.g., trapped ions or Rydberg atoms, or lattice bosons). In these settings, we further show that the optimal twist-untwist protocols asymptotically achieve 85% and 92% of the respective quantum Cramér-Rao bounds. We show that the error of a twist-untwist protocol can be decreased by a factor of L without an increase in the noise of the spin measurement if the twist-untwist protocol can be noiselessly iterated as an L layer quantum alternating operator ansatz.

74 ATOMIC AND MOLECULAR PHYSICS↗
DOE OSTI2021

Joint Matrix Completion and Compressed Sensing for State Estimation in Low-observable Distribution System

Limited measurement availability at the distribution grid presents challenges for state estimation and situational awareness. This paper combines the advantages of two sparsity-based state estimation approaches (matrix completion and compressive sensing) that have been proposed recently to address the challenge of unobservability. The proposed approach exploits both the low rank structure and a suitable transform domain representation to leverage the correlation structure of the spatio-temporal data matrix while incorporating the powerflow constraints of the distribution grid. Simulations are carried out on three phase unbalanced IEEE 37 test system to verify the effectiveness of the proposed approach. The performance results reveal - (1) the superiority over traditional matrix completion and (2) very low state estimation errors for high compression ratios representing very low observability.

Dahale, Shweta↗
DOE OSTI2026

Demand Response Under Stochastic, Price-Dependent User Behavior

This letter focuses on price-based demand response (DR) implemented through dynamic adjustments of electricity prices. It extends existing DR models to a stochastic framework in which customer response is represented by price-dependent random variables, leveraging models and tools from the theory of stochastic optimization with decision-dependent distributions. The inherent epistemic uncertainty in the customers' responses renders open-loop, model-based DR strategies impractical. We propose a stochastic, feedback-based pricing strategy to compensate for estimation errors and uncertainty in customer response, establish theoretical results demonstrating the stability and near-optimality of the proposed approach, and validate its effectiveness through numerical simulations.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗
DOE OSTI2023

A Voltage Inference Framework for Real-Time Observability in Active Distribution Grids

Active distribution grids are gaining traction to meet the growing environmental, socio-economic, and sustainability targets. Various advanced smart grid technologies facilitate the integration of Distributed Energy Resources (DERs) by supporting the bi-directional power flow. The limited observability of distribution grids, primarily related to their location at the very edge of power system infrastructure, brings challenges to optimal grid management. Moreover, only a limited number of measurements at regular intervals are usually available. This paper presents a novel inference framework, referred to as “Voltage Inference”, to overcome the observability issues. The proposed framework employs a prediction step based on the Multivariate Taylor series approximation, followed by a corrector step that minimizes the estimation error to infer the otherwise unknown voltages from the available measurements. Furthermore, numerical results on the IEEE 13-bus test feeder validate the accuracy and computational performance of the proposed framework.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2023

Real-Time Regional PV Spinning Reserve Estimator with AGC Look-Ahead Windows

Curtailed PV generation is a zero-marginal cost spinning reserve that can be used for a number of active power control services. However, unlike the traditional spinning reserve providers, i.e., fossil-fueled generators, who have well-defined operating characteristics, e.g., available headroom or potential high limit (PHL), PV plants have by nature variable and uncertain operating characteristics. To ensure the effective coordination between PV plants and the system operator during an active power control event, accurate forecasts of the PV PHL are essential. A novel reference-control grouping based scaling method has been proposed by NREL to estimate the PV PHL in real-time. This work further enhances the methodology by: 1) improving the model accuracy through machine learning; 2) considering look-ahead windows introduced by the computation and communication latencies; 3) applying the method to regional spinning reserve estimation. A significant performance improvement, over 99% of estimation error reduction, has been observed based on real-world data collected by CAISO and PV plant operators.

potential high limit↗
DOE OSTI2022

Traffic Signal Control With Adaptive Online-Learning Scheme Using Multiple-Model Neural Networks

This article proposes a new traffic signal control algorithm to deal with unknown-traffic-system uncertainties and reduce delays in vehicle travel time. Unknown-traffic-system dynamics are approximated using a recurrent neural network (NN). To accurately identify the traffic system model, an online-learning scheme is developed to switch among a set of candidate NNs (i.e., multiple-model NNs) based on their estimation errors. Then, a bank of optimal signal-timing controllers is designed based on the online identification of the traffic system. Simulation studies have been carried out for the obtained control strategies using multiple-model NNs, and the desired results have been obtained. Moreover, compared with the widely used actuated traffic signal control schemes, it is shown that the proposed method can reduce vehicle travel delays and improve traffic system robustness.

99 GENERAL AND MISCELLANEOUS↗
DOE OSTI2023

Progressive Tree-Based Compression of Large-Scale Particle Data

Scientific simulations and observations using particles have been creating large datasets that require effective and efficient data reduction to store, transfer, and analyze. However, current approaches either compress only small data well while being inefficient for large data, or handle large data but with insufficient compression. Toward effective and scalable compression/decompression of particle positions, we introduce new kinds of particle hierarchies and corresponding traversal orders that quickly reduce reconstruction error while being fast and low in memory footprint. Our solution to compression of large-scale particle data is a flexible block-based hierarchy that supports progressive, random-access, and error-driven decoding, where error estimation heuristics can be supplied by the user. For low-level node encoding, we introduce new schemes that effectively compress both uniform and densely structured particle distributions. Our proposed methods thus target all three phases of a tree-based particle compression pipeline, namely tree construction, tree traversal, and node encoding. In conclusion, the improved efficacy and flexibility of these methods over existing compressors are demonstrated through extensive experimentation, using a wide range of scientific particle datasets.

97 MATHEMATICS AND COMPUTING↗