Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “error 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 523 records · Page 29
All sourcesNASA NTRSDOE OSTI
NASA NTRS1999

Model Error Estimation for the CPTEC Eta Model

Statistical data assimilation systems require the specification of forecast and observation error statistics. Forecast error is due to model imperfections and differences between the initial condition and the actual state of the atmosphere. Practical four-dimensional variational (4D-Var) methods try to fit the forecast state to the observations and assume that the model error is negligible. Here with a number of simplifying assumption, a framework is developed for isolating the model error given the forecast error at two lead-times. Two definitions are proposed for the Talagrand ratio tau, the fraction of the forecast error due to model error rather than initial condition error. Data from the CPTEC Eta Model running operationally over South America are used to calculate forecast error statistics and lower bounds for tau.

Tippett, Michael K.↗
NASA NTRS2015

Standards for Radiation Effects Testing: Ensuring Scientific Rigor in the Face of Budget Realities and Modern Device Challenges

An overview is presented of the space radiation environment and its effects on electrical, electronic, and electromechanical parts. Relevant test standards and guidelines are listed. Test standards and guidelines are necessary to ensure best practices, minimize and bound systematic and random errors, and to ensure comparable results from different testers and vendors. Test standards are by their nature static but exist in a dynamic environment of advancing technology and radiation effects research. New technologies, failure mechanisms, and advancement in our understanding of known failure mechanisms drive the revision or development of test standards. Changes to standards must be weighed against their impact on cost and existing part qualifications. There must be consensus on new best practices. The complexity of some new technologies exceeds the scope of existing test standards and may require development of a guideline specific to the technology. Examples are given to illuminate the value and limitations of key radiation test standards as well as the challenges in keeping these standards up to date.

Test Standard↗
NASA NTRS2016

Investigation of Non-Equilibrium Radiation for Earth Entry

For Earth re-entry at velocities between 8 and 11.5 km/s, the accuracy of NASA's computational uid dynamic and radiative simulations of non-equilibrium shock layer radiation is assessed through comparisons with measurements. These measurements were obtained in the NASA Ames Research Center's Electric Arc Shock Tube (EAST) facility. The experiments were aimed at measuring the spatially and spectrally resolved radiance at relevant entry conditions for both an approximate Earth atmosphere (79% N2 : 21% O2 by mole) as well as a more accurate composition featuring the trace species Ar and CO2 (78.08% N2 : 20.95% O2 : 0.04% CO2 : 0.93% Ar by mole). The experiments were configured to target a wide range of conditions, of which shots from 8 to 11.5 km/s at 0.2 Torr (26.7 Pa) are examined in this paper. The non-equilibrium component was chosen to be the focus of this study as it can account for a significant percentage of the emitted radiation for Earth re-entry, and more importantly, non-equilibrium has traditionally been assigned a large uncertainty for vehicle design. The main goals of this study are to present the shock tube data in the form of a non-equilibrium metric, evaluate the level of agreement between the experiment and simulations, identify key discrepancies and to examine critical aspects of modeling non-equilibrium radiating flows. Radiance pro les integrated over discreet wavelength regions, ranging from the Vacuum Ultra Violet (VUV) through to the Near Infra-Red (NIR), were compared in order to maximize both the spectral coverage and the number of experiments that could be used in the analysis. A previously defined non-equilibrium metric has been used to allow comparisons with several shots and reveal trends in the data. Overall, LAURA/HARA is shown to under-predict EAST by as much as 40% and over-predict by as much as 12% depending on the shock speed. DPLR/NEQAIR is shown to under-predict EAST by as much as 50% and over-predict by as much as 20% depending on the shock speed. The one standard deviation scatter in the EAST results was calculated to be 31%. An estimate for the upper bound of the absolute error in wall-directed heat flux was calculated. Below 9 km/s, where the relative difference is large, the absolute error in radiative heat flux due to non-equilibrium models is estimated to be less then 1 W/sq cm. At the highest shock speed of 11 km/s, the error in non-equilibrium is estimated to be less than 20 W/sq cm.

Shock Tube↗
NASA NTRS2016

Solar Probe Plus: Unique Navigation Modeling Challenges

The Solar Probe Plus (SPP) mission is preparing to launch in 2018, and will directly investigate the outer atmosphere of our star. At 9.86 solar radii, SPP must operate in an unexplored regime. The environment and aspects of the mission design present some unique challenges for navigation, particularly in terms of modeling the dynamics. Non-gravitational force models, unique to this mission, are given with analytical expressions. For each of these models (and error sources), a maximum bound on the force perturbation magnitude is quantified numerically. Additionally, the effect of charged particles on radiometric observables is discussed, along with methods being employed to pre-process the measurements. This survey is an overview of unique modeling employed by SPP navigation, but also a reference for future missions traveling near the Sun.

Jones, Drew Ryan↗
NASA NTRSDate not supplied

Particle Size Distribution Parameters from SAGE III/ISS Extinction Spectra

Stratospheric aerosols play key roles in the chemistry and radiation balance of the atmosphere and are a key input parameter for global chemistry and climate models. The degree to which aerosols impact chemistry and radiation balance depends primarily on the relative abundance of different sized particles within the sample volume, often referred to as the particle size distribution (PSD). If the PSD is accurately known then other key modeling parameters (e.g., surface area density and effective radius) can be derived. Historically, occultation observations from orbital instruments such as SAGE III/ISS have been used to infer these PSD parameters by inverting the extinction coefficient spectra. However, past efforts routinely failed to account for measurement uncertainty and lacked a rigorous estimate of the inferred PSD uncertainty. We carried out a series of simulations to evaluate the accuracy of these inferences and, for every valid SAGE III/ISS extinction spectrum, determined the range of PSD parameters that fell withing the bounds of the extinction error bars. Special application of this method was applied to estimate the impact of the 2022 Hunga Tonga eruption had on particle size distributions.

Travis N Knepp↗
NASA NTRS1986

Performance analysis of a cascaded coding scheme with interleaved outer code

A cascaded coding scheme for a random error channel with a bit-error rate is analyzed. In this scheme, the inner code C sub 1 is an (n sub 1, m sub 1l) binary linear block code which is designed for simultaneous error correction and detection. The outer code C sub 2 is a linear block code with symbols from the Galois field GF (2 sup l) which is designed for correcting both symbol errors and erasures, and is interleaved with a degree m sub 1. A procedure for computing the probability of a correct decoding is presented and an upper bound on the probability of a decoding error is derived. The bound provides much better results than the previous bound for a cascaded coding scheme with an interleaved outer code. Example schemes with inner codes ranging from high rates to very low rates are evaluated. Several schemes provide extremely high reliability even for very high bit-error rates say 10 to the -1 to 10 to the -2 power.

Lin, S.↗
NASA NTRS1999

Investigation of Measurement Errors in Doppler Global Velocimetry

While the initial development phase of Doppler Global Velocimetry (DGV) has been successfully completed, there remains a critical next phase to be conducted, namely the determination of an error budget to provide quantitative bounds for measurements obtained by this technology. This paper describes a laboratory investigation that consisted of a detailed interrogation of potential error sources to determine their contribution to the overall DGV error budget. A few sources of error were obvious; e.g., iodine vapor adsorption lines, optical systems, and camera characteristics. However, additional non-obvious sources were also discovered; e.g., laser frequency and single-frequency stability, media scattering characteristics, and interference fringes. This paper describes each identified error source, its effect on the overall error budget, and where possible, corrective procedures to reduce or eliminate its effect.

Meyers, James F.↗
NASA NTRS1981

The Theory and Practice of Estimating the Accuracy of Dynamic Flight-Determined Coefficients

Means of assessing the accuracy of maximum likelihood parameter estimates obtained from dynamic flight data are discussed. The most commonly used analytical predictors of accuracy are derived and compared from both statistical and simplified geometrics standpoints. The accuracy predictions are evaluated with real and simulated data, with an emphasis on practical considerations, such as modeling error. Improved computations of the Cramer-Rao bound to correct large discrepancies due to colored noise and modeling error are presented. The corrected Cramer-Rao bound is shown to be the best available analytical predictor of accuracy, and several practical examples of the use of the Cramer-Rao bound are given. Engineering judgement, aided by such analytical tools, is the final arbiter of accuracy estimation.

Maine, R. E.↗
NASA NTRS1987

Fault-tolerant clock synchronization validation methodology

A validation method for the synchronization subsystem of a fault-tolerant computer system is presented. The high reliability requirement of flight-crucial systems precludes the use of most traditional validation methods. The method presented utilizes formal design proof to uncover design and coding errors and experimentation to validate the assumptions of the design proof. The experimental method is described and illustrated by validating the clock synchronization system of the Software Implemented Fault Tolerance computer. The design proof of the algorithm includes a theorem that defines the maximum skew between any two nonfaulty clocks in the system in terms of specific system parameters. Most of these parameters are deterministic. One crucial parameter is the upper bound on the clock read error, which is stochastic. The probability that this upper bound is exceeded is calculated from data obtained by the measurement of system parameters. This probability is then included in a detailed reliability analysis of the system.

Computer systems↗
DOE OSTI2025

Perturbative Stability and Error-Correction Thresholds of Quantum Codes

Topologically ordered phases are stable to local perturbations, and topological quantum error-correcting codes enjoy thresholds to local errors. We connect the two notions of stability by constructing classical statistical mechanics models for decoding general Calderbank-Shor-Steane codes and classical linear codes. Our construction encodes correction success probabilities under uncorrelated bit-flip and phase-flip errors, and simultaneously describes a generalized ℤ 2 lattice-gauge theory with quenched disorder. We observe that the clean limit of the latter is precisely the discretized imaginary-time path integral of the corresponding quantum code Hamiltonian when the errors are turned into a perturbative 𝑋 or 𝑍 magnetic field. Motivated by error-correction considerations, we define general order parameters for all such generalized ℤ 2 lattice-gauge theories, and show that they are generally lower bounded by success probabilities of error correction. For CSS codes satisfying the low-density parity-check condition and with a sufficiently large code distance, we prove the existence of a low-temperature ordered phase of the corresponding lattice-gauge theories, particularly for those lacking Euclidean spatial locality and/or when there is a nonzero code rate. We further argue that these results provide evidence for stable phases in the corresponding perturbed quantum Hamiltonians, obtained in the limit of continuous imaginary time. To do so, we distinguish space- and timelike defects in the lattice-gauge theory. A high free-energy cost of spacelike defects corresponds to a successful “memory experiment” and suppresses the energy splitting among the ground states, while a high free-energy cost of timelike defects corresponds to a successful “stability experiment” and points to a nonzero gap to local excitations.

quantum error correction↗
NASA NTRS1978

Adaptive finite element analysis based on p-convergence

The results of numerical experiments are presented in which a posteriori estimators of error in strain energy were examined on the basis of a typical problem in linear elastic fracture mechanics. Two estimators were found to give close upper and lower bounds for the strain energy error. The potential significance of this is that the same estimators may provide a suitable basis for adaptive redistribution of the degrees of freedom in finite element models.

Szabo, B. A.↗
DOE OSTI2022

Provably accurate simulation of gauge theories and bosonic systems

Quantum many-body systems involving bosonic modes or gauge fields have infinite-dimensional local Hilbert spaces which must be truncated to perform simulations of real-time dynamics on classical or quantum computers. To analyze the truncation error, we develop methods for bounding the rate of growth of local quantum numbers such as the occupation number of a mode at a lattice site, or the electric field at a lattice link. Our approach applies to various models of bosons interacting with spins or fermions, and also to both abelian and non-abelian gauge theories. We show that if states in these models are truncated by imposing an upper limit Λ on each local quantum number, and if the initial state has low local quantum numbers, then an error at most ϵ can be achieved by choosing Λ to scale polylogarithmically with ϵ − 1 , an exponential improvement over previous bounds based on energy conservation. For the Hubbard-Holstein model, we numerically compute a bound on Λ that achieves accuracy ϵ , obtaining significantly improved estimates in various parameter regimes. We also establish a criterion for truncating the Hamiltonian with a provable guarantee on the accuracy of time evolution. Building on that result, we formulate quantum algorithms for dynamical simulation of lattice gauge theories and of models with bosonic modes; the gate complexity depends almost linearly on spacetime volume in the former case, and almost quadratically on time in the latter case. We establish a lower bound showing that there are systems involving bosons for which this quadratic scaling with time cannot be improved. By applying our result on the truncation error in time evolution, we also prove that spectrally isolated energy eigenstates can be approximated with accuracy ϵ by truncating local quantum numbers at Λ = polylog ( ϵ − 1 ) .

Tong, Yu↗
DOE OSTI2020

Quantifying the generalization error in deep learning in terms of data distribution and neural network smoothness

We report the accuracy of deep learning, i.e., deep neural networks, can be characterized by dividing the total error into three main types: approximation error, optimization error, and generalization error. Whereas there are some satisfactory answers to the problems of approximation and optimization, much less is known about the theory of generalization. Most existing theoretical works for generalization fail to explain the performance of neural networks in practice. To derive a meaningful bound, we study the generalization error of neural networks for classification problems in terms of data distribution and neural network smoothness. We introduce the cover complexity (CC) to measure the difficulty of learning a data set and the inverse of the modulus of continuity to quantify neural network smoothness. A quantitative bound for expected accuracy/error is derived by considering both the CC and neural network smoothness. Although most of the analysis is general and not specific to neural networks, we validate our theoretical assumptions and results numerically for neural networks by several data sets of images. The numerical results confirm that the expected error of trained networks scaled with the square root of the number of classes has a linear relationship with respect to the CC. We also observe a clear consistency between test loss and neural network smoothness during the training process. In addition, we demonstrate empirically that the neural network smoothness decreases when the network size increases whereas the smoothness is insensitive to training dataset size.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1974

Convolutional codes. II - Maximum-likelihood decoding. III - Sequential decoding

Maximum-likelihood decoding is characterized as the determination of the shortest path through a topological structure called a trellis. Aspects of code structure are discussed along with questions regarding maximum-likelihood decoding on memoryless channels. A general bounding technique is introduced. The technique is used to obtain asymptotic bounds on the probability of error for maximum-likelihood decoding and list-of-2 decoding. The basic features of sequential algorithms are discussed along with a stack algorithm, questions of computational distribution, and the martingale approach to computational bounds.

Forney, G. D., Jr.↗
DOE OSTI2023

Online and Scalable Data Compression Pipeline with Guarantees on Quantities of Interest

Data compression is becoming critical for data-intensive scientific applications. Scientists require compression techniques that accurately preserve derived quantities of interest (QoIs). Prior work has shown that a pipeline can be built to guarantee error on the primary data (PD) within user-defined bounds and achieve near-floating point QoI errors. In this paper, we present novel computational approaches for accelerating the pipeline and demonstrate results that enable concurrent execution of compression in parallel with the simulation nodes. This allows compression, including the writing of the required compression data, for the previous time step to be completed while the simulation proceeds with the current time step. Overall, the approach presented in this paper results in a 6–8 times improvement in computational overhead compared to previous work. These results were obtained using data generated by a large-scale fusion code called XGC, which produces hundreds of terabytes of data in a single day.

Banerjee, Tania↗
NASA NTRS1977

Modeling error analysis of stationary linear discrete-time filters

The performance of Kalman-type, linear, discrete-time filters in the presence of modeling errors is considered. The discussion is limited to stationary performance, and bounds are obtained for the performance index, the mean-squared error of estimates for suboptimal and optimal (Kalman) filters. The computation of these bounds requires information on only the model matrices and the range of errors for these matrices. Consequently, a design can easily compare the performance of a suboptimal filter with that of the optimal filter, when only the range of errors in the elements of the model matrices is available.

Patel, R.↗
NASA NTRS1991

Test functions for the moment method which yield the minimum mean square error

The method of moments has found extensive applications in the solution of a wide class of electromagnetic problems. Additionally, there are a number of basis functions which have found favor and with them different types of testing methods. This work examines the selection of test functions, given a selected set of basis functions, which serve to minimize the mean square error. These test functions will guarantee equal or lesser error compared with any other test function. Additionally, these test functions provide a monotonic improvement of the approximation as the increase in the order of the system. Hence while these test functions require the application of the differential or integral operator one additional time, they provide an absolute lower bound to the mean square error in the approximation and a means to systematically improve accuracy with each increase in the order of the unknowns.

Shamansky, H.↗
DOE OSTI2024

Towards optimal sensor placement for inverse problems in spaces of measures

The objective of this work is to quantify the reconstruction error in sparse inverse problems with measures and stochastic noise, motivated by optimal sensor placement. To be useful in this context, the error quantities must be explicit in the sensor configuration and robust with respect to the source, yet relatively easy to compute in practice, compared to a direct evaluation of the error by a large number of samples. In particular, we consider the identification of a measure consisting of an unknown linear combination of point sources from a finite number of measurements contaminated by Gaussian noise. The statistical framework for recovery relies on two main ingredients: first, a convex but non-smooth variational Tikhonov point estimator over the space of Radon measures and, second, a suitable mean-squared error based on its Hellinger–Kantorovich distance to the ground truth. To quantify the error, we employ a non-degenerate source condition as well as careful linearization arguments to derive a computable upper bound. This leads to asymptotically sharp error estimates in expectation that are explicit in the sensor configuration. Thus they can be used to estimate the expected reconstruction error for a given sensor configuration and guide the placement of sensors in sparse inverse problems.

97 MATHEMATICS AND COMPUTING↗