Search NASA⌕ Search

SEARCH · Search NASA

Results for “Proving”

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 343 records · Page 19
All sourcesNASA NTRSDOE OSTI
DOE OSTI2022

Approximate Recovery and Relative Entropy I: General von Neumann Subalgebras

We prove the existence of a universal recovery channel that approximately recovers states on a von Neumann subalgebra when the change in relative entropy, with respect to a fixed reference state, is small. Our result is a generalization of previous results that applied to type-I von Neumann algebras by Junge at al. [arXiv:1509.07127]. We broadly follow their proof strategy but consider here arbitrary von Neumann algebras, where qualitatively new issues arise. Our results hinge on the construction of certain analytic vectors and computations/estimations of their Araki–Masuda L p norms. We comment on applications to the quantum null energy condition.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2022

Crossing Versus Locking: Bit Threads and Continuum Multiflows

Bit threads are curves in holographic spacetimes that manifest boundary entanglement, and are represented mathematically by continuum analogues of network flows or multiflows. Subject to a density bound, the maximum number of threads connecting a boundary region to its complement computes the Ryu–Takayanagi entropy. When considering several regions at the same time, for example in proving entropy inequalities, there are various inequivalent density bounds that can be imposed. Here, we investigate for which choices of bound a given set of boundary regions can be “locked”, in other words can have their entropies computed by a single thread configuration. We show that under the most stringent bound, which requires the threads to be locally parallel, non-crossing regions can in general be locked, but crossing regions cannot, where two regions are said to cross if they partially overlap and do not cover the entire boundary. We also show that, under a certain less stringent density bound, a crossing pair can be locked, and conjecture that any set of regions not containing a pairwise crossing triple can be locked, analogously to the situation for networks.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2023

Twist Accumulation in Conformal Field Theory: A Rigorous Approach to the Lightcone Bootstrap

We prove that in any unitary CFT, a twist gap in the spectrum of operator product expansion (OPE) of identical scalar quasiprimary operators (i.e. Φ x Φ) implies the existence of a family of quasiprimary operators O τ,l with spins l → ∞ and twists τ → 2Δ Φ in the same OPE spectrum. A similar twist-accumulation result is proven for any two-dimensional Virasoro-invariant, modular-invariant, unitary CFT with a normalizable vacuum and central charge c > 1, where we show that a twist gap in the spectrum of Virasoro primaries implies the existence of a family of Virasoro primaries Oh, $\overline{h}$ with h → ∞ and $\overline{h}$→ c-1/24 (the same is true with h and $\overline{h}$ interchanged). Here, we summarize the similarity of the two problems and propose a general formulation of the lightcone bootstrap.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Single-Shot Decoding of Good Quantum LDPC Codes

Abstract Quantum Tanner codes constitute a family of quantum low-density parity-check codes with good parameters, i.e., constant encoding rate and relative distance. In this article, we prove that quantum Tanner codes also facilitate single-shot quantum error correction (QEC) of adversarial noise, where one measurement round (consisting of constant-weight parity checks) suffices to perform reliable QEC even in the presence of measurement errors. We establish this result for both the sequential and parallel decoding algorithms introduced by Leverrier and Zémor. Furthermore, we show that in order to suppress errors over multiple repeated rounds of QEC, it suffices to run the parallel decoding algorithm for constant time in each round. Combined with good code parameters, the resulting constant-time overhead of QEC and robustness to (possibly time-correlated) adversarial noise make quantum Tanner codes alluring from the perspective of quantum fault-tolerant protocols.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Beyond the Holographic Entropy Cone via Cycle Flows

Motivated by bit threads, we introduce a new prescription for computing entropy vectors outside the holographic entropy cone. By utilizing cycle flows on directed graphs, we show that the maximum cycle flow associated to any subset of vertices, which corresponds to a subsystem, manifestly obeys purification symmetry. Furthermore, by restricting ourselves to a subclass of directed graphs, we prove that the maximum cycle flow obeys both subadditivity and strong subadditivity, thereby establishing it as a viable candidate for the entropy associated to the subsystem. Lastly, we demonstrate how our model generalizes the entropy vectors obtainable via conventional flows in undirected graphs, as well as conjecture that our model similarly generalizes the entropy vectors arising from hypergraphs.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2025

Absence of Barren Plateaus and Scaling of Gradients in the Energy Optimization of Isometric Tensor Network States

Abstract Vanishing gradients can pose substantial obstacles for high-dimensional optimization problems. Here we consider energy minimization problems for quantum many-body systems with extensive Hamiltonians and finite-range interactions, which can be studied on classical computers or in the form of variational quantum eigensolvers on quantum computers. Barren plateaus correspond to scenarios where the average amplitude of the energy gradient decreases exponentially with increasing system size. This occurs, for example, for quantum neural networks and for brickwall quantum circuits when the depth increases polynomially in the system size. Here we prove that the variational optimization problems for matrix product states, tree tensor networks, and the multiscale entanglement renormalization ansatz are free of barren plateaus. The derived scaling properties for the gradient variance provide an analytical guarantee for the trainability of randomly initialized tensor network states (TNS) and motivate certain initialization schemes. In a suitable representation, unitary tensors that parametrize the TNS are sampled according to the uniform Haar measure. We employ a Riemannian formulation of the gradient based optimizations which simplifies the analytical evaluation.

Barthel, Thomas↗
DOE OSTI2025

Universality of the Microcanonical Entropy at Large Spin

We consider rigorous consequences of modular invariance for two-dimensional unitary non-rational CFTs with c > 1. Simple estimates for the torus partition function can lead to remarkably strong results. We show in particular that the spectral density of spin-J operators must grow like exp (π√$\frac{2}{3}$$(c - 1)$J})/√2J in any twist interval at or above (c - 1)/12, with a known twist-dependent prefactor. This proves that the large J spectrum becomes dense even without averaging over spins. For twists below (c - 1)/12 we establish that the growth must be strictly slower. Finally, we estimate how fast the maximal gap between two spin-J operators must go to zero as J becomes large.

Pal, Sridip [California Institute of Technology (C↗
DOE OSTI2026

On the Trotter Error in Many-body Quantum Dynamics with Coulomb Potentials

Efficient simulation of many-body quantum systems is central to advances in physics, chemistry, and quantum computing, with a key question being whether the simulation cost scales polynomially with the system size. Here, in this work, we analyze many-body quantum systems with Coulomb interactions, which are fundamental to electronic and molecular systems. We prove that Trotterization for such unbounded Hamiltonians achieves a 1/4-order convergence rate, with explicit polynomial dependence on the number of particles. The result holds for all initial wavefunctions in the domain of the Hamiltonian, and the 1/4-order convergence rate is optimal, as previous work has numerically demonstrated that it can be saturated by a specific initial ground state. The main challenges arise from the many-body structure and the singular nature of the Coulomb potential. Our proof strategy differs from prior state-of-the-art Trotter analyses, addressing both difficulties in a unified framework. Our analysis treats the Coulomb potential as an unbounded operator without modification or regularization, and does not rely on spatial discretization, making it compatible with both first- and second-quantized circuit constructions.

Fang, Di [Duke Univ., Durham, NC (United States)]↗
DOE OSTI2024

Conservation of model degraded pine wood with selected organosilicons studied by XFM and nanoindentation

Previous research found that some organosilicon treatments proved effective in stabilizing waterlogged wood dimensions during drying. The present research aimed to determine the mechanism of wood stabilization by these chemicals to understand their mode of action. Here, the study used chemically (ChP) and biologically degraded (BP) model Scots pine wood treated with Methyltrimethoxysilane (MTMS), (3-Mercaptopropyl) trimethoxysilane (MPTMS), or 1,3-Bis(diethylamino)-3-propoxypropanol)-1,1,3,3-tetramethyldisiloxane (DEAPTMDS). Synchrotron-based X-ray fluorescence microscopy (XFM) was used to investigate the penetration of organosilicons into the wood cellular structure and cell walls, and nanoindentation was used to study the mechanical properties of the treated wood cell walls. All treatments resulted in high volumetric anti-shrink efficiency (ASE V ) values of 74-82%, except for MTMS-treated ChP with an ASE V of 52%. The multiscale XFM results revealed that all applied organosilicons penetrated throughout the whole wooden blocks and deposited in both cell lumina and cell walls. The retention of all applied organosilicons was highest in BP wood, and so was the dimensional stabilization effect. MTMS-treated ChP had the lowest measured cell wall infiltration, which likely contributed to its lower ASE v . DEAPTMDS treatments plasticized the cell walls and resulted in lowered nanoindentation elastic modulus (E s NI ) and hardness (H) for all types of wood. MTMS and MPTMS had modest effects on cell wall mechanical properties, and the effect depended on the type of wood. The final effect of organosilicon treatment on the dimensional wood stabilization and mechanical properties of wood cell walls depended not only on the type of the applied organosilicon but also the type of wood degradation. This means that the treatment cannot be considered universal, and specific approaches are needed for the conservation of individual wooden objects. Although some mechanisms are now better understood, such as the need for organosilicons to infiltrate the cell walls and the plasticizing effect of DEAPTMDS, other aspects will benefit from a more detailed analysis of the molecular interactions between organosilicons and wood polymers.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2023

Nearly Periodic Maps and Geometric Integration of Noncanonical Hamiltonian Systems

Abstract M. Kruskal showed that each continuous-time nearly periodic dynamical system admits a formal U (1)-symmetry, generated by the so-called roto-rate. When the nearly periodic system is also Hamiltonian, Noether’s theorem implies the existence of a corresponding adiabatic invariant. We develop a discrete-time analog of Kruskal’s theory. Nearly periodic maps are defined as parameter-dependent diffeomorphisms that limit to rotations along a U (1)-action. When the limiting rotation is non-resonant, these maps admit formal U (1)-symmetries to all orders in perturbation theory. For Hamiltonian nearly periodic maps on exact presymplectic manifolds, we prove that the formal U (1)-symmetry gives rise to a discrete-time adiabatic invariant using a discrete-time extension of Noether’s theorem. When the unperturbed U (1)-orbits are contractible, we also find a discrete-time adiabatic invariant for mappings that are merely presymplectic, rather than Hamiltonian. As an application of the theory, we use it to develop a novel technique for geometric integration of non-canonical Hamiltonian systems on exact symplectic manifolds.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Image processing methods for Rayleigh scattering measurements of diesel spray mixing at high repetition rate

This work describes the diagnostic implementation and image processing methods to quantitatively measure diesel spray mixing injected into a high-pressure, high-temperature environment. We used a high-repetition-rate pulse-burst laser developed in-house, a high-speed CMOS camera, and optimized the optical configuration to capture Rayleigh scattering images of the vaporized fuel jets inside a constant volume chamber. The experimental installation was modified to reduce reflections and flare levels to maximize the images’ signal-to-noise ratios by anti-reflection coatings on windows and surfaces, as well as series of optical baffles. Because of the specificities of the high-speed system, several image processing techniques had to be developed and implemented to provide quantitative fuel concentration measurements. We find that these methods involve various correction procedures such as camera linearity, laser intensity fluctuation, dynamic background flare, as well as beam-steering effects. Image inpainting was also applied to correct the Rayleigh scattering signal from large scatterers (e.g. particulates). The experiments demonstrate that applying planar laser Rayleigh scattering at high repetition rate to quantitatively resolve the mixing of fuel and ambient gases in diesel jets is challenging, but possible. The thorough analysis of the experimental uncertainty and comparisons to past data prove that such measurements can be accurate, whilst providing valuable information about the mixing processes of high-pressure diesel jets.

47 OTHER INSTRUMENTATION↗
DOE OSTI2025

An efficient second-order adaptive procedure for inserting CAD geometries into hexahedral meshes using volume fractions

Here, this paper is concerned with inserting three-dimensional computer-aided design (CAD) geometries into meshes composed of hexahedral elements using a volume fraction representation. An adaptive procedure for doing so is presented. The procedure consists of two steps. The first step performs spatial acceleration using a k-d tree. The second step involves subdividing individual hexahedra in an adaptive mesh refinement (AMR)-like fashion and approximating the CAD geometry linearly (as a plane) at the finest subdivision. The procedure requires only two geometric queries from a CAD kernel: determining whether or not a queried spatial coordinate is inside or outside the CAD geometry and determining the closest point on the CAD geometry’s surface from a given spatial coordinate. We prove that the procedure is second-order accurate for sufficiently smooth geometries and sufficiently refined background meshes. We demonstrate the expected order of accuracy is achieved with several verification tests and illustrate the procedure’s effectiveness for several exemplar CAD geometries.

Adaptive↗
DOE OSTI2021

Spectral Threshold for Extremal Cyclic Edge-Connectivity

In this report, the cyclic edge-connectivity of a graph G is the least k such that there exists a set of k edges whose removal disconnects G into components where every component contains a cycle. We show that for graphs of minimum degree at least 3 and girth g at least 4, the cyclic edge-connectivity is bounded above by (Δ-2)g where Δ is the maximum degree. We then prove that if the second eigenvalue of the adjacency matrix of a d-regular graph of girth g ≥ 4 is sufficiently small, then the cyclic edge-connectivity is (d-2)g, providing a spectral condition for when this upper bound on cyclic edge-connectivity is tight.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

An FFT-based approach for Bloch wave analysis: application to polycrystals

A method based on the Fast Fourier Transform is proposed to obtain the dispersion relation of acoustic waves in heterogeneous periodic media with arbitrary microstructures. The microstructure is explicitly considered using a voxelized Representative Volume Element (RVE). The dispersion diagram is obtained solving an eigenvalue problem for Bloch waves in Fourier space. To this aim, two linear operators representing stiffness and mass are defined through the use of differential operators in Fourier space. The smallest eigenvalues are obtained using the implicitly restarted Lanczos and the subspace iteration methods, and the required inverse of the stiffness operator is done using the conjugate gradient with a preconditioner. The method is used to study the propagation of acoustic waves in elastic polycrystals, showing the strong effect of crystal anistropy and polycrystaline texture on the propagation. It is shown that the method combines the simplicity of classical Fourier series analysis with the versatility of Finite Elements to account for complex geometries proving an efficient and general approach which allows the use of large RVEs in 3D.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Bi-fidelity modeling of uncertain and partially unknown systems using DeepONets

Recent advances in modeling large-scale, complex physical systems have shifted research focuses towards data-driven techniques. However, generating datasets by simulating complex systems can require significant computational resources. Similarly, acquiring experimental datasets can prove difficult. For these systems, often computationally inexpensive, but in general inaccurate models, known as the low-fidelity models, are available. Here in this paper, we propose a bi-fidelity modeling approach for complex physical systems, where we model the discrepancy between the true system's response and a low-fidelity response in the presence of a small training dataset from the true system's response using a deep operator network, a neural network architecture suitable for approximating nonlinear operators. We apply the approach to systems that have parametric uncertainty and are partially unknown. Three numerical examples are used to show the efficacy of the proposed approach to model uncertain and partially unknown physical systems.

MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Thermo-mechanical modeling and experimental validation for multilayered metallic microstructures

This paper presents thermo-mechanical modeling on multilayered metallic microstructures consisting of two bilayers that enable 3D deployment once being Joule heated. Additionally, a representative design of such microstructures, as well as their working principle is introduced. Furthermore, a mathematical model is derived using Euler–Bernoulli beam theory, and analytical solutions describing out-of-plane displacement of the multilayered microstructures when uniformly heated, which is validated by finite element analysis. Parametric analysis on thermal load and dimensional change of beam shows a good agreement between the analytical solutions and results given by finite element analysis. The phases of the near-equiatomic NiTi layer are analyzed by EDS and XRD, which prove to be austenite during the Joule heating process. The mechanical properties of austenite NiTi are incorporated into the analytical solutions that provides a good estimation of 3D deployment of microstructures made of NiTi and aluminum. The experimental results provide an approximately 7 µm out-of-plane deployment by applying a uniform temperature increase of 132 K, and parametric analysis on the dimension of top aluminum beam offers another promising approach to larger 3D deployment. The proposed mathematical model provides an efficient tool for predicting the out-of-plane deployment of such multilayered microstructures.

36 MATERIALS SCIENCE↗
DOE OSTI2025

Field validation of dynamic mechanical torque measurements using fiber-optic strain sensors for geared wind turbines

Abstract Accurate knowledge of the mechanical loads of wind turbine gearboxes has become essential in modern, highly loaded gearbox designs, as maintaining or even improving gearbox reliability with increasing torque density demands is proving to be challenging. Unfortunately, the traditional method of measuring dynamic mechanical torque using strain gauges placed on the outer surface of a rotating shaft and transmitting the resulting signal is unsuitable for serial deployment due to technical and economic constraints. An alternative method based on fiber-optic strain sensors placed on the stationary outer surface of the gearbox ring gear has been proposed. Like shaft torsion, the radial deformation of the ring gear is proportionate to the rotor torque. Placing the sensors on a stationary component is a cost-effective alternative for serial implementation because the need for complex and expensive data transfer via wireless transmission or a slip ring is eliminated. In this paper, we present the results of an extensive field experiment conducted to evaluate the torque measurement accuracy of this novel sensing solution installed on the gearbox of a Gamesa G97 2-MW wind turbine at the National Renewable Energy Laboratory’s Flatirons Campus. Torque measurements derived from fiber-optic strain sensors placed on the ring gear of the planetary stage are compared to conventional torque measurements from strain gauges placed on the main shaft. Two different torque estimation data processing methods were evaluated, with the method based on operational deflection shapes providing the most accurate results with an average normalized root mean square error below 0.7% for a load revolution distribution analysis. The effect of operating conditions on the torque estimate was also investigated, and the third planet-passing operational deflection shape was found to be the least sensitive to nontorque load-related effects. The fiber-optic strain sensors’ successful operation during the complete test campaign has demonstrated a robust and accurate solution for fleet-wide enhanced gearbox remaining useful life estimation.

17 WIND ENERGY↗
DOE OSTI2021

A primal–dual algorithm for risk minimization

In this paper, we develop an algorithm to efficiently solve risk-averse optimization problems posed in reflexive Banach space. Such problems often arise in many practical applications as, e.g., optimization problems constrained by partial differential equations with uncertain inputs. Unfortunately, for many popular risk models including the coherent risk measures, the resulting risk-averse objective function is nonsmooth. Here, this lack of differentiability complicates the numerical approximation of the objective function as well as the numerical solution of the optimization problem. To address these challenges, we propose a primal–dual algorithm for solving large-scale nonsmooth risk-averse optimization problems. This algorithm is motivated by the classical method of multipliers and by epigraphical regularization of risk measures. As a result, the algorithm solves a sequence of smooth optimization problems using derivative-based methods. We prove convergence of the algorithm even when the subproblems are solved inexactly and conclude with numerical examples demonstrating the efficiency of our method.

97 MATHEMATICS AND COMPUTING↗