Search NASA⌕ Search

SEARCH · Search NASA

Results for “error bound”

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 541 records · Page 30

Determination and error analysis of emittance and spectral emittance measurements by remote sensing

The author has identified the following significant results. From the theory of remote sensing of surface temperatures, an equation of the upper bound of absolute error of emittance was determined. It showed that the absolute error decreased with an increase in contact temperature, whereas, it increased with an increase in environmental integrated radiant flux density. Change in emittance had little effect on the absolute error. A plot of the difference between temperature and band radiance temperature vs. emittance was provided for the wavelength intervals: 4.5 to 5.5 microns, 8 to 13.5 microns, and 10.2 to 12.5 microns.

Dejesusparada, N.↗

Optimal sensing on an asymmetric exceptional surface

We study the connection between exceptional points (EPs) and optimal parameter estimation, in a simple system consisting of two counterpropagating traveling wave modes in a microring resonator. The unknown parameter to be estimated is the strength of a perturbing cross-coupling between the two modes. Partially reflecting the output of one mode into the other creates a non-Hermitian Hamiltonian that exhibits a family of EPs, creating an exceptional surface (ES). We use a fully quantum treatment of field inputs and noise sources to obtain a quantitative bound on the estimation error by calculating the quantum Fisher information (QFI) in the output fields, whose inverse gives the Cramér-Rao lower bound on the mean-squared error of any unbiased estimator. We determine the bounds for two input states, namely, a semiclassical coherent state and a highly nonclassical NOON state. We find that the QFI is enhanced in the presence of an EP for both of these input states and that both states can saturate the Cramér-Rao bound. We then identify idealized yet experimentally feasible measurements that achieve the minimum bound for these two input states. We also investigate how the QFI changes for parameter values that do not lie on the ES, finding that these can have a larger QFI, suggesting alternative routes to optimize the parameter estimation for this problem.

Exceptional points↗

Formal Verification of Safety Buffers for Sate-Based Conflict Detection and Resolution

The information provided by global positioning systems is never totally exact, and there are always errors when measuring position and velocity of moving objects such as aircraft. This paper studies the effects of these errors in the actual separation of aircraft in the context of state-based conflict detection and resolution. Assuming that the state information is uncertain but that bounds on the errors are known, this paper provides an analytical definition of a safety buffer and sufficient conditions under which this buffer guarantees that actual conflicts are detected and solved. The results are presented as theorems, which were formally proven using a mechanical theorem prover.

Herencia-Zapana, Heber↗

Performance of the strongly constrained and appropriately normed density functional for solid-state materials

Constructed to satisfy 17 known exact constraints for a semilocal density functional, the strongly constrained and appropriately normed (SCAN) meta-generalized-gradient-approximation functional has shown early promise for accurately describing the electronic structure of molecules and solids. One open question is how well SCAN predicts the formation energy, a key quantity for describing the thermodynamic stability of solid-state compounds. To answer this question, we perform an extensive benchmark of SCAN by computing the formation energies for a diverse group of nearly 1000 crystalline compounds for which experimental values are known. Due to an enhanced exchange interaction in the covalent bonding regime, SCAN substantially decreases the formation energy errors for strongly bound compounds, by approximately 50% to 110 meV/atom, as compared to the generalized gradient approximation of Perdew, Burke, and Ernzerhof (PBE). However, for intermetallic compounds, SCAN performs moderately worse than PBE with an increase in formation energy error of approximately 20%, stemming from SCAN's distinct behavior in the weak bonding regime. The formation energy errors can be further reduced via elemental chemical potential fitting. We find that SCAN leads to significantly more accurate predicted crystal volumes, moderately enhanced magnetism, and mildly improved band gaps as compared to PBE. Altogether, SCAN represents a significant improvement in accurately describing the thermodynamics of strongly bound compounds.

36 MATERIALS SCIENCE↗

Performance of convolutionally encoded noncoherent MFSK modem in fading channels

The performance of a convolutionally encoded noncoherent multiple-frequency shift-keyed (MFSK) modem utilizing Viterbi maximum-likelihood decoding and operating on a fading channel is described. Both the lognormal and classical Rician fading channels are considered for both slow and time-varying channel conditions. Primary interest is in the resulting bit error rate as a function of the ratio between the energy per transmitted information bit and noise spectral density, parameterized by both the fading channel and code parameters. Fairly general upper bounds on bit error probability are provided and compared with simulation results in the two extremes of zero and infinite channel memory. The efficacy of simple block interleaving in combatting channel memory effects are thoroughly explored. Both quantized and unquantized receiver outputs are considered.

Modestino, J. W.↗

Coded error probability evaluation for antijam communication systems

We present a general union-Chernoff bound on the bit error probability for coded communication systems and apply it to examples of antijam systems. The key feature of this bound is the decoupling of the coding aspects of the system from the remaining part of the communication system which includes jamming, suboptimum detectors, and arbitrary decoding metrics which may or may not use jammer state knowledge

Omura, J. K.↗

Finding the complete path and weight enumerators of convolutional codes

A method for obtaining the complete path enumerator T(D, L, I) of a convolutional code is described. A system of algebraic equations is solved, using a new algorithm for computing determinants, to obtain T(D, L, I) for the (7,1/2) NASA standard code. Generating functions, derived from T(D, L, I) are used to upper bound Viterbi decoder error rates. This technique is currently feasible for constraint length K less than 10 codes. A practical, fast algorithm is presented for computing the leading nonzero coefficients of the generating functions used to bound the performance of constraint length K less than 20 codes. Code profiles with about 50 nonzero coefficients are obtained with this algorithm for the experimental K = 15, rate 1/4, code in the Galileo mission and for the proposed K = 15, rate 1/6, 2-dB code.

Onyszchuk, I.↗

Application of GPS to Enable Launch Vehicle Upper Stage Heliocentric Disposal

To properly dispose of the upper stage of the Space Launch System, the vehicle must perform a burn in Earth orbit to perform a close flyby of the Lunar surface to gain adequate energy to enter into heliocentric space. This architecture was selected to meet NASA requirements to limit orbital debris in the Earth-Moon system. The choice of a flyby for heliocentric disposal was driven by mission and vehicle constraints. This paper describes the SLS mission for Exploration Mission -1, a high level overview of the Block 1 vehicle, and the various disposal options considered. The research focuses on this analysis in terms of the mission design and navigation problem, focusing on the vehicle-level requirements that enable a successful mission. An inertial-only system is shown to be insufficient for heliocentric flyby due to large inertial integration errors from launch through disposal maneuver while on a trans-lunar trajectory. The various options for aiding the navigation system are presented and details are provided on the use of GPS to bound the state errors in orbit to improve the capability for stage disposal. The state estimation algorithm used is described as well as its capability in determination of the vehicle state at the start of the planned maneuver. This data, both dispersions on state and on errors, is then used to develop orbital targets to use for meeting the required Lunar flyby for entering onto a heliocentric trajectory. The effect of guidance and navigation errors on this capability is described as well as the identified constraints for achieving the disposal requirements. Additionally, discussion is provided on continued analysis and identification of system considerations that can drive the ability to integrate onto a vehicle intended for deep space.

Anzalone, Evan J.↗

Safe Tracking Control of an Uncertain Euler-Lagrange System with Full-State Constraints using Barrier Functions

This paper presents a novel, safe tracking control design method that learns the parameters of an uncertain Euler-Lagrange (EL) system online using adaptive learning laws. A barrier function (BF) is first used to transform the full-state constrained EL-dynamics into an equivalent unconstrained dynamics. An adaptive tracking controller is then developed along with the parameter update law in the transformed state space such that the states remain bounded for all time within a prescribed bound. A stability analysis is developed that considers the EL-dynamics’ uncertainty, yielding a semi-globally uniformly ultimately bounded (SGUUB) tracking error and the parameter estimation error. The controller design is validated in simulations using a two-link planar manipulator. The results show the proposed method’s ability to track the reference trajectory while remaining inside each of the predefined state bounds.

Robots↗

Closed-loop stability of linear quadratic optimal systems in the presence of modeling errors

The well-known stabilizing property of linear quadratic state feedback design is utilized to evaluate the robustness of a linear quadratic feedback design in the presence of modeling errors. Two general conditions are obtained for allowable modeling errors such that the resulting closed-loop system remains stable. One of these conditions is applied to obtain two more particular conditions which are readily applicable to practical situations where a designer has information on the bounds of modeling errors. Relations are established between the allowable parameter uncertainty and the weighting matrices of the quadratic performance index, thereby enabling the designer to select appropriate weighting matrices to attain a robust feedback design.

Toda, M.↗

Preconditioned least‐squares Petrov–Galerkin reduced order models

Abstract In this article, we introduce a methodology for improving the accuracy and efficiency of reduced order models (ROMs) constructed using the least‐squares Petrov–Galerkin (LSPG) projection method through the introduction of preconditioning. Unlike prior related work, which focuses on preconditioning the linear systems arising within the ROM numerical solution procedure to improve linear solver performance, our approach leverages a preconditioning matrix directly within the minimization problem underlying the LSPG formulation. Applying preconditioning in this way has the potential to improve ROM accuracy for several reasons. First, preconditioning the LSPG formulation changes the norm defining the residual minimization, which can improve the residual‐based stability constant bounding the ROM solution's error. The incorporation of a preconditioner into the LSPG formulation can have the additional effect of scaling the components of the residual being minimized to make them roughly of the same magnitude, which can be beneficial when applying the LSPG method to problems with disparate scales (e.g., dimensional equations, multi‐physics problems). Importantly, we demonstrate that an “ideal preconditioned” LSPG ROM (a ROM in which the preconditioner is the inverse of the Jacobian of its corresponding full order model) emulates projection of the full order model solution increment onto the reduced basis. This quantity defines a lower bound on the error of a ROM solution for a given reduced basis. By designing preconditioners that approximate the Jacobian inverse—as is common in designing preconditioners for solving linear systems—it is possible to obtain a ROM whose error approaches this lower bound. The proposed approach is evaluated on several mechanical and thermo‐mechanical problems implemented within the Albany HPC code and run in the predictive regime, with prediction across material parameter space. We demonstrate numerically that the introduction of simple Jacobi, Gauss‐Seidel, and ILU preconditioners into the proper orthogonal decomposition/LSPG formulation reduces significantly the ROM solution error, the reduced Jacobian condition number, the number of nonlinear iterations required to reach convergence, and the wall time (thereby improving efficiency). Moreover, our numerical results reveal that the introduction of preconditioning can deliver a robust and accurate solution for test cases in which the unpreconditioned LSPG method fails to converge.

Lindsay, Payton↗

Group-theoretic error mitigation enabled by classical shadows and symmetries

Abstract Estimating expectation values is a key subroutine in quantum algorithms. Near-term implementations face two major challenges: a limited number of samples required to learn a large collection of observables, and the accumulation of errors in devices without quantum error correction. To address these challenges simultaneously, we develop a quantum error-mitigation strategy called symmetry-adjusted classical shadows , by adjusting classical-shadow tomography according to how symmetries are corrupted by device errors. As a concrete example, we highlight global U(1) symmetry, which manifests in fermions as particle number and in spins as total magnetization, and illustrate their group-theoretic unification with respective classical-shadow protocols. We establish rigorous sampling bounds under readout errors obeying minimal assumptions, and perform numerical experiments with a more comprehensive model of gate-level errors derived from existing quantum processors. Our results reveal symmetry-adjusted classical shadows as a low-cost strategy to mitigate errors from noisy quantum experiments in the ubiquitous presence of symmetry.

Zhao, Andrew (ORCID:0000000202990277)↗

Byte-precision level of detail processing for variable precision analytics

I/O bottlenecks in HPC applications are becoming a more pressing problem as compute capabilities continue to outpace I/O capabilities. While double-precision simulation data often must be stored losslessly, the loss of some of the fractional component may introduce acceptably small errors to many types of scientific analyses. Given this observation, we develop a precision level of detail (APLOD) library, which partitions double-precision datasets along user-defined byte boundaries. APLOD parameterizes the analysis accuracy-I/O performance tradeoff, bounds maximum relative error, maintains I/O access patterns compared to full precision, and operates with low overhead. Using ADIOS as an I/O use-case, we show proportional reduction in disk access time to the degree of precision. Finally, we show the effects of partial precision analysis on accuracy for operations such as k-means and Fourier analysis, finding a strong applicability for the use of varying degrees of precision to reduce the cost of analyzing extreme-scale data.

Jenkins, John↗

Byte-precision level of detail processing for variable precision analytics

I/O bottlenecks in HPC applications are becoming a more pressing problem as compute capabilities continue to outpace I/O capabilities. While double-precision simulation data often must be stored losslessly, the loss of some of the fractional component may introduce acceptably small errors to many types of scientific analyses. Given this observation, we develop a precision level of detail (APLOD) library, which partitions double-precision datasets along user-defined byte boundaries. APLOD parameterizes the analysis accuracy-I/O performance tradeoff, bounds maximum relative error, maintains I/O access patterns compared to full precision, and operates with low overhead. Using ADIOS as an I/O use-case, we show proportional reduction in disk access time to the degree of precision. Finally, we show the effects of partial precision analysis on accuracy for operations such as k-means and Fourier analysis, finding a strong applicability for the use of varying degrees of precision to reduce the cost of analyzing extreme-scale data.

Jenkins, John↗

Quadratic pseudospectrum for identifying localized states

Here we examine the utility of the quadratic pseudospectrum for understanding and detecting states that are somewhat localized in position and energy, in particular, in the context of condensed matter physics. Specifically, the quadratic pseudospectrum represents a method for approaching systems with incompatible observables {A j |1 ≤ j ≤ d} as it minimizes collectively the errors $\parallel$A j v - λ j v$\parallel$ while defining a joint approximate spectrum of incompatible observables. Moreover, we derive an important estimate relating the Clifford and quadratic pseudospectra. Finally, we prove that the quadratic pseudospectrum is local and derive the bounds on the errors that are incurred by truncating the system in the vicinity of where the pseudospectrum is being calculated.

97 MATHEMATICS AND COMPUTING↗

Measurement uncertainty relations

Measurement uncertainty relations are quantitative bounds on the errors in an approximate joint measurement of two observables. They can be seen as a generalization of the error/disturbance tradeoff first discussed heuristically by Heisenberg. Here we prove such relations for the case of two canonically conjugate observables like position and momentum, and establish a close connection with the more familiar preparation uncertainty relations constraining the sharpness of the distributions of the two observables in the same state. Both sets of relations are generalized to means of order α rather than the usual quadratic means, and we show that the optimal constants are the same for preparation and for measurement uncertainty. The constants are determined numerically and compared with some bounds in the literature. In both cases, the near-saturation of the inequalities entails that the state (resp. observable) is uniformly close to a minimizing one.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

The condition of a finite Markov chain and perturbation bounds for the limiting probabilities

The inequalities bounding the relative error the norm of w- w squiggly/the norm of w are exhibited by a very simple function of E and A. Let T denote the transition matrix of an ergodic chain, C, and let A = I - T. Let E be a perturbation matrix such that T squiggly = T - E is also the transition matrix of an ergodic chain, C squiggly. Let w and w squiggly denote the limiting probability (row) vectors for C and C squiggly. The inequality is the best one possible. This bound can be significant in the numerical determination of the limiting probabilities for an ergodic chain. In addition to presenting a sharp bound for the norm of w-w squiggly/the norm of w an explicit expression for w squiggly will be derived in which w squiggly is given as a function of E, A, w and some other related terms.

Meyer, C. D., Jr.↗