Search NASA⌕ Search

SEARCH · Search NASA

Results for “Generalization 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 379 records · Page 21
All sourcesNASA NTRSDOE OSTI
DOE OSTI2021

Spent Nuclear Fuel Mechanical Loads in the General Package Drop Scenario

The US Department of Energy Spent Fuel and Waste Science and Technology program is performing research to determine the mechanical loading conditions applied to spent nuclear fuel (SNF) during normal conditions of transportation to inform mechanical tests of SNF and close an important knowledge gap related to the practical disposition of SNF in the US. A recent multi-national collaborative test campaign measured SNF assembly impact response to the 30 cm horizontal package drop scenario, which is a common regulatory basis test of SNF package design. Researchers at Pacific Northwest National Laboratory (PNNL) are using the test data to validate explicit finite element models to calculate the mechanical loads and structural response of spent nuclear fuel assemblies in the as-tested 30 cm horizontal package drop scenario. Once the as-tested package drop model is validated, the next step is to apply the model to the general 30 cm drop scenario, which includes all impact angles, all fuel assembly types, and all burnup conditions. PNNL is developing a damage model that will incorporate the results of finite element parametric studies to establish trends in SNF mechanical loading to various input parameters, like impact orientation and burnup. The damage model will have the capability to estimate mechanical loads for any single set of input parameters, but it will first be used to describe the upper bounds of potential SNF loading in the 30 cm drop scenario. This paper describes PNNL’s progress toward developing the general solution to the problem of spent nuclear fuel mechanical loads in the 30 cm package drop scenario and it describes the next steps in closing the knowledge gap.

Klymyshyn, Nicholas A.↗
DOE OSTI2021

A Rényi quantum null energy condition: proof for free field theories

The Quantum Null Energy Condition (QNEC) is a lower bound on the stress-energy tensor in quantum field theory that has been proved quite generally. It can equivalently be phrased as a positivity condition on the second null shape derivative of the relative entropy S rel (ρ||σ) of an arbitrary state ρ with respect to the vacuum σ. The relative entropy has a natural one-parameter family generalization, the Sandwiched Rényi divergence S n (ρ||σ), which also measures the distinguishability of two states for arbitrary n &isin; [1/2, ∞). A Rényi QNEC, a positivity condition on the second null shape derivative of S n (ρ||σ), was conjectured in previous work. In this work, we study the Rényi QNEC for free and superrenormalizable field theories in spacetime dimension d > 2 using the technique of null quantization. In the above setting, we prove the Rényi QNEC in the case n > 1 for arbitrary states. We also provide counterexamples to the Rényi QNEC for n < 1.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2021

Phase transitions from the fifth dimension

We study the cosmological transition of 5D warped compactifications, from the high-temperature black-brane phase to the low-temperature Randall-Sundrum I phase. The transition proceeds via percolation of bubbles of IR-brane nucleating from the black-brane horizon. The violent bubble dynamics can be a powerful source of observable stochastic gravitational waves. While bubble nucleation is non-perturbative in 5D gravity, it is amenable to semiclassical treatment in terms of a “bounce” configuration interpolating between the two phases. We demonstrate how such a bounce configuration can be smooth enough to maintain 5D effective field theory control, and how a simple ansatz for it places a rigorous lower-bound on the transition rate in the thin-wall regime, and gives plausible estimates more generally. When applied to the Hierarchy Problem, the minimal Goldberger-Wise stabilization of the warped throat leads to a slow transition with significant supercooling. We demonstrate that a simple generalization of the Goldberger-Wise potential modifies the IR-brane dynamics so that the transition completes more promptly. Supercooling determines the dilution of any (dark) matter abundances generated before the transition, potentially at odds with data, while the prompter transition resolves such tensions. We discuss the impact of the different possibilities on the strength of the gravitational wave signals. Via AdS/CFT duality the warped transition gives a theoretically tractable holographic description of the 4D Composite Higgs (de)confinement transition. Our generalization of the Goldberger-Wise mechanism is dual to, and concretely models, our earlier proposal in which the composite dynamics is governed by separate UV and IR RG fixed points. The smooth 5D bounce configuration we introduce complements the 4D dilaton/radion dominance derivation presented in our earlier work.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2021

The Markov gap for geometric reflected entropy

The reflected entropy S R (A : B) of a density matrix ρ AB is a bipartite correlation measure lower-bounded by the quantum mutual information I(A : B). In holographic states satisfying the quantum extremal surface formula, where the reflected entropy is related to the area of the entanglement wedge cross-section, there is often an order-N 2 gap between S R and I. We provide an information-theoretic interpretation of this gap by observing that S R - I is related to the fidelity of a particular Markov recovery problem that is impossible in any state whose entanglement wedge cross-section has a nonempty boundary; for this reason, we call the quantity S R - I the Markov gap. We then prove that for time-symmetric states in pure AdS 3 gravity, the Markov gap is universally lower bounded by log(2)ℓ AdS /2G N times the number of endpoints of the cross-section. We provide evidence that this lower bound continues to hold in the presence of bulk matter, and comment on how it might generalize above three bulk dimensions. Finally, we explore the Markov recovery problem controlling S R - I using fixed area states. This analysis involves deriving a formula for the quantum fidelity — in fact, for all the sandwiched Rényi relative entropies — between fixed area states with one versus two fixed areas, which may be of independent interest. We discuss, throughout the paper, connections to the general theory of multipartite entanglement in holography.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2020

Ultrafast Relaxations in Ruthenium Polypyridyl Chromophores Determined by Stochastic Kinetics Simulations

Maximizing the efficiency of solar energy conversion using dye assemblies rests on understanding where the energy goes following absorption. Transient spectroscopies in solution are useful for this purpose, and the time-resolved data are usually analyzed with a sum of exponentials. This treatment assumes that dynamic events are well separated in time, and that the resulting exponential prefactors and phenomenological lifetimes are related directly to primary physical values. Such assumptions break down for coincident absorption, emission, and excited state relaxation that occur in transient absorption and photoluminescence of tris(2,2'-bipyridine)ruthenium(2+) derivatives, confounding the physical meaning of the reported lifetimes. Here, we use inductive modeling and stochastic chemical kinetics to develop a detailed description of the primary ultrafast photophysics in transient spectroscopies of a series of Ru dyes, as an alternative to sums of exponential analysis. Commonly invoked three-level schemes involving absorption, intersystem crossing (ISC), and slow nonradiative relaxation and incoherent emission to the ground state cannot reproduce the experimentally measured spectra. The kinetics simulations reveal that ultrafast decay from the singlet excited state manifold to the ground state competes with ISC to the triplet excited state, whose efficiency was determined to be less than unity. The populations predicted by the simulations are used to estimate the magnitudes of transition dipoles for excited state excitations and evaluate the influence of specific ligands. The mechanistic framework and methodology presented here are entirely general, applicable to other dye classes, and can be extended to include charge injection by molecules bound to semiconductor surfaces.

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

Fast Solution of Fully Implicit Runge--Kutta and Discontinuous Galerkin in Time for Numerical PDEs, Part II: Nonlinearities and DAEs

Fully implicit Runge--Kutta (IRK) methods have many desirable accuracy and stability properties as time integration schemes, but high-order IRK methods are not commonly used in practice with large-scale numerical PDEs because of the difficulty of solving the stage equations. This paper introduces a theoretical and algorithmic framework for solving the nonlinear equations that arise from IRK methods (and discontinuous Galerkin discretizations in time) applied to nonlinear numerical PDEs, including PDEs with algebraic constraints. Several new linearizations of the nonlinear IRK equations are developed, offering faster and more robust convergence than the often-considered simplified Newton, as well as an effective preconditioner for the true Jacobian if exact Newton iterations are desired. Inverting these linearizations requires solving a set of block 2 x 2 systems. Under quite general assumptions, it is proven that the preconditioned 2 x 2 operator's condition number is bounded by a small constant close to one, independent of the spatial discretization, spatial mesh, and time step, and with only weak dependence on the number of stages or integration accuracy. Moreover, the new method is built using the same preconditioners needed for backward Euler-type time stepping schemes, so can be readily added to existing codes. The new methods are applied to several challenging fluid flow problems, including the compressible Euler and Navier--Stokes equations, and the vorticity-streamfunction formulation of the incompressible Euler and Navier--Stokes equations. Up to 10th-order accuracy is demonstrated using Gauss IRK, while in all cases fourth-order Gauss IRK requires roughly half the number of preconditioner applications as required by standard Singly diagonally implicit Runge--Kutta methods.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1986

Chaos and nonlinear dynamics of single-particle orbits in a magnetotaillike magnetic field

The properties of charged-particle motion in Hamiltonian dynamics are studied in a magnetotaillike magnetic field configuration. It is shown by numerical integration of the equation of motion that the system is generally nonintegrable and that the particle motion can be classified into three distinct types of orbits: bounded integrable orbits, unbounded stochastic orbits, and unbounded transient orbits. It is also shown that different regions of the phase space exhibit qualitatively different responses to external influences. The concept of 'differential memory' in single-particle distributions is proposed. Physical implications for the dynamical properties of the magnetotail plasmas and the possible generation of non-Maxwellian features in the distribution functions are discussed.

Chen, J.↗
NASA NTRS1992

Structure of merger remnants. I - Bulgeless progenitors

The study examines mergers of identical galaxies consisting of self-gravitating disks and halos in the context of the suggestion that such events may form elliptical galaxies. It is shown that the luminous remnants of such mergers do indeed share many common properties with observed ellipticals. Specifically, the end states of the simulations considered rotate slowly in regions of relatively high surface density, having typical values of less than about 0.2 there. Morphologically, the remnants display a variety of structures, including shells and loops comprising loosely bound material and boxy and disky isophotes. The luminous matter is well-fitted by ellipsoidal generalizations of Hernquists's (1990, 1992) model for elliptical galaxies, implying that the surface brightness profiles are essentially de Vaucouleurs-like over a large radial interval. It is proposed that mergers of pure stellar disks do not represent an attractive mechanism for the production of massive elliptical galaxies.

Hernquist, Lars↗
NASA NTRSDate not supplied

Seeing is Believing: Monitoring Future Time Temporal Logic

Runtime monitors for future-time unbounded temporal logics like RVLTL, LTL 3 and FLTL, have double-exponential (2^2^n) worst-case space complexity bounds in size of the input formula. The semantics of these logics require monitors to perform general satisfiability solving for LTL expressions, a well-studied problem whose computational complexity is NP-hard and PSPACE-complete. This paper introduces an unbounded future-time linear temporal logic defined over a lattice. We call our logic an incremental temporal logic as it can be viewed as incrementally constructing proofs about the trace. On this account, we view online runtime monitoring as a decision procedure for proofs systems about incrementally growing traces. We demonstrate that our incremental temporal logic allows monitor construction to void satisfiability solving while still soundly detecting when the property is violated in an online fashion. This enables asymptotic improvements in space complexity. As proof, we provide a procedure to construct monitors that utilize linear space and time in the size of the input formula, while remaining constant in the size of the input stream and suitable for online monitoring. We further demonstrate, through several examples, that our incremental temporal logic is straightforward to adopt and practical for runtime verification.

temporal logic↗
DOE OSTI2024

Compressing branch-and-bound trees

A branch-and-bound (BB) tree certifies a dual bound on the value of an integer program. In this work, we introduce the tree compression problem (TCP): Given a BB tree T that certifies a dual bound, can we obtain a smaller tree with the same (or stronger) bound by either (1) applying a different disjunction at some node in T or (2) removing leaves from T? Here we believe such post-hoc analysis of BB trees may assist in identifying helpful general disjunctions in BB algorithms. We initiate our study by considering computational complexity and limitations of TCP. We then conduct experiments to evaluate the compressibility of realistic branch-and-bound trees generated by commonly-used branching strategies, using both an exact and a heuristic compression algorithm.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS2008

Sparse Regression as a Sparse Eigenvalue Problem

We extend the l0-norm "subspectral" algorithms for sparse-LDA [5] and sparse-PCA [6] to general quadratic costs such as MSE in linear (kernel) regression. The resulting "Sparse Least Squares" (SLS) problem is also NP-hard, by way of its equivalence to a rank-1 sparse eigenvalue problem (e.g., binary sparse-LDA [7]). Specifically, for a general quadratic cost we use a highly-efficient technique for direct eigenvalue computation using partitioned matrix inverses which leads to dramatic x103 speed-ups over standard eigenvalue decomposition. This increased efficiency mitigates the O(n4) scaling behaviour that up to now has limited the previous algorithms' utility for high-dimensional learning problems. Moreover, the new computation prioritizes the role of the less-myopic backward elimination stage which becomes more efficient than forward selection. Similarly, branch-and-bound search for Exact Sparse Least Squares (ESLS) also benefits from partitioned matrix inverse techniques. Our Greedy Sparse Least Squares (GSLS) generalizes Natarajan's algorithm [9] also known as Order-Recursive Matching Pursuit (ORMP). Specifically, the forward half of GSLS is exactly equivalent to ORMP but more efficient. By including the backward pass, which only doubles the computation, we can achieve lower MSE than ORMP. Experimental comparisons to the state-of-the-art LARS algorithm [3] show forward-GSLS is faster, more accurate and more flexible in terms of choice of regularization

Exact Sparse Least Squares (ESLS)↗
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↗
NASA NTRS1987

A general form for the dissipation length scale in turbulent shear flows

It has been found that, for a wide range of turbulent wall-bounded shear flows with mean velocity profile U(y), the scale length L-epsilon determining the dissipation is approximately described in terms of distance from the wall (y), the mean shear (dU/dy), and the variance of the normal component of turbulence (bar u-squared), by the formula: L-epsilon to the -1 power is approximately equal to (A sub B / y) + A sub S (dU/dy / square root of bar u-squared) where L-epsilon = epsilon/(bar u-squared) to the 3/2 power. To match with shear-free boundary layers, A sub B is approximately 0.27, and to match with the log layer, A sub S is approximately 0.46. The shear flows tested here were: boundary layers over a flat plate, sink flow, oscillatory flow, and channel flow. The use of the square root of bar u-squared as a velocity scale minimizes the effects of Reynolds number. However, the formula fails within a distance of order L-epsilon for the regions where dU/dy = 0.

Hunt, J. C. R.↗
DOE OSTI2025

Covariant Quantum Error-Correcting Codes with Metrological Entanglement Advantage

Here, we show that a subset of the basis for the irreducible representations of a tensor-product SU(2) rotation forms a covariant approximate quantum error-correcting code with transversal U(1) logical gates. Generalizing previous work on “thermodynamic codes” to general local spin and different irreducible representations using only properties of the angular momentum algebra, we obtain bounds on the code inaccuracy under generic noise on any known 𝑑 sites, under independent and identically distributed noise, and under heralded 𝑑-local erasures. We demonstrate that this family of codes protects a probe state with quantum Fisher information surpassing the standard quantum limit when the sensing parameter couples to the generator of the U(1) logical gate.

quantum error correction↗
DOE OSTI2025

HEU Systems at Low Temperatures [Slides]

This project is sponsored by the Nuclear Criticality Safety Program (NCSP) in collaboration with Lawrence Livermore National Laboratory (LLNL) with a novel interest surrounding the transportation of fissile material: there is a concern regarding the inadvertent introduction of the material in a low-temperature environment. The low-temperature environment will be bounded down to temperatures not below -40 ºC, since this is the limit allotted for packages containing general radioactive material exposed to air. Eventually, the goal of the project is to conduct experiments spanning multiple fission energies at these low temperatures, concluding in an International Criticality Safety Benchmark Evaluation Project (ICSBEP) benchmark.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2021

High-precision quantum algorithms for partial differential equations

Quantum computers can produce a quantum encoding of the solution of a system of differential equations exponentially faster than a classical algorithm can produce an explicit description. However, while high-precision quantum algorithms for linear ordinary differential equations are well established, the best previous quantum algorithms for linear partial differential equations (PDEs) have complexity poly(1/ϵ), where ϵ is the error tolerance. By developing quantum algorithms based on adaptive-order finite difference methods and spectral methods, we improve the complexity of quantum algorithms for linear PDEs to be poly(d,log(1/ϵ)), where d is the spatial dimension. Our algorithms apply high-precision quantum linear system algorithms to systems whose condition numbers and approximation errors we bound. We develop a finite difference algorithm for the Poisson equation and a spectral algorithm for more general second-order elliptic equations.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS2001

Solar-System Tests of Gravitational Theories

We are engaged in testing gravitational theory, primarily using observations of objects in the solar system and primarily on that scale. Our goal is either to detect departures from the standard model (general relativity) - if any exist within the level of sensitivity of our data - or to place tighter bounds on such departures. For this project, we have analyzed a combination of observational data with our model of the solar system, including mostly planetary radar ranging, lunar laser ranging, and spacecraft tracking, but also including both pulsar timing and pulsar very long base interferometry (VLBI) measurements. This year, we have extended our model of Earth nutation with adjustable correction terms at the principal frequencies. We also refined our model of tidal drag on the Moon's orbit. We believe these changes will make no substantial changes in the results, but we are now repeating the analysis of the whole set of data to verify that belief. Additional information is contained in the original extended abstract.

Shapiro, Irwin I.↗
NASA NTRS2003

Solar System Test of Gravitational Theories

We are engaged in testing gravitational theory, mainly using observations of objects in the solar system and mainly on the interplanetary scale. Our goal is either to detect departures from the standard model (general relativity) - if any exist within the level of sensitivity of our data - or to place tighter bounds on such departures. For this project, we have analyzed a combination of observational data with our model of the solar system, including primarily planetary radar ranging, lunar laser ranging, and spacecraft tracking, but also including both pulsar timing and pulsar VLBI measurements. In the past year, we have included new data in the analysis, primarily tracking data from the Mars Pathfinder mission. Although these data are relatively few in number, they extend the time span of high-precision tracking on the surface of Mars from six years to over 20. As a result, the statistical standard deviation of our estimate of Mars precession rate has nearly halved, and the rest of the parameters in our solar-system model have experienced a corresponding, albeit smaller, improvement (about 20% for t,he relevant asteroid masses, 10% for the semimajor axis of Mars orbit, and smaller amounts for most other parameters). In the coming year, we plan to continue adding data to our set, as available. Ne 2 expect to use these data and improved models to obtain estimates of the gravitational- theory parameters and to publish these results.

Shapiro, Irwin I.↗