SEARCH · Search NASA

Results for “Bounding Analysis”

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.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 73 records · Page 4

All sources NASA NTRS DOE OSTI

DOE OSTI2022

Constrained model calibration of grain structure dependent spall dynamics in shock-loaded tantalum

Here, we perform a gas gun experiment by shock loading tantalum samples of varying grain structures to assess the suitability of a numerical model for simulating spall behavior. The observed differences in spall strength, as well spallation and re-compression history, are not captured in uncalibrated hydrodynamic simulations. An optimization is performed on the Johnson spall model to determine the best parameters that fit the observed trends. Linear stability analysis is employed to motivate bounds on those parameters. Herein, optimized simulations agree well with the experimental results, reproducing pullback depth and recompression timescales across the different samples tested. Further, the observed pullback time of the single crystal sample was found to imply, via the stability analysis, a percolation threshold in good agreement with the theoretical value for a body centered cubic lattice. Therefore, the combined linear stability and percolation analysis shows promise and may be applied to other materials with diverse microstructures. Collectively, the findings demonstrate that the model is suitable for reproducing spall-induced free surface behavior across various microstructures, but also points to caution in using model coefficients for uncalibrated microstructures.

58 GEOSCIENCES↗

DOE OSTI2022

Very small-scale, segregating-fluidized-bed experiments: A dataset for CFD-DEM validation and uncertainty quantification

IWe report fluidization experiments were conducted on a small scale and with a rapid response (short duration) to enable corresponding simulations at low-computational cost. Rise times are reported for four or fewer polyethylene particles (intruders) in an air-fluidized bed of ~5000 group D glass beads. Experimental inputs were completely characterized—particle properties, system dimensions and operating conditions—which is necessary for validating computational fluid mechanics (CFD)-discrete element method (DEM) including a comprehensive uncertainty quantification (UQ) analysis. Input uncertainties are reported as bounds or cumulative distribution functions of measured values. The staggering number of simulations required to complete a UQ analysis (~O[10 4 ] simulations corresponding to ~5 uncertain inputs) motivates this study. These segregating-bed experiments are designed to permit analogous CFD-DEM simulations to complete in less than a day on a single (~2.5 GHz) computational processor unit (CPU). Segregation times are reported for several operating conditions, intruder sizes, and initial configurations, providing a rich dataset for numerical model testing, validation and UQ.

42 ENGINEERING↗

DOE OSTI2023

Pitfalls in the n -mode representation of vibrational potentials

Simulations of anharmonic vibrational motion rely on computationally expedient representations of the governing potential energy surface. The n-mode representation (n-MR)—effectively a many-body expansion in the space of molecular vibrations—is a general and efficient approach that is often used for this purpose in vibrational self-consistent field (VSCF) calculations and correlated analogues thereof. In the present analysis, a lack of convergence in many VSCF calculations is shown to originate from negative and unbound potentials at truncated orders of the n-MR expansion. For cases of strong anharmonic coupling between modes, the n-MR can both dip below the true global minimum of the potential surface and lead to effective single-mode potentials in VSCF that do not correspond to bound vibrational problems, even for bound total potentials. The present analysis serves mainly as a pathology report of this issue. Furthermore, this insight into the origin of VSCF non-convergence provides a simple, albeit ad hoc, route to correct the problem by “painting in” the full representation of groups of modes that exhibit these negative potentials at little additional computational cost. Somewhat surprisingly, this approach also reasonably approximates the results of the next-higher n-MR order and identifies groups of modes with particularly strong coupling. The method is shown to identify and correct problematic triples of modes—and restore SCF convergence—in two-mode representations of challenging test systems, including the water dimer and trimer, as well as protonated tropine.

Chemistry↗

DOE OSTI2022

Bounds of linear time‐varying systems with applications to quantify model gap of synchronous generators

Abstract Linear time‐varying (LTV) systems play a key role in many engineering problems, for example, trajectory sensitivity analysis of power systems. Because LTV systems do not generally have closed‐form solutions, estimates of their bounds are crucial to their analysis. In this paper, bounds for LTV systems with known inputs and unknown but bounded inputs are obtained via Grönwall's inequality. The estimated bounds are then used to quantify the gap between synchronous generators and their models in different scenarios through simulation.

42 ENGINEERING↗

DOE OSTI2021

Individual Wave Detection and Tracking within a Rotating Detonation Engine through Computer Vision Object Detection applied to High-Speed Images

Known for their simplistic design and continuous detonation, rotating detonation engines (RDEs) constitute a majority of current pressure gain combustion (PGC) research efforts. Experimental RDE operation times have been continuously extended through the use of rig cooling techniques. As the window of observable behavior is expanded, and as the technology matures toward eventual integration within gas turbines, monitoring techniques must evolve to better match industrial diagnostics. High-speed image analysis techniques prove useful to capture and evaluate the unsteady detonation behavior within the RDE. Traditional image analysis techniques, however, require extensive processing times which prohibit simultaneous monitoring. To better address this problem, a computer vision object detection methodology is proposed to quickly detect individual detonation waves within a single down-axis image. Detonation waves are detected in individual images by the implemented computer vision method You Only Look Once (YOLO) object detection network. In order to detect detonation waves, the network must first be trained using RDE images of interest, for which each required phase of network development is outlined. Detection of waves is improved through proper treatment of the collected image set, variation of Intersection over Union (IoU) and confidence thresholding, and through a parametric study of annotation dimensions. Each detected wave is described by its location and rotational direction, and locations are tracked to calculate wave velocity across each frame, leading to a timestep resolution of 20 µs. Wave velocities are also calculated through a series of frames, leading to a suitable average velocity estimation using as few as 10 frames. Uncertainty analysis accounting for variation in camera framerate, pixel width and annotation centroid locations estimates a total uncertainty of ±4.3% for velocity calculations, using the smallest annotation boxes. This method offers great reductions in processing times, as a step toward real-time monitoring of detonation waves within an RDE. Improving on previous studies, this technique is impartial to wave modes not included in the original training set and calculates wave velocities independent of high-speed pressure data. The ability to isolate waves within predicted bounding boxes will likely facilitate analysis of pixel intensity variation as an estimation of wave strength in future work.

Johnson, Kristyn↗

DOE OSTI2021

Individual Wave Detection and Tracking within a Rotating Detonation Engine through Computer Vision Object Detection applied to High-Speed Images

Johnson, Kristyn↗

DOE OSTI2025

Probabilistic Error Bounds for Low-Rank Tensor Decompositions Used in Large-Scale Data Analysis Applications (LDRD Final Report)

This report documents a research project on analyzing low-rank tensor models for data analysis that took place at Sandia National Laboratories from October 2023–September 2025. The focus of this work was to extend theoretical frameworks from statistics and probability theory for use with models for scalar, vector, and matrix data to models with tensor, or general multi-dimensional array, data. Through this work, we have provided a new set of tools for bounding errors on low-rank tensor models of both complete and sampled data. The remainder of this report is organized as follows. In Section 1, we describe the proposed work at the start of the project. Section 2 describes the research advances made as part of the project. Other research contributions in the form of conference presentations and software development is provided in Section 3. Workforce development at Sandia and Florida Atlantic University (via a subcontract on this project) is provided in Section 4.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2020

Analysis of a preQ1-I riboswitch in effector-free and bound states reveals a metabolite-programmed nucleobase-stacking spine that controls gene regulation

Abstract Riboswitches are structured RNA motifs that recognize metabolites to alter the conformations of downstream sequences, leading to gene regulation. To investigate this molecular framework, we determined crystal structures of a preQ1-I riboswitch in effector-free and bound states at 2.00 Å and 2.65 Å-resolution. Both pseudoknots exhibited the elusive L2 loop, which displayed distinct conformations. Conversely, the Shine-Dalgarno sequence (SDS) in the S2 helix of each structure remained unbroken. The expectation that the effector-free state should expose the SDS prompted us to conduct solution experiments to delineate environmental changes to specific nucleobases in response to preQ1. We then used nudged elastic band computational methods to derive conformational-change pathways linking the crystallographically-determined effector-free and bound-state structures. Pathways featured: (i) unstacking and unpairing of L2 and S2 nucleobases without preQ1—exposing the SDS for translation and (ii) stacking and pairing L2 and S2 nucleobases with preQ1—sequestering the SDS. Our results reveal how preQ1 binding reorganizes L2 into a nucleobase-stacking spine that sequesters the SDS, linking effector recognition to biological function. The generality of stacking spines as conduits for effector-dependent, interdomain communication is discussed in light of their existence in adenine riboswitches, as well as the turnip yellow mosaic virus ribosome sensor.

59 BASIC BIOLOGICAL SCIENCES↗

DOE OSTI2025

Quantum simulation of boson-related Hamiltonians: techniques, effective Hamiltonian construction, and error analysis

Elementary quantum mechanics proposes that a closed physical system consistently evolves in a reversible manner. However, control and readout necessitate the coupling of the quantum system to the external environment, subjecting it to relaxation and decoherence. Consequently, system-environment interactions are indispensable for simulating physically significant theories. A broad spectrum of physical systems in condensed-matter and high-energy physics, vibrational spectroscopy, and circuit and cavity QED necessitates the incorporation of bosonic degrees of freedom, such as phonons, photons, and gluons, into optimized fermion algorithms for near-future quantum simulations. In particular, when a quantum system is surrounded by an external environment, its basic physics can usually be simplified to a spin or fermionic system interacting with bosonic modes. Nevertheless, troublesome factors such as the magnitude of the bosonic degrees of freedom typically complicate the direct quantum simulation of these interacting models, necessitating the consideration of a comprehensive plan. This strategy should specifically include a suitable fermion/boson-to-qubit mapping scheme to encode sufficiently large yet manageable bosonic modes, and a method for truncating and/or downfolding the Hamiltonian to the defined subspace for performing an approximate but highly accurate simulation, guided by rigorous error analysis. In this pedagogical tutorial review, we aim to provide such an exhaustive strategy, focusing on encoding and simulating certain bosonic-related model Hamiltonians, inclusive of their static properties and time evolutions. Specifically, we emphasize two aspects: (1) the discussion of recently developed quantum algorithms for these interacting models and the construction of effective Hamiltonians, and (2) a detailed analysis regarding a tightened error bound for truncating the bosonic modes for a class of fermion-boson interacting Hamiltonians.

bosonic Hamiltonian↗

DOE OSTI2023

Modified Eigen-Decomposition-based Interval Analysis (MEDIA) for Power System Dynamic State Estimation

The Bayesian approach has been used for the dynamic state estimation (DSE) of a power system. However, due to the complexity of noise resources, it is difficult to quantify measurement and process noise using probability density functions (PDFs). To overcome the difficulty, the authors of this paper propose a modified eigen-decomposition-based interval analysis (MEDIA) method, which employs bounds instead of PDFs to quantify the noise, and uses the eigen decomposition method to reduce the negative impact of the overestimation problem. Using the simulation data generated from IEEE 16-machine and IEEE 10-machine systems, it is shown that the proposed MEDIA method can estimate the hard boundaries of dynamic states in real time. Furthermore, comparison with the forward-backward propagation method and the extended set-membership filter also shows that the proposed MEDIA method performs better by providing narrower boundaries in the DSE.

24 POWER TRANSMISSION AND DISTRIBUTION↗

DOE OSTI2024

Sparsity-Independent Lyapunov Exponent in the Sachdev-Ye-Kitaev Model

The saturation of a recently proposed universal bound on the Lyapunov exponent has been conjectured to signal the existence of a gravity dual. This saturation occurs in the low-temperature limit of the dense Sachdev-Ye-Kitaev (SYK) model, N Majorana fermions with q body ( q > 2 ) infinite-range interactions. We calculate certain out-of-time-order correlators (OTOCs) for N ≤ 64 fermions for a highly sparse SYK model and find no significant dependence of the Lyapunov exponent on sparsity up to near the percolation limit where the Hamiltonian breaks up into blocks. This provides strong support to the saturation of the Lyapunov exponent in the low-temperature limit of the sparse SYK. A key ingredient to reaching N = 64 is the development of a novel quantum spin model simulation library that implements highly optimized matrix-free Krylov subspace methods on graphical processing units. This leads to a significantly lower simulation time as well as vastly reduced memory usage over previous approaches, while using modest computational resources. Strong sparsity-driven statistical fluctuations require both the use of a much larger number of disorder realizations with respect to the dense limit and a careful finite size scaling analysis. The saturation of the bound in the sparse SYK points to the existence of a gravity analog that would enlarge substantially the number of field theories with this feature. Published by the American Physical Society 2024

Physics↗

DOE OSTI2025

Limitations of Fault-Tolerant Quantum Linear System Solvers for Quantum Power Flow

Quantum computers hold promise for solving problems intractable for classical computers, especially those with high time or space complexity. Practical quantum advantage can be said to exist for such problems when the end-to-end time for solving such a problem using a classical algorithm exceeds that required by a quantum algorithm. Reducing the power flow (PF) problem into a linear system of equations allows for the formulation of quantum PF (QPF) algorithms, which are based on solving methods for quantum linear systems such as the Harrow-Hassidim-Lloyd (HHL) algorithm. Speedup from using QPF algorithms is often claimed to be exponential when compared to classical PF solved by state-of-the-art algorithms. Here, we investigate the potential for practical quantum advantage in solving QPF compared to classical methods on gate-based quantum computers. Notably, this paper does not present a new QPF solving algorithm but scrutinizes the end-to-end complexity of the QPF approach, providing a nuanced evaluation of the purported quantum speedup in this problem. Our analysis establishes a best-case bound for the HHL-based quantum power flow complexity, conclusively demonstrating that the HHL-based method has higher runtime complexity compared to the classical algorithm for solving the direct current power flow (DCPF) and fast decoupled load flow (FDLF) problem. Notably, our analysis and conclusions can be extended to any quantum linear system solver with rigorous performance guarantees, based on the known complexity lower bounds for this problem. Additionally, we establish that for potential practical quantum advantage (PQA) to exist it is necessary to consider DCPF-type problems with a very narrow range of condition number values and readout requirements.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗

DOE OSTI2021

The impact of development priorities on power system expansion planning in sub-Saharan Africa

Sub-Saharan Africa faces unique barriers to electricity development due to the large proportion of the population that is un-electrified and the prevalence of rural populations. Typically, power system expansion planning models assume all potential consumers can be immediately electrified. This assumption is unrealistic in sub-Saharan Africa, where electrification will likely be a gradual process over a number of years. Furthermore, since a large proportion of the population in sub-Saharan Africa is located in rural regions, the prioritization of these regions may impact how the grid develops. In this research, we develop a multi-period optimization model for power generation and transmission system expansion planning in sub-Saharan Africa. In contrast to existing models, which assume full electrification, we consider a variety of electrification policies and analyze the impact of varying the electrification rate and policy on the cost and resources selected for power system expansion. We test our model on a case study of Rwanda. We find that varying the year in which full electrification is reached has a larger impact on cost and generation capacity than varying the electrification policy does, although, when urban and rural regions are considered equitably, more rooftop solar is built. Varying the electrification policies has a larger impact on transmission expansion than on generation expansion and this impact is amplified when starting from zero initial system capacity rather than the original Rwanda system. Additionally, a sensitivity analysis shows that tightening the bounds on CO 2eq emissions has a large impact on the generation portfolio and cost.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2020

The Adjoint Petrov–Galerkin method for non-linear model reduction

Here, we formulate a new projection-based reduced-order modeling technique for non-linear dynamical systems. The proposed technique, which we refer to as the Adjoint Petrov–Galerkin (APG) method, is derived by decomposing the generalized coordinates of a dynamical system into a resolved coarse-scale set and an unresolved fine-scale set. A Markovian finite memory assumption within the Mori–Zwanzig formalism is then used to develop a reduced-order representation of the coarse scales. This procedure leads to a closed reduced-order model that displays commonalities with the adjoint stabilization method used in finite elements. The formulation is shown to be equivalent to a Petrov–Galerkin method with a non-linear, time-varying test basis, thus sharing some similarities with the Least-Squares Petrov–Galerkin method. Theoretical analysis examining a priori error bounds and computational cost is presented. Numerical experiments on the compressible Navier–Stokes equations demonstrate that the proposed method can lead to improvements in numerical accuracy, robustness, and computational efficiency over the Galerkin method on problems of practical interest. Improvements in numerical accuracy and computational efficiency over the Least-Squares Petrov–Galerkin method are observed in most cases.

42 ENGINEERING↗

DOE OSTI2021

Exploratory analysis and performance prediction of big data transfer in High-performance Networks

Big data transfer in large-scale scientific and business applications is increasingly carried out over connections with guaranteed bandwidth provisioned in High-performance Networks (HPNs) via advance bandwidth reservation. Provisioning agents need to carefully schedule data transfer requests, compute network paths, and allocate appropriate bandwidths. Such reserved bandwidths, if not fully utilized, could be simply wasted due to the exclusive access during the approved time window, and cause extra overhead and complexity for resource management. This calls for accurate performance prediction to reserve bandwidths that match actual needs and avoid over-provisioning. We employ machine learning algorithms to predict big data transfer performance based on extensive performance measurements collected in the past several years from data transfer tests using different protocols and toolkits between various end sites on several real-life physical or emulated testbeds. We first analyze the performance patterns in response to a comprehensive list of parameters in end-host systems, network connections, and data transfer applications, which motivate the use of machine learning and also help us identify the effects of latent factors. We then propose threshold- and clustering-based methods to eliminate negative effects of latent factors in data preprocessing and build a robust performance predictor based on customized domain-oriented loss functions. The performance of the proposed methods is verified by extensive experiments using SVR and RFR as well as theoretical analysis of the general performance bound.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2025

Architectures and random properties of symplectic quantum circuits

Parametrized and random unitary (or orthogonal) n-qubit circuits play a central role in quantum information. As such, one could naturally assume that circuits implementing symplectic transformations would attract similar attention. However, this is not the case, as $\mathbb{SP}(d/2)$—the group of d × d unitary symplectic matrices—has thus far been overlooked. In this work, we aim at starting to fill this gap. We begin by presenting a universal set of generators $\mathcal{G}$ for the symplectic algebra $\mathfrak{sp}(d/2)$, consisting of one- and two-qubit Pauli operators acting on neighboring sites in a one-dimensional lattice. Here, we uncover two critical differences between such set, and equivalent ones for unitary and orthogonal circuits. Namely, we find that the operators in $\mathcal{G}$ cannot generate arbitrary local symplectic unitaries and that they are not translationally invariant. We then review the Schur–Weyl duality between the symplectic group and the Brauer algebra, and use tools from Weingarten calculus to prove that Pauli measurements at the output of Haar random symplectic circuits can converge to Gaussian processes. As a by-product, such analysis provides us with concentration bounds for Pauli measurements in circuits that form t-designs over $\mathbb{SP}(d/2)$. To finish, we present tensor-network tools to analyze shallow random symplectic circuits, and we use these to numerically show that computational-basis measurements anti-concentrate at logarithmic depth.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

DOE OSTI2021

Origins of electronic bands in the antiferromagnetic topological insulator MnBi 2 Te 4

Despite the rapid progress in understanding the first intrinsic magnetic topological insulator MnBi 2 Te 4 , its electronic structure remains a topic under debates. In this work, we perform a thorough spectroscopic investigation into the electronic structure of MnBi 2 Te 4 via laser-based angle-resolved photoemission spectroscopy. Through quantitative analysis, we estimate an upper bound of 3 meV for the gap size of the topological surface state. Furthermore, our circular dichroism measurements reveal band chiralities for both the topological surface state and quasi-2D bands, which can be well reproduced in a band hybridization model. A numerical simulation of energy-momentum dispersions based on a four-band model with an additional step potential near the surface provides a promising explanation for the origin of the quasi-2D bands. Our study represents a solid step forward in reconciling the existing controversies in the electronic structure of MnBi 2 Te 4 , and provides an important framework to understand the electronic structures of other relevant topological materials MnBi 2n Te 3n+1 .

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

DOE OSTI2022

Real-Time Distribution System State Estimation with Asynchronous Measurements

We report state estimation is a fundamental task in power systems. Although distribution systems are increasingly equipped with sensing devices and smart meters, measurements are typically reported at different rates and asynchronously; these aspects pose severe strains on workhorse state estimation algorithms, which are designed to process batches of data collected in a synchronous manner from all the measurement units. In this paper, we develop a novel state estimation algorithm to continuously update the estimate of the state based on measurements received in an asynchronous manner from measurement units. The synthesis of the algorithm hinges on a proximal-point type method, implemented in an online fashion, and capable of processing measurements received sequentially from sensors. A performance analysis is presented by providing bounds on the estimation error in terms of the mean and variance that hold at each iteration and asymptotically. The scheme is also compared with a more traditional Weighted Least Squares estimator that compensates for the lack of measurement data by using, as pseudo measurements, the measurement retrieved during a certain time window. Numerical simulations on the IEEE 37-bus feeder corroborate the analytical findings.

24 POWER TRANSMISSION AND DISTRIBUTION↗