Search NASA⌕ Search

SEARCH · Search NASA

Results for “lower 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 127 records · Page 7
All sourcesNASA NTRSDOE OSTI
DOE OSTI2020

High energy modular bootstrap, global symmetries and defects

We derive Cardy-like formulas for the growth of operators in different sectors of unitary 2 dimensional CFT in the presence of topological defect lines by putting an upper and lower bound on the number of states with scaling dimension in the interval [Δ – δ, Δ + δ] for large Δ at fixed δ. Consequently we prove that given any unitary modular invariant 2D CFT symmetric under finite global symmetry G (acting faithfully), all the irreducible representations of G appear in the spectra of the untwisted sector; the growth of states is Cardy like and proportional to the “square” of the dimension of the irrep. In the Schwarzian limit, the result matches onto that of JT gravity with a bulk gauge theory. If the symmetry is non-anomalous, the result applies to any sector twisted by a group element. For c > 1, the statements are true for Virasoro primaries. Furthermore, the results are applicable to large c CFTs. We also extend our results for the continuous U(1) group.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2024

Security of quantum position-verification limits Hamiltonian simulation via holography

We investigate the link between quantum position-verification (QPV) and holography established in [1] using holographic quantum error correcting codes as toy models. By inserting the “temporal” scaling of the AdS metric by hand via the bulk Hamiltonian interaction strength, we recover a toy model with consistent causality structure. This leads to an interesting implication between two topics in quantum information: if position-based verification is secure against attacks with small entanglement then there are new fundamental lower bounds for resources required for one Hamiltonian to simulate another.

AdS-CFT Correspondence↗
DOE OSTI2021

A low-energy perspective on the minimal left-right symmetric model

We perform a global analysis of the low-energy phenomenology of the minimal left-right symmetric model (mLRSM) with parity symmetry. We match the mLRSM to the Standard Model Effective Field Theory Lagrangian at the left-right-symmetry breaking scale and perform a comprehensive fit to low-energy data including mesonic, neutron, and nuclear β -decay processes, Δ F = 1 and Δ F = 2 CP-even and -odd processes in the bottom and strange sectors, and electric dipole moments (EDMs) of nucleons, nuclei, and atoms. We fit the Cabibbo-Kobayashi-Maskawa and mLRSM parameters simultaneously and determine a lower bound on the mass of the right-handed W R boson. In models where a Peccei-Quinn mechanism provides a solution to the strong CP problem, we obtain $ {M}_{W_R} $ ≳ 5 . 5 TeV at 95% C.L. which can be significantly improved with next-generation EDM experiments. In the P -symmetric mLRSM without a Peccei-Quinn mechanism we obtain a more stringent constraint $ {M}_{W_R} $ ≳ 17 TeV at 95% C.L., which is difficult to improve with low-energy measurements alone. In all cases, the additional scalar fields of the mLRSM are required to be a few times heavier than the right-handed gauge bosons. We consider a recent discrepancy in tests of first-row unitarity of the CKM matrix. We find that, while TeV-scale W R bosons can alleviate some of the tension found in the V ud,us determinations, a solution to the discrepancy is disfavored when taking into account other low-energy observables within the mLRSM.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2022

134 billion intersecting brane models

The landscape of string vacua is very large, but generally expected to be finite in size. Enumerating the number and properties of the vacua is an important task for both the landscape and the swampland, in part to gain a deeper understanding of what is possible and “generic”. We obtain an exact counting of distinct intersecting brane vacua of type IIA string theory on the T 6 /Z 2 × Z 2 orientifold. Care is taken to only count gauge-inequivalent brane configurations. Leveraging the recursive nature by which branes may be added together one-by-one, we use dynamic programming to efficiently count the number of solutions of the tadpole, K-theory and supersymmetry consistency conditions. The distributions of 4D gauge group rank and complex structure moduli for the entire ensemble of intersecting brane vacua are presented. The methods we developed here may be useful in obtaining sharp upper and lower bounds on other corners of the landscape.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2022

Sharpening the Distance Conjecture in diverse dimensions

The Distance Conjecture holds that any infinite-distance limit in the scalar field moduli space of a consistent theory of quantum gravity must be accompanied by a tower of light particles whose masses scale exponentially with proper field distance ||$\phi$|| as m ~ exp(–λ||$\phi$||), where λ is order-one in Planck units. While the evidence for this conjecture is formidable, there is at present no consensus on which values of λ are allowed. In this paper, we propose a sharp lower bound for the lightest tower in a given infinite-distance limit in d dimensions: λ ≥ $1/\sqrt{d-2}$. In support of this proposal, we show that (1) it is exactly preserved under dimensional reduction, (2) it is saturated in many examples of string/M-theory compactifications, including maximal supergravity in d = 4 – 10 dimensions, and (3) it is saturated in many examples of minimal supergravity in d = 4 – 10 dimensions, assuming appropriate versions of the Weak Gravity Conjecture. We argue that towers with λ < $1/\sqrt{d-2}$ discussed previously in the literature are always accompanied by even lighter towers with λ ≥ $1/\sqrt{d-2}$, thereby satisfying our proposed bound. We discuss connections with and implications for the Emergent String Conjecture, the Scalar Weak Gravity Conjecture, the Repulsive Force Conjecture, large-field inflation, and scalar field potentials in quantum gravity. In particular, we argue that if our proposed bound applies beyond massless moduli spaces to scalar fields with potentials, then accelerated cosmological expansion cannot occur in asymptotic regimes of scalar field space in quantum gravity.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2024

Reflected entropy in random tensor networks. Part III. Triway cuts

For general random tensor network states at large bond dimension, we prove that the integer Rényi reflected entropies (away from phase transitions) are determined by minimal triway cuts through the network. This generalizes the minimal cut description of bipartite entanglement for these states. A natural extrapolation away from integer Rényi parameters, suggested by the triway cut problem, implies the holographic conjecture S R = 2EW, where S R is the reflected entropy and EW is the entanglement wedge cross-section. Minimal triway cuts can be formulated as integer programs which cannot be relaxed to find a dual maximal flow/bit-thread description. This sheds light on the gap between the existence of tripartite entanglement in holographic states and the bipartite entanglement structure motivated by bit-threads. In particular, we prove that the Markov gap that measures tripartite entanglement is lower bounded by the integrality gap of the integer program that computes the triway cut.

AdS-CFT correspondence↗
DOE OSTI2020

Eigenfrequency constrained topology optimization of finite strain hyperelastic structures

This paper incorporates hyperelastic materials, nonlinear kinematics, and preloads in eigenfrequency constrained density–based topology optimization. The formulation allows for initial finite deformations and subsequent small harmonic oscillations. The optimization problem is solved by the method of moving asymptotes, and the gradients are calculated using the adjoint method. Both simple and degenerate eigenfrequencies are considered in the sensitivity analysis. A well-posed topology optimization problem is formulated by filtering the volume fraction field. Numerical issues associated with excessive distortion and spurious eigenmodes in void regions are reduced by removing low volume fraction elements. The optimization objective is to maximize stiffness subject to a lower bound on the fundamental eigenfrequency. Numerical examples show that the eigenfrequencies drastically change with the load magnitude, and that the optimization is able to produce designs with the desired fundamental eigenfrequency.

42 ENGINEERING↗
DOE OSTI2020

Uncertainty amplification due to density/refractive index gradients in background-oriented schlieren experiments

Here, we theoretically analyze the effect of density/refractive index gradients on the measurement precision of background-oriented schlieren (BOS) experiments by deriving the Cramer–Rao lower bound (CRLB) for the 2D centroid estimation process. A model is derived for the diffraction limited image of a dot viewed through a medium containing density gradients that includes the effect of the experimental parameters such as the magnification and f-number. It is shown using the model that nonlinearities in the density gradient field lead to blurring of the dot image. This blurring amplifies the effect of image noise on the centroid estimation process, leading to an increase in the CRLB and a decrease in the measurement precision. The ratio of position uncertainties of a dot in the reference and gradient images is shown to be a function of the ratio of the dot diameters and dot intensities. We termed this parameter the amplification ratio (A F ), and a methodology for reporting position uncertainties in tracking-based BOS measurements is proposed. The theoretical predictions of the dot position estimation variance from the CRLB are compared to ray tracing simulations, and agreement is obtained. The uncertainty amplification is also demonstrated on experimental BOS images of flow induced by a spark discharge, where it is seen that regions of high amplification ratio correspond to regions of density gradients. This analysis elucidates the dependence of the position uncertainty on density and refractive index gradient-induced distortion parameters, provides a methodology for accounting its effect on uncertainty quantification and provides a framework for optimizing experiment design.

42 ENGINEERING↗
DOE OSTI2021

Flowback Test Analyses at the Utah Frontier Observatory for Research in Geothermal Energy (FORGE) Site

Abstract In 2017 and 2019, injection testing was carried out in three zones in a vertical well in granite at the Frontier Observatory for Research in Geothermal Energy site near Milford, Utah, USA. In several injection cycles, flowback was implemented rather than shut-in. The goal was to explore an alternative to prolonged shut-in periods for inferring closure stress, formation compressibility, and formation permeability (permeability thickness product). The flowback procedures involved a cyclic flowback/shut-in, while pressure decreased. The flowback data are presented, and analyses are shown. The inferred closure stress(es) from flowback analyses are lower than for equivalent injection cycles that were strictly shut-in. Relatively high formation compressibility obtained from the flowback analyses indicates an extensive, fractured system. This study also includes numerical simulation of the flowback events. The numerical model shows that the rebound pressure is not necessarily the lower bound of the minimum principal stress. The signature of stiffness change can be identified as the process when the depletion mainly transitions from hydraulic fracture to natural fractures from numerical analysis. Overall, flowback potentially has advantages over shut-in because of the reduced time to closure.

15 GEOTHERMAL ENERGY↗
DOE OSTI2025

McCormick envelopes in mixed-integer PDE-constrained optimization

McCormick envelopes are a standard tool for deriving convex relaxations of optimization problems that involve polynomial terms. Such McCormick relaxations provide lower bounds, for example, in branch-and-bound procedures for mixed-integer nonlinear programs but have not gained much attention in PDE-constrained optimization so far. This lack of attention may be due to the distributed nature of such problems, which on the one hand leads to infinitely many linear constraints (generally state constraints that may be difficult to handle) in addition to the state equation for a pointwise formulation of the McCormick envelopes and renders bound-tightening procedures that successively improve the resulting convex relaxations computationally intractable. We analyze McCormick envelopes for a model problem class that is governed by a semilinear PDE involving a bilinearity and integrality constraints. We approximate the nonlinearity and in turn the McCormick envelopes by averaging the involved terms over the cells of a partition of the computational domain on which the PDE is defined. This yields convex relaxations that underestimate the original problem up to an a priori error estimate that depends on the mesh size of the discretization. These approximate McCormick relaxations can be improved by means of an optimization-based bound-tightening procedure. We show that their minimizers converge to minimizers to a limit problem with a pointwise formulation of the McCormick envelopes when driving the mesh size to zero. We provide a computational example, for which we certify all of our imposed assumptions. The results point to both the potential of the methodology and the gaps in the research that need to be closed. Our methodology provides a framework first for obtaining pointwise underestimators for nonconvexities and second for approximating them with finitely many linear inequalities in an infinite-dimensional setting.

Approximations and Expansions↗
DOE OSTI2024

Interpreting test temperature and loading rate effects on the fracture toughness of polymer-metal interfaces via time–temperature superposition

Here, in this letter, we present interfacial fracture toughness data for a polymer-metal interface where tests were conducted at various test temperatures T and loading rates $\dot{δ}$. An adhesively bonded asymmetric double cantilever beam (ADCB) specimen was utilized to measure toughness. ADCB specimens were created by bonding a thinner, upper adherend to a thicker, lower adherend (both 6061 T6 aluminum) using a thin layer of epoxy adhesive, such that the crack propagated along the interface between the thinner adherend and the epoxy layer. The specimens were tested at T from 25 to 65 °C and $\dot{δ}$ from 0.002 to 0.2 mm/s. The measured interfacial toughness Γ increased as both T and $\dot{δ}$ increased. For an ADCB specimen loaded at a constant $\dot{δ}$, the energy release rate G increases as the crack length a increases. For this reason, we defined rate effects in terms of the rate of change in the energy release rate $\dot{G}$. Although not rigorously correct, a formal application of time–temperature superposition (TTS) analysis to the Γ data provided useful insights on the observed dependencies. In the TTS-shifted data, Γ decreased and then increased for monotonically increasing $\dot{G}$. Thus, the TTS analysis suggests that there is a minimum value of Γ. This minimum value could be used to define a lower bound in Γ when designing critical engineering applications that are subjected to T and $\dot{δ}$ excursions.

36 MATERIALS SCIENCE↗
DOE OSTI2022

Portable C++ Code that can Look and Feel Like Fortran Code with Yet Another Kernel Launcher (YAKL)

This paper introduces the Yet Another Kernel Launcher (YAKL) C++ portability library, which strives to enable user-level code with the look and feel of Fortran code. The intended audience includes both C++ developers and Fortran developers unfamiliar with C++. The C++ portability approach is briefly explained, YAKL’s main features are described, and code examples are given that demonstrate YAKL’s usage. YAKL fills a niche capability important particularly to scientific applications seeking to port Fortran code quickly to a portable C++ library. YAKL places heavy emphasis on simplicity, readability, and productivity with performance mainly emphasizing Graphics Processing Units (GPUs). Central to YAKL’s ability to allow Fortran-like user-level code are three features: (1) a multi-dimensional Array class that allows Fortran behavior; (2) a limited library of Fortran intrinsic functions; and (3) an efficient pool allocator that transparently enables cheap frequent allocations and deallocations of YAKL Arrays. While YAKL allows Fortran-style code, it also allows Arrays that exhibit C-like behavior as well, including row-major index ordering and lower bounds of “0”. YAKL currently supports CPUs, CPU threading, and Nvidia, AMD, and Intel GPUs.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

The Cauchy Problem for Boltzmann Bi-linear Systems: The Mixing of Monatomic and Polyatomic Gases

Abstract From a unified vision of vector valued solutions in weighted Banach spaces, this paper establishes the existence and uniqueness for space homogeneous Boltzmann bi-linear systems with conservative collisional forms arising in complex gas dynamical structures. This broader vision is directly applied to dilute multi-component gas mixtures composed of both monatomic and polyatomic gases. Such models can be viewed as extensions of scalar Boltzmann binary elastic flows, as much as monatomic gas mixtures with disparate masses and single polyatomic gases, providing a unified approach for vector valued solutions in weighted Banach spaces. Novel aspects of this work include developing the extension of a general ODE theory in vector valued weighted Banach spaces, precise lower bounds for the collision frequency in terms of the weighted Banach norm, energy identities, angular or compact manifold averaging lemmas which provide coerciveness resulting into global in time stability, a new combinatorics estimate for p -binomial forms producing sharper estimates for the k -moments of bi-linear collisional forms. These techniques enable the Cauchy problem improvement that resolves the model with initial data corresponding to strictly positive and bounded initial vector valued mass and total energy, in addition to only a $$2^+$$ 2 + moment determined by the hard potential rates discrepancy, a result comparable in generality to the classical Cauchy theory of the scalar homogeneous Boltzmann equation.

Physics↗
DOE OSTI2022

Approximate recoverability and relative entropy II: 2-positive channels of general von Neumann algebras

Abstract We generalize our results in paper I in this series to quantum channels between general von Neumann algebras, proving the approximate recoverability of states which undergo a small change in relative entropy through the channel. To this end, we derive a strengthened form of the quantum data processing inequality for the change in relative entropy of two states under a channel between two von Neumann algebras. Compared to the usual inequality, there is an explicit lower bound involving the fidelity between the original state and a recovery channel.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Decomposing a renewable energy design and dispatch model

We address a mixed-integer linear programming model which selects a cost-minimizing set of available technologies with which to design a renewable energy system and prescribe their associated dispatch decisions. Realistically sized instances of such models pose computational challenges. To this end, we develop a Lagrangian heuristic based on a decomposition methodology which partitions the model into blocks and optimizes these more manageable, smaller subproblems. It also provides a lower bound to assess solution quality. In conclusion, we apply this methodology to the National Renewable Energy Laboratory's Renewable Energy Integration and Optimization (REopt TM ) model to generate near-optimal solutions to realistic instances containing, on average, approximately 300,000 variables and at least as many constraints, with a mean 30% optimality gap improvement using a five-minute solution time limit, compared to directly solving the original monolith.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Support of Adhesion Mechanisms in Al 2 O 3 Aerosol Deposition Through Laser-Induced Particle Impact Testing

Aerosol deposition (AD) is a kinetic spray process capable of depositing ceramic coatings at room temperature, but AD process development is generally a laborious exploration of a large process parameter space. Here, this paper presents a case study investigating whether laser-induced particle impact testing (LIPIT) could be applied to expedite development of an alumina (Al 2 O 3 ) coating on nickel (Ni): Specifically, whether LIPIT measurements could predict critical velocities of adhesion on Ni and Al 2 O 3 , and the effect of ball milling the Al 2 O 3 powder. Because LIPIT has a diffraction-limited lower bound on imageable particle size, the usefulness of Al 2 O 3 powder agglomerates as a proxy for single particles was additionally studied. Overall, LIPIT measurements and AD sprays agreed that ball milling dramatically improves adhesion. Additionally, LIPIT measurements of critical velocity of adhesion of Al 2 O 3 powder agglomerates on Ni and Al 2 O 3 substrates (150 meters per second [m/s] and 250 m/s, respectively) quantitatively agreed with predictions from a previously published model based on picoindentation and molecular dynamics simulations. Together, these findings support the established hypothesis that Al 2 O 3 adheres via a dislocation-mediated mechanism in AD, that Al 2 O 3 powder agglomerates adhere as individual constituent particles rather than collectively, and that, for this case study, LIPIT measurements were predictive of AD process parameters.

Al2O3↗
DOE OSTI2026

Relaxations of the steady optimal gas flow problem for a non-Ideal gas

Natural gas ranks second in U.S. primary energy consumption. Because most production sites are remote, gas must be transported through pipeline networks equipped with compressors, valves, and other components. For both economic efficiency and system reliability, it is desirable to operate these networks optimally. The governing physics across pipeline components entails nonlinear, non-convex equality and inequality constraints, and the most general steady-flow operations problem is a Mixed-Integer Nonlinear Program (MINLP).This work focuses on one such steady-flow problem-the Optimal Gas Flow (OGF) for a natural gas pipeline network-which minimizes production cost subject to the steady-flow physics. For day-to-day operations, the ability to quickly compute a globally optimal solution and a strong lower bound for varying demand profiles is crucial. A promising strategy is to build tight relaxations of the OGF’s nonlinear constraints. However, many nonlinearities arising from non-ideal equations of state either lack relaxations or have relaxations that do not scale to realistic network sizes. We address this gap by combining recent advances in polyhedral relaxations for univariate functions to construct tight, computationally efficient relaxations of the OGF with a non-ideal equation of state. These relaxations solve within seconds on a standard laptop. In conclusion, we demonstrate their quality through extensive numerical experiments on very large-scale test networks from the literature and find that the proposed approach proves optimality in 92% of tested instances.

03 NATURAL GAS↗
DOE OSTI2024

Bi-fidelity variational auto-encoder for uncertainty quantification

Quantifying the uncertainty of quantities of interest (QoIs) from physical systems is a primary objective in model validation. However, achieving this goal entails balancing the need for computational efficiency with the requirement for numerical accuracy. To address this trade-off, we propose a novel bi-fidelity formulation of variational auto-encoders (BF-VAE) designed to estimate the uncertainty associated with a QoI from low-fidelity (LF) and high-fidelity (HF) samples of the QoI. Here, this model allows for the approximation of the statistics of the HF QoI by leveraging information derived from its LF counterpart. Specifically, we design a bi-fidelity auto-regressive model in the latent space which is integrated within the VAE’s probabilistic encoder–decoder structure. An effective algorithm is proposed to maximize the variational lower bound of the HF log-likelihood in the presence of limited HF data, resulting in the synthesis of HF realizations with a reduced computational cost. Additionally, we introduce the concept of the bi-fidelity information bottleneck (BF-IB) to provide an information-theoretic interpretation of the proposed BF-VAE model. Our numerical results demonstrate that the BF-VAE leads to considerably improved accuracy, as compared to a VAE trained using only HF data, when limited HF data is available.

42 ENGINEERING↗