Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Bounds”

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 883 records · Page 49
All sourcesNASA NTRSDOE OSTI
DOE OSTI2020

Semi-adsorption-controlled growth window for half-Heusler FeVSb epitaxial films

The electronic, magnetic, thermoelectric, and topological properties of Heusler compounds (composition XYZ or X 2 YZ) are highly sensitive to stoichiometry and defects. Here we establish the existence and experimentally map the bounds of a semi-adsorption-controlled growth window for semiconducting half-Heusler FeVSb films, grown by molecular beam epitaxy (MBE). We show that due to the high volatility of Sb, the Sb stoichiometry is self-limiting for a finite range of growth temperatures and Sb fluxes, similar to the growth of III-V semiconductors such as GaSb and GaAs. Films grown within this window are nearly structurally indistinguishable by x-ray diffraction (XRD) and reflection high energy electron diffraction (RHEED). Here, the highest electron mobility and lowest background carrier density are obtained towards the Sb-rich bound of the window, suggesting that Sb vacancies may be a common defect. Similar semi-adsorption-controlled bounds are expected for other ternary intermetallics that contain a volatile species Z = {Sb, As, Bi}, e.g., CoTiSb, LuPtSb, GdPtBi, and NiMnSb. However, outstanding challenges remain in controlling the remaining Fe/V (X/Y) transition metal stoichiometry.

36 MATERIALS SCIENCE↗
DOE OSTI2024

Composite Qdrift-product formulas for quantum and classical simulations in real and imaginary time

Recent study has shown that it can be advantageous to implement a composite channel that partitions the Hamiltonian H for a given simulation problem into subsets A and B such that H = A + B , where the terms in A are simulated with a Trotter-Suzuki channel and the B terms are randomly sampled via the Qdrift algorithm. Here we extend Qdrift and composite product formulas to imaginary time, formulating candidate classical algorithms for quantum Monte Carlo calculations. We upper bound the induced Schatten- 1 → 1 norm on both imaginary-time Qdrift and composite channels. Another recent result demonstrated that simulations of lattice Hamiltonians containing geometrically local interactions can be improved using a Lieb-Robinson argument to decompose H into subsets that contain only terms supported on that subset of the lattice. Here, we provide a quantum algorithm by unifying this result with the composite approach into “local composite channels” and we upper bound the diamond distance. We provide exact numerical simulations of algorithmic cost by counting the number of gates of the form e − i H j t and e − H j β to meet a certain error tolerance ε . In doing so, we optimize the partitioning into sets A and B using gradient boosted tree models from machine learning. These numerical studies are important given that product formulas have been historically known to outperform analytic upper bounds. We show constant factor advantages for a variety of interesting Hamiltonians, the maximum of which is a ≈ 20 -fold speedup that occurs in the simulation of Jellium. Published by the American Physical Society 2024

Pocrnic, Matthew (ORCID:0000000203089376)↗
DOE OSTI2024

Optimal function estimation with photonic quantum sensor networks

The problem of optimally measuring an analytic function of unknown local parameters each linearly coupled to a qubit sensor is well understood, with applications ranging from field interpolation to noise characterization. Here we resolve a number of open questions that arise when extending this framework to Mach-Zehnder interferometers and quadrature displacement sensing. In particular, we derive lower bounds on the achievable mean square error in estimating a linear function of either local phase shifts or quadrature displacements. In the case of local phase shifts, these results prove, and somewhat generalize, a conjecture by Proctor []. For quadrature displacements, we extend proofs of lower bounds to the case of arbitrary linear functions. We provide optimal protocols achieving these bounds up to small (multiplicative) constants and describe an algebraic approach to deriving new optimal protocols, possibly subject to additional constraints. Using this approach, we prove necessary conditions for the amount of entanglement needed for any optimal protocol for both local phase and displacement sensing. Published by the American Physical Society 2024

Bringewatt, Jacob↗
DOE OSTI2024

Probing Postmeasurement Entanglement without Postselection

We study the problem of observing quantum collective phenomena emerging from large numbers of measurements. These phenomena are difficult to observe in conventional experiments because, in order to distinguish the effects of measurement from dephasing, it is necessary to postselect on sets of measurement outcomes with Born probabilities that are exponentially small in the number of measurements performed. An unconventional approach, which avoids this exponential “postselection problem”, is to construct cross-correlations between experimental data and the results of simulations on classical computers. However, these cross-correlations generally have no definite relation to physical quantities. We first show how to incorporate classical shadows into this framework, thereby allowing for the construction of quantum information-theoretic cross-correlations. We then identify cross-correlations that both upper and lower bound the measurement-averaged von Neumann entanglement entropy, as well as cross-correlations that lower bound the measurement-averaged purity and entanglement negativity. These bounds show that experiments can be performed to constrain postmeasurement entanglement without the need for postselection. To illustrate our technique, we consider how it could be used to observe the measurement-induced entanglement transition in Haar-random quantum circuits. We use exact numerical calculations as proxies for quantum simulations and, to highlight the fundamental limitations of classical memory, we construct cross-correlations with tensor-network calculations at finite bond dimension. Our results reveal a signature of measurement-induced criticality that can be observed using a quantum simulator in polynomial time and with polynomial classical memory. Published by the American Physical Society 2024

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2026

Predicting Adaptively Chosen Observables in Quantum Systems

Recent advances have demonstrated that 𝒪⁡(log 𝑀) measurements suffice to predict 𝑀 properties of arbitrarily large quantum many-body systems. However, these remarkable findings assume that the properties to be predicted are chosen independently of the data. This assumption can be violated in practice, where scientists adaptively select properties after looking at previous predictions. This work investigates the adaptive setting for three classes of observables: local, Pauli, and bounded-Frobenius-norm observables. We prove that Ω⁡(√𝑀) samples of an arbitrarily large unknown quantum state are necessary to predict expectation values of 𝑀 adaptively chosen local and Pauli observables, where the system size scales exponentially and polynomially in 𝑀, respectively. We also present computationally efficient algorithms that achieve this information-theoretic lower bound. In contrast, for bounded-Frobenius-norm observables, we devise an algorithm requiring only 𝒪⁡(log 𝑀) samples, independent of system size. These results highlight the potential pitfalls of adaptivity in analyzing data from quantum experiments and provide algorithmic tools to safeguard against erroneous predictions in quantum experiments.

Machine learning↗
DOE OSTI2024

How Much Reserve Fuel: Quantifying the Maximal Energy Cost of System Disturbances

Motivated by the design question of additional fuel needed to complete a task in an uncertain environment, this paper introduces metrics to quantify the maximal additional energy used by a control system in the presence of bounded disturbances, compared to a nominal, disturbance-free system. In particular, we consider the task of finite-time stabilization for a linear, time-invariant system. We compare the nominal energy required to achieve this task in the disturbance-free system to the worst-case energy over all feasible disturbances. Solving for the worst-case energy over all disturbances first leads to an optimal control problem with a least-squares solution, and then an infinite-dimensional optimization problem where we derive an upper bound on the solution. The comparison of energies is accomplished using additive and multiplicative metrics, for which we derive bounds. Simulation examples on an ADMIRE fighter jet model demonstrate the practicability of these metrics, and their variation with the distance of the initial condition from the origin and the task completion time.

koopman operator, resilience↗
DOE OSTI2021

Distributionally Safe Path Planning: Wasserstein Safe RRT

In this paper, we propose a Wasserstein metric-based random path planning algorithm. Wasserstein Safe RRT (W-Safe RRT) provides finite-sample probabilistic guarantees on the safety of a returned path in an uncertain obstacle environment. Vehicle and obstacle states are modeled as distributions based upon state and model observations. Additionally, we define limits on distributional sampling error so the Wasserstein distance between a vehicle state distribution and obstacle distributions can be bounded. This enables the algorithm to return safe paths with a confidence bound through combining finite sampling error bounds with calculations of the Wasserstein distance between discrete distributions. W-Safe RRT is compared against a baseline minimum encompassing ball algorithm, which ensures balls that minimally encompass discrete state and obstacle distributions do not overlap. The improved performance is verified in a 3D environment using single, multi, and rotating non-convex obstacle cases, with and without forced obstacle error in adversarial directions, showing that W-Safe RRT can handle poorly modeled complex environments.

42 ENGINEERING↗
DOE OSTI2020

Towards Feature-Preserving 2D and 3D Vector Field Compression

The objective of this work is to develop error-bounded lossy compression methods to preserve topological features in 2D and 3D vector fields. Specifically, we explore the preservation of critical points in piecewise linear vector fields. We define the preservation of critical points as, without any false positive, false negative, or false type change in the decompressed data, (1) keeping each critical point in its original cell and (2) retaining the type of each critical point (e.g., saddle and attracting node). The key to our method is to adapt a vertex-wise error bound for each grid point and to compress input data together with the error bound field using a modified lossy compressor. Our compression algorithm can be also embarrassingly parallelized for large data handling and in situ processing. We benchmark our method by comparing it with existing lossy compressors in terms of false positive/negative/type rates, compression ratio, and various vector field visualizations with several scientific applications.

critical points↗
DOE OSTI2023

Reliable Devices Yield Stable Quantum Computations

Stable quantum computation requires noisy results to remain bounded even in the presence of noise fluctuations. Yet non-stationary noise processes lead to drift in the varying characteristics of a quantum device that can greatly influence the circuit outcomes. Here we address how temporal and spatial variations in noise relate device reliability to quantum computing stability. First, our approach quantifies the differences in statistical distributions of characterization metrics collected at different times and locations using Hellinger distance. We then validate an analytical bound that relates this distance directly to the stability of a computed expectation value. Our demonstration uses numerical simulations with models informed by the washington superconducting transmon device. We find that the stability metric is consistently bounded from above by the corresponding Hellinger distance, which can be cast as a specified tolerance level. These results underscore the significance of reliable quantum computing devices and the impact for stable quantum computation.

Dasgupta, Samudra↗
DOE OSTI2021

Penetration Through Slots in Overmoded Cavities

A resonant cavity undergoes three distinct behaviors with increasing frequency: 1) fundamental modes, localized in frequency with well defined modal distribution; 2) undermoded region, where modes are still separated, but are sufficiently perturbed by small imperfections that their spectral positions (and distributions) are statistical in nature; and 3) overmoded region, where modes overlap, field distributions follow stochastic distributions, and the slot acts as if in free space. Understanding the penetration through slots in the overmoded region is of great interest, and is the focus of this article. Since full-wave solvers may not be able to provide a timely answer for very high frequencies due to a lack of memory and/or computation resources, we develop bounding methods to estimate worst-case average and maximum fields within the cavity. Finally, after discussing the bounding formulation, we compare its results to full-wave simulations at the first, second, and third resonance supported by the slot in the case of a cylindrical cavity. Note that the bounding formulation indicates that results are nearly independent of cavity shape: only the cavity volume, frequency, and cavity quality factor affect the overmoded region, making this formulation a powerful tool to assess electromagnetic interference and electromagnetic compatibility effects within cavities.

overmoded cavity↗
DOE OSTI2022

Interference Moral Hazard in Large Multihop Networks

Cooperation between network nodes is critical for supporting services in ad hoc networks. Cooperation, however, is an idealized assumption that may not always be present. This assumption can fail because of moral hazard, a scenario in part caused by misaligned incentives between the requesting node and supporting node. In this paper, we characterize a moral hazard that perversely incentivizes nodes to increase their routing payments by transmitting interference into the multi-hop network. We refer to this as the interference moral hazard (IMH) problem which is inherent to strategyproof mechanisms with low overpayments. We investigate IMH as a non-cooperative game played by network nodes on a random graph. For large networks, we show that IMH can be solved in the network design space. Finally, we provide sufficient conditions on the network distribution that guarantee an equilibrium path with interference-free play. This is achieved by 1) lower-bounding the number of nodes and 2) bounding the network density slightly above the 2-connectedness threshold and below a proposed upper-bound. Simulations suggest that density plays a fundamental role in IMH.

42 ENGINEERING↗
DOE OSTI2021

Unexpected Scaling of Peak Acceleration for a Yielding Mass-Spring System Subjected to a Triangular Base Acceleration Pulse

The use of bounding scenarios is a common practice that greatly simplifies the design and qualification of structures. However, this approach implicitly assumes that the quantities of interest increase monotonically with the input to the structure, which is not necessarily true for nonlinear structures. This paper surveys the literature for observations of nonmonotonic behavior of nonlinear systems and finds such observations in both the earthquake engineering and applied mechanics literature. Numerical simulations of a single degree-of-freedom mass-spring system with an elastic–plastic spring subjected to a triangular base acceleration pulse are then presented, and it is shown that the relative acceleration of this system scales nonmonotonically with the input magnitude in some cases. The equation of motion for this system is solved symbolically and an approximate expression for the relative acceleration is developed, which qualitatively agrees with the nonmonotonic behavior seen in the numerical results. The nonmonotonicity is investigated and found to be a result of dynamics excited by the discontinuous derivative of the base acceleration pulse, the magnitude of which scales nonmonotonically with the input magnitude due to the fact that the first yield of the spring occurs earlier as the input magnitude is increased. The relevance of this finding within the context of defining bounding scenarios is discussed, and it is recommended that modeling be used to perform a survey of the full range of possible inputs prior to defining bounding scenarios.

42 ENGINEERING↗
DOE OSTI2021

Pendellösung interferometry probes the neutron charge radius, lattice dynamics, and fifth forces

Setting bounds on a fifth force Some extensions to the Standard Model of particle physics posit the existence of a fifth force to complement the existing four fundamental forces. To set bounds on the strength of such an interaction, experiments on vastly different length scales have been performed. Heacock et al . used an unusual method called Pendellösung interferometry to measure the neutron structure factors of silicon. The momentum dependence of the structure factors enabled the researchers to put more stringent bounds on the strength of a type of fifth force called the Yukawa force, as well as measure the charge radius of the neutron. —JS

Science & Technology - Other Topics↗
DOE OSTI2021

A Bilevel Approach for Identifying the Worst Contingencies for Nonconvex Alternating Current Power Systems

We address the bilevel optimization problem of identifying the most critical attacks to an alternating current (AC) power flow network. The upper-level binary maximization problem consists of choosing an attack that is treated as a parameter in the lower-level defender minimization problem. Instances of the lower-level global minimization problem by themselves are NP-hard due to the nonconvex AC power flow constraints, and bilevel solution approaches commonly apply a convex relaxation or approximation to allow for tractable bilevel reformulations at the cost of underestimating some power system vulnerabilities. Our main contribution is to provide an alternative branch-and-bound algorithm whose upper bounding mechanism (in a maximization context) is based on a reformulation that avoids relaxation of the AC power flow constraints in the lower-level defender problem. Lower bounding is provided with semidefinite programming (SDP) relaxed solutions to the lower-level problem. We establish finite termination with guarantees of either a globally optimal solution to the original bilevel problem, or a globally optimal solution to the SDP-relaxed bilevel problem which is included in a vetted list of upper-level attack solutions, at least one of which is a globally optimal solution to the bilevel problem. We demonstrate through computational experiments applied to IEEE case instances both the relevance of our contribution, and the effectiveness of our contributed algorithm for identifying power system vulnerabilities without resorting to convex relaxations of the lower-level problem. We conclude with a discussion of future extensions and improvements.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

When Do Extended Physics-Informed Neural Networks (XPINNs) Improve Generalization?

Physics-informed neural networks (PINNs) have become a popular choice for solving high-dimensional partial differential equations (PDEs) due to their excellent approximation power and generalization ability. Recently, extended PINNs (XPINNs) based on domain decomposition methods have attracted considerable attention due to their effectiveness in modeling multiscale and multiphysics problems and their parallelization. However, theoretical understanding of their convergence and generalization properties remains unexplored. In this study, we take an initial step towards understanding how and when XPINNs outperform PINNs. Specifically, for general multilayer PINNs and XPINNs, we first provide a prior generalization bound via the complexity of the target functions in the PDE problem and a posterior generalization bound via the posterior matrix norms of the networks after optimization. Moreover, based on our bounds, we analyze the conditions under which XPINNs improve generalization. Concretely, our theory shows that the key building block of XPINN, namely, the domain decomposition, introduces a tradeoff for generalization. On the one hand, XPINNs decompose the complex PDE solution into several simple parts, which decreases the complexity needed to learn each part and boosts generalization. On the other hand, decomposition leads to less training data being available in each subdomain, and hence such a model is typically prone to overfitting and may become less generalizable. Empirically, we choose five PDEs to show when XPINNs perform better than, similar to, or worse than PINNs, hence demonstrating and justifying our new theory.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Asymptotic Relaxation of Moment Equations for a Multi-species, Homogeneous BGK Model

Multi-species BGK models describe the dynamics of rarefied gases with constituent particles of different elements or compounds with potentially nontrivial velocity distributions. Here, in this paper, moment equations for the bulk velocities, energies, and temperatures of a spatially homogeneous multi-species BGK model are examined. A key challenge in analyzing these equations is the fact that the collision frequencies are allowed to depend on the species temperatures, which allows for more realistic simulations of dilute gas flow. Therefore, a positive lower bound is established for the species temperatures. With this lower bound, a global existence and uniqueness of solutions to the coupled velocity-energy ODE system is established. The lower bound also enables a proof of exponential decay to a unique steady-state solution. Numerical results are presented to demonstrate how the bulk velocities and temperatures relax for large times.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Cold freeze out of superheavy dark matter and Hubble tension

We present a unified framework, the "X miracle", in which dark matter consists of superheavy, nonthermal X particles whose relic abundance is determined not by the conventional weak-scale, semi-relativistic ("hot") freeze-out of WIMPs, but by annihilation or decay occurring within the smallest and earliest gravitationally bound objects. Unlike thermal WIMPs, which decouple at velocities of order 0.3c with relic abundance ρ∞ set by weak-scale interactions, X particles are produced nonthermally with an initial overabun dance ρ ini >> ρ ∞ . They become nonrelativistic extremely early, redshift to ultra-cold velocities, allowing collapse into compact bound structures characterized by a novel quantum gravitational scale, r X = 4$\hbar$ 2 $/Gm^3_X$ = 10 −13 m $\hbar$$/m_Xc$, much larger than the Compton wavelength. The framework predicts a particle mass of 10 12 GeV and an enhanced cross section of 10 −21 m 3 /s. Overlapping particle wavefunctions in these compact structures drive annihilation or decay into additional radiation, leading to a "cold" freeze-out that converts most of ρ ini into radiation while leaving a relic density ρ ∞ . Solutions to the Boltzmann equation indicate that an extreme ("big") depletion, with only one particle in a billion surviving, yields an additional radiation contribution $ΔN_{eff}$ ≈ 0.4, which could help alleviate the Hubble tension. For particles of 10 12 GeV, the scenario predicts a dark coupling constant α X = 0.09 that is responsible for an instanton-induced decay process, consistent with current UHECR bounds. Early collapse at 10 −6 s may release binding energy as high-frequency (100kHz) gravitational waves or ultralight GUT-scale axions (10 −9 eV). Superheavy sterile neutrinos provide a natural particle realization, linking dark matter to neutrino mass and baryogenesis. If gravitationally produced, this framework favors high-scale inflation and effi cient reheating. The "X miracle" thus demonstrates that dark matter need not be weak-scale: gravitational dynamics can control freeze-out and evolution, producing multi-messenger observational signatures in UHECRs, axions, gravitational waves, and small-scale structures.

Xu, Zhijie Jay [Pacific Northwest National Laborat↗
DOE OSTI2021

Improved semiclassical model for real-time evaporation of matrix black holes

In this paper, we study real-time classical matrix mechanics of a simplified 2 × 2 matrix model inspired by the black hole evaporation problem. This is a step towards making a quantitative model of real-time evaporation of a black hole, which is realized as a bound state of D0-branes in string theory. The model we study is the reduction of Yang–Mills in 2 + 1 dimension to 0 + 1 dimensions, which has been corrected with an additional potential that can be interpreted as a zero-point energy for fermions. Our goal is to understand the lifetime of such a classical bound state object in the classical regime. To do so, we pay particular attention to when D-particles separate to check that the “off-diagonal modes” of the matrices become adiabatic and use that information to improve on existing models of evaporation. It turns out that the naive expectation value of the lifetime with the fermionic correction is infinite. This is a logarithmic divergence that arises from very large excursions in the separation between the branes near the threshold for classical evaporation. The adiabatic behavior lets us get some analytic control of the dynamics in this regime to get this estimate. This divergence is cutoff in the quantum theory due to quantization of the adiabatic parameter, resulting in a long lifetime of the bound state, with a parametric dependence of order log(1/ℏ).

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗