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 415 records · Page 23

Locality and Digital Quantum Simulation of Power-Law Interactions

The propagation of information in nonrelativistic quantum systems obeys a speed limit known as a Lieb-Robinson bound. We derive a new Lieb-Robinson bound for systems with interactions that decay with distance r as a power law, 1 / r α . The bound implies an effective light cone tighter than all previous bounds. Our approach is based on a technique for approximating the time evolution of a system, which was first introduced as part of a quantum simulation algorithm by Haah et al ., FOCS’18. To bound the error of the approximation, we use a known Lieb-Robinson bound that is weaker than the bound we establish. This result brings the analysis full circle, suggesting a deep connection between Lieb-Robinson bounds and digital quantum simulation. In addition to the new Lieb-Robinson bound, our analysis also gives an error bound for the Haah et al. quantum simulation algorithm when used to simulate power-law decaying interactions. In particular, we show that the gate count of the algorithm scales with the system size better than existing algorithms when α > 3 D (where D is the number of dimensions).

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A lower bound for the decoder error probability of the linear MDS code

A lower bound for the decoder error probability (P sub E (u)) of a linear maximum distance separable (MDS) code is derived by counting the dominant types of decoding words around code words. It is shown that the lower bound derived is similar in form, and close numerically, to the upper bound derived.

Cheung, K.-M.↗

Multi-fidelity thermal modeling of laser powder bed additive manufacturing

Laser powder bed fusion (LPBF) Additive manufacturing (AM) has attracted interest as an agile method of building production metal parts to reduce design-build-test cycle times for systems. However, predicting part performance is difficult due to inherent process variabilities. This makes qualification challenging. Computational process models have attempted to address some of these challenges, including mesoscale, full physics models and reduced fidelity conduction models. The goal of this work is credible multi-fidelity modeling of the LPBF process by investigating methods for estimating the error between models of two different fidelities. Two methods of error estimation are investigated, adjoint-based error estimation and Bayesian calibration. Adjoint-based error estimation is found to effectively bounding the error between the two models, but with very conservative bounds, making predictions highly uncertain. Bayesian parameter calibration applied to conduction model heat source parameters is found to effectively bound the observed error between the models for melt pool morphology quantities of interest. However, the calibrations do not effectively bound the error in heat distribution.

36 MATERIALS SCIENCE↗

Experimental Robust Control of Structural Acoustic Radiation

This work addresses the design and application of robust controllers for structural acoustic control. Both simulation and experimental results are presented. H(infinity) and mu-synthesis design methods were used to design feedback controllers which minimize power radiated from a panel while avoiding instability due to unmodeled dynamics. Specifically, high order structural modes which couple strongly to the actuator-sensor path were poorly modeled. This model error was analytically bounded with an uncertainty model, which allowed controllers to be designed without artificial limits on control effort. It is found that robust control methods provide the control designer with physically meaningful parameters with which to tune control designs and can be very useful in determining limits of performance. Experimental results also showed, however, poor robustness properties for control designs with ad-hoc uncertainty models. The importance of quantifying and bounding model errors is discussed.

Cox, David E.↗

Minimum-error discrimination of quantum states: Bounds and comparisons

We derive a new bound on the minimum-error probability for ambiguous discrimination and compare the new bound with six other bounds in the literature. Specifically, the main technical contributions are as follows. (1) We obtain a general lower bound on the minimum-error probability for ambiguous discrimination among arbitrary m mixed quantum states with given prior probabilities. We further analyze how this lower bound is attainable by presenting a necessary and sufficient condition related to it. (2) We compare this new lower bound with six other bounds in the literature, in detail. We show that this new bound improves the previous one in the literature and in the equiprobable case; the new bound also improves another one. Moreover, we give an example to show that this new bound is the tightest one for some cases.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Bounds of the bit error probability of a linear cyclic code over GF(2 exp l) and its extended code

An upper bound on the bit-error probability (BEP) of a linear cyclic code over GF(2 exp l) with hard-decision (HD) maximum-likelihood (ML) decoding on memoryless symmetric channels is derived. Performance results are presented for Reed-Solomon codes on GF(32), GF(64), and GF(128). Also, a union upper bound on the BEP of a linear cyclic code with either HD or soft-decision (SD) ML decoding is developed, as well as the corresponding bounds for the extended code of a linear cyclic code. Using these bounds, which are tight at low bit error rate, the performance advantage of SD and HD ML over bounded-distance decoding is established.

Cheng, Unjeng↗

A Very Efficient Transfer Function Bounding Technique on Bit Error Rate for Viterbi Decoded, Rate 1/N Convolutional Codes

For rate 1/N convolutional codes, a recursive algorithm for finding the transfer function bound on bit error rate (BER) at the output of a Viterbi decoder is described. This technique is very fast and requires very little storage since all the unnecessary operations are eliminated. Using this technique, we find and plot bounds on the BER performance of known codes of rate 1/2 with K 18, rate 1/3 with K 14. When more than one reported code with the same parameter is known, we select the code that minimizes the required signal to noise ratio for a desired bit error rate of 0.000001. This criterion of determining goodness of a code had previously been found to be more useful than the maximum free distance criterion and was used in the code search procedures of very short constraint length codes. This very efficient technique can also be used for searches of longer constraint length codes.

Lee, P. J.↗

An adaptive pseudo-spectral method for reaction diffusion problems

The spectral interpolation error was considered for both the Chebyshev pseudo-spectral and Galerkin approximations. A family of functionals I sub r (u), with the property that the maximum norm of the error is bounded by I sub r (u)/J sub r, where r is an integer and J is the degree of the polynomial approximation, was developed. These functionals are used in the adaptive procedure whereby the problem is dynamically transformed to minimize I sub r (u). The number of collocation points is then chosen to maintain a prescribed error bound. The method is illustrated by various examples from combustion problems in one and two dimensions.

Bayliss, A.↗

An adaptive pseudo-spectral method for reaction diffusion problems

The spectral interpolation error was considered for both the Chebyshev pseudo-spectral and Galerkin approximations. A family of functionals I sub r (u), with the property that the maximum norm of the error is bounded by I sub r (u)/J sub r, where r is an integer and J is the degree of the polynomial approximation, was developed. These functionals are used in the adaptive procedure whereby the problem is dynamically transformed to minimize I sub r (u). The number of collocation points is then chosen to maintain a prescribed error bound. The method is illustrated by various examples from combustion problems in one and two dimensions.

Bayliss, A.↗

Hierarchical Bayesian Inverse Problems: A High-Dimensional Statistics Viewpoint

This paper analyzes hierarchical Bayesian inverse problems using techniques from highdimensional statistics. Furthermore, our analysis leverages a property of hierarchical Bayesian regularizers that we call approximate decomposability to obtain non-asymptotic bounds on the reconstruction error attained by maximum a posteriori estimators. The new theory explains how hierarchical Bayesian models that exploit sparsity, group sparsity, and sparse representations of the unknown parameter can achieve accurate reconstructions in high-dimensional settings.

MAP estimation↗

Self-regulating power management for a neural network system

A neural network runs a known input data set using an error free power setting and using an error prone power setting. The differences in the outputs of the neural network using the two different power settings determine a high level error rate associated with the output of the neural network using the error prone power setting. If the high level error rate is excessive, the error prone power setting is adjusted to reduce errors by changing voltage and/or clock frequency utilized by the neural network system. If the high level error rate is within bounds, the error prone power setting can remain allowing the neural network to operate with an acceptable error tolerance and improved efficiency. The error tolerance can be specified by the neural network application.

Kegel, Andrew G.↗

Self-regulating power management for a neural network system

A neural network runs a known input data set using an error free power setting and using an error prone power setting. The differences in the outputs of the neural network using the two different power settings determine a high level error rate associated with the output of the neural network using the error prone power setting. If the high level error rate is excessive, the error prone power setting is adjusted to reduce errors by changing voltage and/or clock frequency utilized by the neural network system. If the high level error rate is within bounds, the error prone power setting can remain allowing the neural network to operate with an acceptable error tolerance and improved efficiency. The error tolerance can be specified by the neural network application.

Kegel, Andrew G.↗

Entanglement-assisted zero-error capacity is upper-bounded by the Lovasz {theta} function

The zero-error capacity of a classical channel is expressed in terms of the independence number of some graph and its tensor powers. This quantity is hard to compute even for small graphs such as the cycle of length seven, so upper bounds such as the Lovasz theta function play an important role in zero-error communication. In this paper, we show that the Lovasz theta function is an upper bound on the zero-error capacity even in the presence of entanglement between the sender and receiver.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Analysis of Subpixel Registration Accuracy

Geometric and probabilistic models for subpixel accuracy are developed. The geometric models bound the error in offset estimation using the pixels in an observed digital straight line. One probabilistic model bounds the estimate of error offset for continuous images. The other model bounds the error for discrete images given that one is in the correct pixel.

Lavine, D.↗

Error Analysis of ZFP Compression for Floating-Point Data

Compression of floating-point data will play an important role in high-performance computing as data bandwidth and storage become dominant costs. Lossy compression of floating-point data is powerful, but theoretical results are needed to bound its errors when used to store look-up tables, simulation results, or even the solution state during the computation. In this paper, we analyze the round-off error introduced by ZFP, a lossy compression algorithm. Here, the stopping criteria for ZFP depends on the compression mode specified by the user: fixed rate, fixed accuracy, or fixed precision [P. Lindstrom, ZFP 0.5.3 Documentation, 2018]. While most of our discussion is focused on the fixed precision mode of ZFP, we establish a bound on the error introduced by all three compression modes. In order to tightly capture the error, first we introduce a vector space that allows us to work with binary representations of components. Under this vector space, we define operators that implement each step of the ZFP compression and decompression to establish a bound on the error caused by ZFP. To conclude, numerical tests are provided to demonstrate the accuracy of the established bounds.

97 MATHEMATICS AND COMPUTING↗

Design of Safe Separation Bounds for Temporally Deconflicted Trajectories Under Bounded Uncertainties

This paper explores the derivation of safe separation bounds for a heterogeneous group of~$n$ Uncrewed Aerial Systems (UAS) that are assigned temporally deconflicted trajectories. Compared to spatially deconflicted trajectories, temporal deconfliction can lead to higher traffic capacities and a more efficient use of the available airspace. One challenge with this type of deconfliction is that collisions can occur if some cooperating UAS are behind or ahead of schedule. To overcome this risk, this paper derives a lower bound on the safety distance between two heterogeneous UAS in the presence of bounded uncertainties. This safety distance can be leveraged to inform trajectory generation algorithms. The proposed bound establishes a rigorous safety margin when the fleet deviates from the planned trajectories, both temporally and spatially. For its derivation the paper assumes the UAS implement a distributed coordination algorithm that allows the fleet to maintain their schedules synchronized within a bounded temporal error, and a path-following algorithm that lets the vehicles track a target that moves along the planned trajectory with a bounded spatial error.

autonomy↗