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 415 records · Page 23
All sourcesNASA NTRSDOE OSTI
NASA NTRS2013

Risk-Constrained Dynamic Programming for Optimal Mars Entry, Descent, and Landing

A chance-constrained dynamic programming algorithm was developed that is capable of making optimal sequential decisions within a user-specified risk bound. This work handles stochastic uncertainties over multiple stages in the CEMAT (Combined EDL-Mobility Analyses Tool) framework. It was demonstrated by a simulation of Mars entry, descent, and landing (EDL) using real landscape data obtained from the Mars Reconnaissance Orbiter. Although standard dynamic programming (DP) provides a general framework for optimal sequential decisionmaking under uncertainty, it typically achieves risk aversion by imposing an arbitrary penalty on failure states. Such a penalty-based approach cannot explicitly bound the probability of mission failure. A key idea behind the new approach is called risk allocation, which decomposes a joint chance constraint into a set of individual chance constraints and distributes risk over them. The joint chance constraint was reformulated into a constraint on an expectation over a sum of an indicator function, which can be incorporated into the cost function by dualizing the optimization problem. As a result, the chance-constraint optimization problem can be turned into an unconstrained optimization over a Lagrangian, which can be solved efficiently using a standard DP approach.

Ono, Masahiro↗
NASA NTRS1998

Incorporating Endmember Variability into Spectral Mixture Analysis Through Endmember Bundles

Variation in canopy structure and biochemistry induces a concomitant variation in the top-of-canopy spectral reflectance of a vegetation type. Hence, the use of a single endmember spectrum to track the fractional abundance of a given vegetation cover in a hyperspectral image may result in fractions with considerable error. One solution to the problem of endmember variability is to increase the number of endmembers used in a spectral mixture analysis of the image. For example, there could be several tree endmembers in the analysis because of differences in leaf area index (LAI) and multiple scatterings between leaves and stems. However, it is often difficult in terms of computer or human interaction time to select more than six or seven endmembers and any non-removable noise, as well as the number of uncorrelated bands in the image, limits the number of endmembers that can be discriminated. Moreover, as endmembers proliferate, their interpretation becomes increasingly difficult and often applications simply need the aerial fractions of a few land cover components which comprise most of the scene. In order to incorporate endmember variability into spectral mixture analysis, we propose representing a landscape component type not with one endmember spectrum but with a set or bundle of spectra, each of which is feasible as the spectrum of an instance of the component (e.g., in the case of a tree component, each spectrum could reasonably be the spectral reflectance of a tree canopy). These endmember bundles can be used with nonlinear optimization algorithms to find upper and lower bounds on endmember fractions. This approach to endmember variability naturally evolved from previous work in deriving endmembers from the data itself by fitting a triangle, tetrahedron or, more generally, a simplex to the data cloud reduced in dimension by a principal component analysis. Conceptually, endmember variability could make it difficult to find a simplex that both surrounds the data cloud and has vertices that are realistic endmember spectra with reflectances between 0 and 1. In this paper, we create endmember bundles and bounding fraction images for an AVIRIS subscene simulated with a plant canopy radiative transfer model. The simulated subscene is spatially patterned after a subscene from the AVIRIS image acquired August, 1993 over La Copita, Texas. In addition, for comparison, we performed a traditional unmixing with image endmembers.

Bateson, C. Ann↗
NASA NTRSDate not supplied

A Solar Sail Shape Modeling Approach for Attitude Control Design and Analysis

Solar sails operating in the space environment experience deformations in sail shape that result in relatively large disturbance torques which dictate the required performance of the spacecraft attitude control and momentum management systems. These deformations are driven by thermal loads on the booms (due to uneven solar heating), manufacturing and assembly tolerances, and variations in membrane tension. The Solar Cruiser spacecraft utilizes a four-quadrant sail design with four 30-meter length booms and four triangular sail membranes, creating a square sail structure of >1600 m2. Medium-fidelity mesh models were developed based on a characteristic deformed shape. A series of parametric studies were conducted using this shape paradigm to determine worst-case deformed sail shapes which produce bounding disturbance torques. A large database of shapes was produced, and the forces and moments induced by each individual shape were calculated using a Rios-Reyes reduced order generalized sail model [1]. Two were selected as reference worst-case shapes for the Solar Cruiser mission: one which produced the highest pitch/yaw root-sum-squared (RSS) torque, and one which produced the highest roll torque. The results showed that the worst-case shapes at high solar incidence angles induce significantly higher (2-10x) disturbance torques than an ideal, flat-plate sail. Even with considerable safety margins, assuming an ideal sail is unlikely to sufficiently bound the disturbances, which is critical when designing the attitude control system and sizing actuators. Accurate sail shape modeling methodologies should therefore be employed on future solar sail missions. References [1] L. Rios-Reyes and D. J. Scheeres, “Generalized Model for Solar Sails,” Journal of Spacecraft and Rockets, Vol. 42, Jan. 2005, pp. 182–185, 10.2514/1.9054.

Solar Sail↗
DOE OSTI2025

Anisotropic Response of Defect Bound States to the Magnetic Field in Epitaxial FeSn Films

Crystal defects, whether intrinsic or engineered, drive many fundamental phenomena and novel functionalities of quantum materials. Here, we report symmetry-breaking phenomena induced by Sn vacancy defects on the surface of epitaxial Kagome antiferromagnetic FeSn films using low-temperature scanning tunneling microscopy and spectroscopy. Near the single Sn vacancy, anisotropic quasiparticle interference patterns are observed in the differential conductance dI/dV maps, breaking the 6-fold rotational symmetry of the Kagome layer. Furthermore, the Sn vacancy defects induce bound states that exhibit anomalous Zeeman shift under an out-of-plane magnetic field, where the energy of the bound states moves linearly toward higher energy independent of the direction of the magnetic field. Under an in-plane magnetic field, the shift of the bound state energy also shows a 2-fold oscillating behavior as a function of the azimuth angle. These findings demonstrate defectenabled new functionalities in Kagome antiferromagnets for potential applications in nanoscale spintronic devices.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2021

Theory of Trotter Error with Commutator Scaling

The Lie-Trotter formula, together with its higher-order generalizations, provides a simple approach to decomposing the exponential of a sum of operators. Despite significant effort, the error scaling of such product formulas remains poorly understood. We develop a theory of Trotter error that overcomes the limitations of truncating the Baker-Campbell-Hausdorff expansion. Our analysis directly exploits the commutativity of operator summands, producing tighter error bounds for both real- and imaginary-time evolutions. Whereas previous work achieves similar goals for systems with geometric locality or Lie-algebraic structure, our approach holds in general. We give a host of improved algorithms for digital quantum simulation and quantum Monte Carlo methods, nearly matching or even outperforming the best previous results. Our applications include: (i) a simulation of second-quantized plane-wave electronic structure, nearly matching the interaction-picture algorithm of Low and Wiebe; (ii) a simulation of $k$-local Hamiltonians almost with induced one-norm scaling, faster than the qubitization algorithm of Low and Chuang; (iii) a simulation of rapidly decaying power-law interactions, outperforming the Lieb-Robinson-based approach of Tran et al.; (iv) a hybrid simulation of clustered Hamiltonians, dramatically improving the result of Peng, Harrow, Ozols, and Wu; and (v) quantum Monte Carlo simulations of the transverse field Ising model and quantum ferromagnets, tightening previous analyses of Bravyi and Gosset. We obtain further speedups using the fact that product formulas can preserve the locality of the simulated system. Specifically, we show that local observables can be simulated with complexity independent of the system size for power-law interacting systems, which implies a Lieb-Robinson bound nearly matching a recent result of Tran et al. Our analysis reproduces known tight bounds for first- and second-order formulas. We further investigate the tightness of our bounds for higher-order formulas. For quantum simulation of a one-dimensional Heisenberg model with an even-odd ordering of terms, our result overestimates the complexity by only a factor of $5$. Our bound is also close to tight for power-law interactions and other orderings of terms. This suggests that our theory can accurately characterize Trotter error in terms of both the asymptotic scaling and the constant prefactor.

quantum computing, numerical analysis↗
DOE OSTI2024

Unitarity of bespoke amplitudes

We use partial wave unitarity to constrain various bespoke four-point amplitudes. We start by constructing bespoke generalizations of the type-I superstring amplitude, which we show satisfy dual resonance and have suitable high-energy limits. By analyzing the behavior of partial wave coefficients for highly massive states, we strictly rule out all bespoke amplitudes with asymptotically nonlinear Regge trajectories and place constraints on the first few nontrivial parameters in asymptotically linear cases. Finally, we argue that while a large class of unitary bespoke amplitudes fails to satisfy Regge sum rules, there exists a smaller subclass with a vanishing mass gap that is superpolynomially bounded.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2025

Diffusion Codes: Self-Correction from Small(er)-Set Expansion with Tunable Non-locality

Optimal constructions of classical LDPC codes can be obtained by choosing the Tanner graph uniformly at random among biregular graphs. We introduce a class of codes that we call ``diffusion codes'', defined by placing each edge connecting bits and checks on some graph, and acting on that graph with a random SWAP network. By tuning the depth of the SWAP network, we can tune a tradeoff between the amount of randomness -- and hence the optimality of code parameters -- and locality with respect to the underlying graph. For diffusion codes defined on the cycle graph, if the SWAP network has depth $\sim Tn$ with $T> n^{2β}$ for arbitrary $β>0$, then we prove that almost surely the Tanner graph is a lossless ``smaller set'' vertex expander for small sets up size $δ\sim \sqrt T \sim n^β$, with bounded bit and check degree. At the same time, the geometric size of the largest stabilizer is bounded by $\sqrt T$ in graph distance. We argue, based on physical intuition, that this result should hold more generally on arbitrary graphs. By taking hypergraph products of these classical codes we obtain quantum LDPC codes defined on the torus with smaller-set boundary and co-boundary expansion and the same expansion/locality tradeoffs as for the classical codes. These codes are self-correcting and admit single-shot decoding, while having the geometric size of the stabilizer growing as an arbitrarily small power law. Our proof technique establishes mixing of a random SWAP network on small subsystems at times scaling with only the subsystem size, which may be of independent interest.

Combinatorics (math.CO)↗
NASA NTRS1979

A generalized modal shock spectra method for spacecraft loads analysis

Unlike the traditional shock spectra approach, the generalization presented in this paper permits elastic interaction between the spacecraft and launch vehicle in order to obtain accurate bounds on the spacecraft response and structural loads. In addition, the modal response from a previous launch vehicle transient analysis - with or without a dummy spacecraft - is exploited in order to define a modal impulse as a simple idealization of the actual forcing function. The idealized modal forcing function is then used to derive explicit expressions for an estimate of the bound on the spacecraft structural response and forces.

Trubert, M.↗
NASA NTRS1993

A new approach to mixed H2/H infinity controller synthesis using gradient-based parameter optimization methods

In the past few years, the mixed H(sub 2)/H-infinity control problem has been the object of much research interest since it allows the incorporation of robust stability into the LQG framework. The general mixed H(sub 2)/H-infinity design problem has yet to be solved analytically. Numerous schemes have considered upper bounds for the H(sub 2)-performance criterion and/or imposed restrictive constraints on the class of systems under investigation. Furthermore, many modern control applications rely on dynamic models obtained from finite-element analysis and thus involve high-order plant models. Hence the capability to design low-order (fixed-order) controllers is of great importance. In this research a new design method was developed that optimizes the exact H(sub 2)-norm of a certain subsystem subject to robust stability in terms of H-infinity constraints and a minimal number of system assumptions. The derived algorithm is based on a differentiable scalar time-domain penalty function to represent the H-infinity constraints in the overall optimization. The scheme is capable of handling multiple plant conditions and hence multiple performance criteria and H-infinity constraints and incorporates additional constraints such as fixed-order and/or fixed structure controllers. The defined penalty function is applicable to any constraint that is expressible in form of a real symmetric matrix-inequity.

Ly, Uy-Loi↗
NASA NTRS2007

Comparing Consider-Covariance Analysis with Sigma-Point Consider Filter and Linear-Theory Consider Filter Formulations

Recent literature in applied estimation theory reflects growing interest in the sigma-point (also called unscented ) formulation for optimal sequential state estimation, often describing performance comparisons with extended Kalman filters as applied to specific dynamical problems [c.f. 1, 2, 3]. Favorable attributes of sigma-point filters are described as including a lower expected error for nonlinear even non-differentiable dynamical systems, and a straightforward formulation not requiring derivation or implementation of any partial derivative Jacobian matrices. These attributes are particularly attractive, e.g. in terms of enabling simplified code architecture and streamlined testing, in the formulation of estimators for nonlinear spaceflight mechanics systems, such as filter software onboard deep-space robotic spacecraft. As presented in [4], the Sigma-Point Consider Filter (SPCF) algorithm extends the sigma-point filter algorithm to the problem of consider covariance analysis. Considering parameters in a dynamical system, while estimating its state, provides an upper bound on the estimated state covariance, which is viewed as a conservative approach to designing estimators for problems of general guidance, navigation and control. This is because, whether a parameter in the system model is observable or not, error in the knowledge of the value of a non-estimated parameter will increase the actual uncertainty of the estimated state of the system beyond the level formally indicated by the covariance of an estimator that neglects errors or uncertainty in that parameter. The equations for SPCF covariance evolution are obtained in a fashion similar to the derivation approach taken with standard (i.e. linearized or extended) consider parameterized Kalman filters (c.f. [5]). While in [4] the SPCF and linear-theory consider filter (LTCF) were applied to an illustrative linear dynamics/linear measurement problem, in the present work examines the SPCF as applied to nonlinear sequential consider covariance analysis, i.e. in the presence of nonlinear dynamics and nonlinear measurements. A simple SPCF for orbit determination, exemplifying an algorithm hosted in the guidance, navigation and control (GN&C) computer processor of a hypothetical robotic spacecraft, was implemented, and compared with an identically-parameterized (standard) extended, consider-parameterized Kalman filter. The onboard filtering scenario examined is a hypothetical spacecraft orbit about a small natural body with imperfectly-known mass. The formulations, relative complexities, and performances of the filters are compared and discussed.

Lisano, Michael E.↗
DOE OSTI2024

A General Framework for Error-controlled Unstructured Scientific Data Compression

Data compression plays a key role in reducing storage and I/O costs. Traditional lossy methods primarily target data on rectilinear grids and cannot leverage the spatial coherence in unstructured mesh data, leading to suboptimal compression ratios. We present a multi-component, error-bounded compression framework designed to enhance the compression of floating-point unstructured mesh data, which is common in scientific applications. Our approach involves interpolating mesh data onto a rectilinear grid and then separately compressing the grid interpolation and the interpolation residuals. This method is general, independent of mesh types and typologies, and can be seamlessly integrated with existing lossy compressors for improved performance. We evaluated our framework across twelve variables from two synthetic datasets and two real-world simulation datasets. The results indicate that the multi-component framework consistently outperforms state-of-the-art lossy compressors on unstructured data, achieving, on average, a 2.3 − 3.5× improvement in compression ratios, with error bounds ranging from 1 × 10 the −6 to 1×10−2. We further investigate impact of hyperparameters, such as grid spacing and error allocation, to deliver optimal compression ratios in diverse datasets.

Gong, Qian↗
DOE OSTI2024

INTERDUNE DEPOSITS AND STRATIGRAPHIC FRAMEWORK OF THE NAVAJO SANDSTONE IN THE LAKE POWELL AREA, UTAH, USA

The Western Interior of the USA was dominated by desert environments for much of the Jurassic. Of these desert environments, the most extensive by far was the Navajo Sandstone erg, which, in conjunction with its correlative Nugget and Aztec Sandstones, is thought to have covered well over 500,000 km2, and is one of the largest ergs preserved in the rock record. The Navajo Sandstone is also one of a few geologic units which show promise as a potential CO2 sequestration reservoir in Utah. It outcrops along the eastern and southern margin of the state, and subcrops throughout most of the central area. The Navajo Sandstone consists of stacked eolian deposits, composed of well sorted, clean sandstone, deposited in commonly tabular, high angle cross bedded paleodunes, which are on average 15 m thick. Interspersed between these paleodunes are interdune deposits. Interdune deposits consist of sandy to calcareous, predominantly planar bedded, lensoid units, ranging from <1 m up to 7 m thick. In some cases, these interdune deposits occur along more extensive stratigraphic bounding surfaces. Dating within the Navajo Sandstone has historically been very difficult, as a result of its predominantly clean, aeolian sandstone composition. In addition, complexity of internal stratigraphic surfaces coupled with a low structural dip and generally flat topography has resulted in a poor understanding of the internal stratigraphy of the Navajo Sandstone. Exceptional three-dimensional exposures of the Navajo Sandstone in the upper portions of Lake Powell permit us to relate interdune carbonates to a hierarchical bounding surfaces model. Here we use this combined approach to interpret the internal stratigraphy of the Navajo Sandstone in this region. This work forms part of a larger study of the Navajo Sandstone across Utah and its potential as a CO2 reservoir, by developing a more comprehensive stratigraphic framework, and increasing understanding of stratigraphic complexity within one of the most significant eolian systems in the world.

Mahon, Elizabeth↗
NASA NTRS1992

An extension to Schneider's general paradigm for fault-tolerant clock synchronization

In 1987, Schneider presented a general paradigm that provides a single proof of a number of fault tolerant clock synchronization algorithms. His proof was subsequently subjected to the rigor of mechanical verification by Shankar. However, both Schneider and Shankar assumed a condition Shankar refers to as a bounded delay. This condition states that the elapsed time between synchronization events (i.e., the time that the local process applies an adjustment to its logical clock) is bounded. This property is really a result of the algorithm and should not be assumed in a proof of correctness. This paper remedies this by providing a proof of this property in the context of the general paradigm proposed by Schneider. The argument given is a generalization of Welch and Lynch's proof of a related property for their algorithm.

Miner, Paul S.↗
DOE OSTI2020

The distribution-based remapping of the nodal mass and momentum between arbitrary meshes for staggered arbitrary Lagrangian-Eulerian hydrodynamics

We present a new distribution-based remapping of the nodal mass and momentum between arbitrary source (Lagrangian) and arbitrary target (rezoned) meshes for indirect staggered arbitrary Lagrangian-Eulerian hydrodynamics. Here, the method is based on the following ideas: define cell-centered momentum and mass on the source mesh; conservatively remap those cell-centered quantities from source to target meshes; and use local constrained optimization for each cell of the target mesh to conservatively distribute cell mass and momentum to the nodes of the cell. This new method is efficient, conservative, accurate and bounds preserving.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2025

Efficient Training of Deep Neural Operator Networks via Randomized Sampling

Neural operators (NOs) employ deep neural networks to learn the mappings between infinitedimensional function spaces. Deep operator network (DeepONet), a popular NO architecture, has demonstrated success in the real-time prediction of complex dynamics across various scientific and engineering applications. In this work, we introduce a random sampling technique to be adopted during the training of DeepONet, aimed at improving the generalization ability of the model, while significantly reducing the computational time. The proposed approach targets the trunk network of the DeepONet model that outputs the basis functions corresponding to the spatiotemporal locations of the bounded domain on which the physical system is defined. While constructing the loss function, DeepONet training traditionally considers a uniform grid of spatiotemporal points at which all the output functions are evaluated for each iteration. This approach leads to a larger batch size, resulting in poor generalization and increased memory demands, due to the limitations of the stochastic gradient descent (SGD) optimizer. The proposed random sampling over the inputs of the trunk net mitigates these challenges, improving generalization and reducing the memory requirements during training, resulting in significant computational gains. We validate our hypothesis through three benchmark examples, demonstrating substantial reductions in training time while achieving comparable or lower overall test errors relative to the traditional training approach. Our results indicate that incorporating randomization in the trunk network inputs during training enhances the efficiency and robustness of DeepONet, offering a promising avenue for improving the framework’s performance in modeling complex physical systems.

Karumuri, Sharmila [Department of Civil & Systems ↗
NASA NTRS1986

Generalized energetics for linear and nonlinear symmetric instabilities

The generalized energy conservation integral is applied to linear and nonlinear symmetric instabilities (SIs) and conditional symmetric instabilities (CSIs) in uniform and nonuniform basic states. The generalized energy conservation integral for linear SI in nonuniform basic state is refined to include initial thermal-inertial perturbations. A generalized conservation integral is derived for a nonlinear SI with uniform and nonuniform basic states. The integral reveals that: (1) the stability conditions of nonlinear and linear SI are not the same; (2) when the basic state is symmetrically stable the nonlinear evolution of a symmetric disturbance is energetically bounded by its initial energy; and (3) when the basic state is symmetrically unstable the growth of the symmetric perturbation is approximated by the linear SI theory. Precipitative heating is incorporated into the generalized energy integral for nonlinear CSI; the relation between nonlinear evolution of a CSI circulation and precipitative heating is examined.

Xu, Q.↗
DOE OSTI2023

Revealing protonation states and tracking substrate in serine hydroxymethyltransferase with room-temperature X-ray and neutron crystallography

Pyridoxal 5’-phosphate (PLP)-dependent enzymes utilize a vitamin B 6 -derived cofactor to perform a myriad of chemical transformations on amino acids and other small molecules. Some PLP-dependent enzymes, such as serine hydroxymethyltransferase (SHMT), are promising drug targets for the design of small-molecule antimicrobials and anticancer therapeutics, while others have been used to synthesize pharmaceutical building blocks. Understanding PLP-dependent catalysis and the reaction specificity is crucial to advance structure-assisted drug design and enzyme engineering. Here we report the direct determination of the protonation states in the active site of Thermus thermophilus SHMT (TthSHMT) in the internal aldimine state using room-temperature joint X-ray/neutron crystallography. Conserved active site architecture of the model enzyme TthSHMT and of human mitochondrial SHMT (hSHMT2) were compared by obtaining a room-temperature X-ray structure of hSHMT2, suggesting identical protonation states in the human enzyme. The amino acid substrate serine pathway through the TthSHMT active site cavity was tracked, revealing the peripheral and cationic binding sites that correspond to the pre-Michaelis and pseudo-Michaelis complexes, respectively. At the peripheral binding site, the substrate is bound in the zwitterionic form. By analyzing the observed protonation states, Glu53, but not His residues, is proposed as the general base catalyst, orchestrating the retro-aldol transformation of L-serine into glycine.

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 I: the Linear Setting

Fully implicit Runge--Kutta (IRK) methods have many desirable properties as time integration schemes in terms of accuracy and stability, but high-order IRK methods are not commonly used in practice with numerical PDEs due to the difficulty of solving the stage equations. This paper introduces a theoretical and algorithmic preconditioning framework for solving the systems of equations that arise from IRK methods applied to linear numerical PDEs (without algebraic constraints). Additionally, this framework also naturally applies to discontinuous Galerkin discretizations in time. Under quite general assumptions on the spatial discretization that yield stable time integration, the preconditioned operator is proven to have condition number bounded by a small, order-one constant, independent of the spatial mesh and time-step size, and with only weak dependence on number of stages/polynomial order; for example, the preconditioned operator for 10th-order Gauss IRK has condition number less than two, independent of the spatial discretization and time step. The new method can be used with arbitrary existing preconditioners for backward Euler-type time-stepping schemes and is amenable to the use of three-term recursion Krylov methods when the underlying spatial discretization is symmetric. The new method is demonstrated to be effective on various high-order finite-difference and finite element discretizations of linear parabolic and hyperbolic problems, demonstrating fast, scalable solution of up to 10th-order accuracy. The new method consistently outperforms existing block preconditioning approaches, and in several cases, the new method can achieve 4th-order accuracy using Gauss integration with roughly half the number of preconditioner applications and wallclock time as required using standard diagonally IRK methods.

97 MATHEMATICS AND COMPUTING↗