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 667 records · Page 37
All sourcesNASA NTRSDOE OSTI
NASA NTRS1976

Sub-baud coding

In a spread-spectrum communication system, a data sequence of +1's and -1's is expanded into a sequence of +x's (bottom bar) and -x's (bottom bar) where x (bottom bar) is a length n sequence of +1's and -1's. A sub-baud code is the assignment of a different such baud sequence to each of M users with the objective of reducing interference between users. It is shown that this interference can be described in terms of the even and odd correlation functions between pairs of sequences. A technique for deriving sub-baud codes from cyclic error-correcting codes is given, and a theorem proved which bounds the quality of the resultant code. A specific such cyclic code construction procedure is given which, for any M, yields a sub-baud code for which the mutual interference can be made arbitrarily small by choosing n sufficiently large.

Massey, J. L.↗
NASA NTRS1977

Analysis of the passive stabilization of the long duration exposure facility

The nominal Long Duration Exposure Facility (LDEF) configurations and the anticipated orbit parameters are presented. A linear steady state analysis was performed using these parameters. The effects of orbit eccentricity, solar pressure, aerodynamic pressure, magnetic dipole, and the magnetically anchored rate damper were evaluated to determine the configuration sensitivity to variations in these parameters. The worst case conditions for steady state errors were identified, and the performance capability calculated. Garber instability bounds were evaluated for the range of configuration and damping coefficients under consideration. The transient damping capabilities of the damper were examined, and the time constant as a function of damping coefficient and spacecraft moment of inertia determined. The capture capabilities of the damper were calculated, and the results combined with steady state, transient, and Garber instability analyses to select damper design parameters.

Siegel, S. H.↗
NASA NTRS1982

Real time estimation and prediction of ship motions using Kalman filtering techniques

A landing scheme for landing V/STOL aircraft on rolling ships was sought using computerized simulations. The equations of motion as derived from hydrodynamics, their form and the physical mechanisms involved and the general form of the approximation are discussed. The modeling of the sea is discussed. The derivation of the state-space equations for the DD-963 destroyer is described. Kalman filter studies are presented and the influence of the various parameters is assessed. The effect of various modeling parameters on the rms error is assessed and simplifying conclusions are drawn. An upper bound for prediction time of about five seconds is established, with the exception of roll, which can be predicted up to ten seconds ahead.

Triantafyllou, M. A.↗
NASA NTRS1989

The dissociation energy of He2(+)

Ab initio potential energy curves for He2(+) are computed using full CI wavefunctions in conjuction with large Gaussian and Slater basis sets. The computed curves yield rotational-vibrational transitions with errors of less than 1/cm. They also yield quasi-bound levels with energies and lifetimes in reasonable agreement with translational spectroscopy measurements. The best D(e) is estimated to be 2.470 eV. Green's function Monte Carlo calculations yield a very similar value, 2.466 + or - 0.005.

Bauschlicher, Charles W., Jr.↗
NASA NTRS1993

Galileo EM-2 contributions to the lunar control network

A local control network is being developed using Galileo images that cover the region north of the Apollo area and lie between 10 and 100 degrees east longitude. This network is tied to the Apollo control network and will have a positional accuracy of approximately 500-1500 m. This region has been photographed by Earth-based telescopes and the Mariner 10 and Lunar Orbiter spacecraft, but the Gallileo images are preferred for control because of their superior viewing angles, resolution, and Galileo's geometrically stable sensor. Based on Davies et al., 1987, the potential accuracy of the near-side Apollo network is estimated to be between 50 and 300 m. The laser ranging retroreflector locations at the Apollo 11, 14, and 15 sites and the Lunikhod 2 site have been determined with an accuracy of about 10 m. The locations of the ALSEP transmitters relative to the retroreflectors have also been measured. These known coordinates are used to estimate errors in the Apollo network. The telescopic control is approximately bounded by 75 degrees north and south latitude and 75 degrees east and west longitudes. The accuracy of the telescopic network is thought to be about one to two km. Thus, the Galileo network might improve coordinates in the telescopic area as well as north and east of it.

Davies, M. E.↗
DOE OSTI2022

Evaluation of dynamic testing of full-scale wind turbine drivetrains with hardware-in-the-loop

Dynamometer testing of full-scale wind turbine drivetrains involves subjecting integrated components to extreme static loads, fatigue loads, or dynamic loads to replicate field conditions. This paper provides a detailed evaluation of the uncertainty and errors in applied loads and measured responses, and their magnitude relative to established repeatability bounds for a drivetrain subjected to static and dynamic loads on the 7.5 MW test bench at the Clemson University Wind Turbine Drivetrain Testing Facility. An ideal drivetrain simulation model is utilized to isolate the influence of load tracking errors on test article responses. It is shown that the test article response variations are mainly driven by run out and clearances inherent to the drivetrain. For the dynamic profiles, the load tracking errors are within acceptable limits. Furthermore, a frequency analysis is used to show that the test bench controller tracking performance is acceptable for profiles with frequency content up to 1.5 Hz.

17 WIND ENERGY↗
DOE OSTI2025

A new upper bound for the growth factor in Gaussian elimination with complete pivoting

Abstract The growth factor in Gaussian elimination measures how large the entries of an LU factorization can be relative to the entries of the original matrix. It is a key parameter in error estimates, and one of the most fundamental topics in numerical analysis. We produce an upper bound of for the growth factor in Gaussian elimination with complete pivoting — the first improvement upon Wilkinson's original 1961 bound of .

Bisain, Ankit [Department of Mathematics Massachus↗
DOE OSTI2022

Characterizing the Reproducibility of Noisy Quantum Circuits

The ability of a quantum computer to reproduce or replicate the results of a quantum circuit is a key concern for verifying and validating applications of quantum computing. Statistical variations in circuit outcomes that arise from ill-characterized fluctuations in device noise may lead to computational errors and irreproducible results. While device characterization offers a direct assessment of noise, an outstanding concern is how such metrics bound the reproducibility of a given quantum circuit. Here, we first directly assess the reproducibility of a noisy quantum circuit, in terms of the Hellinger distance between the computational results, and then we show that device characterization offers an analytic bound on the observed variability. We validate the method using an ensemble of single qubit test circuits, executed on a superconducting transmon processor with well-characterized readout and gate error rates. The resulting description for circuit reproducibility, in terms of a composite device parameter, is confirmed to define an upper bound on the observed Hellinger distance, across the variable test circuits. This predictive correlation between circuit outcomes and device characterization offers an efficient method for assessing the reproducibility of noisy quantum circuits.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Benchmarking quantum logic operations relative to thresholds for fault tolerance

Contemporary methods for benchmarking noisy quantum processors typically measure average error rates or process infidelities. However, thresholds for fault-tolerant quantum error correction are given in terms of worst-case error rates—defined via the diamond norm—which can differ from average error rates by orders of magnitude. One method for resolving this discrepancy is to randomize the physical implementation of quantum gates, using techniques like randomized compiling (RC). In this work, we use gate set tomography to perform precision characterization of a set of two-qubit logic gates to study RC on a superconducting quantum processor. We find that, under RC, gate errors are accurately described by a stochastic Pauli noise model without coherent errors, and that spatially correlated coherent errors and non-Markovian errors are strongly suppressed. We further show that the average and worst-case error rates are equal for randomly compiled gates, and measure a maximum worst-case error of 0.0197(3) for our gate set. Our results show that randomized benchmarks are a viable route to both verifying that a quantum processor’s error rates are below a fault-tolerance threshold, and to bounding the failure rates of near-term algorithms, if—and only if—gates are implemented via randomization methods which tailor noise.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1977

Retransmission error control with memory

In this paper, an error control technique that is a basic improvement over automatic-repeat-request ARQ is presented. Erroneously received blocks in an ARQ system are used for error control. The technique is termed ARQ-with-memory (MRQ). The general MRQ system is described, and simple upper and lower bounds are derived on the throughput achievable by MRQ. The performance of MRQ with respect to throughput, message delay and probability of error is compared to that of ARQ by simulating both systems using error data from a VHF satellite channel being operated in the ALOHA packet broadcasting mode.

Sindhu, P. S.↗
NASA NTRS1977

Flight-test measurements of ground effect - STOL airplanes

Powered-lift STOL aircraft exhibit special aerodynamic characteristics that necessitate changes in established procedures of flight testing. Methods used in ground-effect flight testing of STOL-configured aircraft are described, with special emphasis on results obtained from tests of the YC-15 AMST prototype aircraft. Ground effect on lift and on drag is theoretically analyzed in terms of trailing vortices, bound vortex, and flight-path angle. Airspeed static source position errors are induced by ground constraint and must be considered in the data reduction. Flight-test results show a positive lift increment due to ground proximity.

Parks, E. K.↗
NASA NTRS1982

Reassessment of net radiation measurements in the atmosphere of Venus

An analysis was performed of the possible error mechanisms which degraded the IR net flux measurements made by the three small atmospheric probes dispatched from the Pioneer Venus spacecraft. The larger errors began below 30 km, and caused the data to be inconsistent with previous estimates of the atmospheric opacity. Evaluations were made of the possible radiation field perturbations behind each probe, cloud particle deposition on the sensor windows, and thermal disturbances within the sensors because of gas flow through the window retainers. The gas flow through the retainers was identified as the most likely error source, and was demonstrated in laboratory tests. A strong Reynolds number dependence was also found. Radiative transfer calculations were performed to account for the errors, using the constraints defined by the tests. Upper and lower bounds were calculated for the true net flux for both day and night conditions.

Revercomb, H. E.↗
NASA NTRS1985

New short constraint length, rate 1/N convolutional codes which minimize the required SNR for given desired bit error rates

It is pointed out that for a convolutional coding system, the Bit Error Rate (BER) at the Viterbi decoder output is upper-bounded by the transfer function bound. A large number of rate 1/N convolutional codes have been reported. The criteria used for determining the quality of a code in code search procedures, however, may not be very suited for cases in which the required BER is in the moderate range. For this reason, it may be best to select the code with the aim to minimize the required SNR for a given disired BER. Partial code searching techniques are presented, and a table listing the code search results is provided.

Lee, P. J.↗
NASA NTRS2012

Uncertainty Quantification for Polynomial Systems via Bernstein Expansions

This paper presents a unifying framework to uncertainty quantification for systems having polynomial response metrics that depend on both aleatory and epistemic uncertainties. The approach proposed, which is based on the Bernstein expansions of polynomials, enables bounding the range of moments and failure probabilities of response metrics as well as finding supersets of the extreme epistemic realizations where the limits of such ranges occur. These bounds and supersets, whose analytical structure renders them free of approximation error, can be made arbitrarily tight with additional computational effort. Furthermore, this framework enables determining the importance of particular uncertain parameters according to the extent to which they affect the first two moments of response metrics and failure probabilities. This analysis enables determining the parameters that should be considered uncertain as well as those that can be assumed to be constants without incurring significant error. The analytical nature of the approach eliminates the numerical error that characterizes the sampling-based techniques commonly used to propagate aleatory uncertainties as well as the possibility of under predicting the range of the statistic of interest that may result from searching for the best- and worstcase epistemic values via nonlinear optimization or sampling.

Crespo, Luis G.↗
NASA NTRS2013

Powered Descent Guidance with General Thrust-Pointing Constraints

The Powered Descent Guidance (PDG) algorithm and software for generating Mars pinpoint or precision landing guidance profiles has been enhanced to incorporate thrust-pointing constraints. Pointing constraints would typically be needed for onboard sensor and navigation systems that have specific field-of-view requirements to generate valid ground proximity and terrain-relative state measurements. The original PDG algorithm was designed to enforce both control and state constraints, including maximum and minimum thrust bounds, avoidance of the ground or descent within a glide slope cone, and maximum speed limits. The thrust-bound and thrust-pointing constraints within PDG are non-convex, which in general requires nonlinear optimization methods to generate solutions. The short duration of Mars powered descent requires guaranteed PDG convergence to a solution within a finite time; however, nonlinear optimization methods have no guarantees of convergence to the global optimal or convergence within finite computation time. A lossless convexification developed for the original PDG algorithm relaxed the non-convex thrust bound constraints. This relaxation was theoretically proven to provide valid and optimal solutions for the original, non-convex problem within a convex framework. As with the thrust bound constraint, a relaxation of the thrust-pointing constraint also provides a lossless convexification that ensures the enhanced relaxed PDG algorithm remains convex and retains validity for the original nonconvex problem. The enhanced PDG algorithm provides guidance profiles for pinpoint and precision landing that minimize fuel usage, minimize landing error to the target, and ensure satisfaction of all position and control constraints, including thrust bounds and now thrust-pointing constraints.

Carson, John M., III↗
NASA NTRS1987

Cyclic unequal error protection codes constructed from cyclic codes of composite length

The distance structure of cyclic codes of composite length was investigated. A lower bound on the minimum distance for this class of codes is derived. In many cases, the lower bound gives the true minimum distance of a code. Then the distance structure of the direct sum of two cyclic codes of composite length were investigated. It was shown that, under certain conditions, the direct-sum code provides two levels of error correcting capability, and hence is a two-level unequal error protection (UEP) code. Finally, a class of two-level UEP cyclic direct-sum codes and a decoding algorithm for a subclass of these codes are presented.

Lin, Shu↗
DOE OSTI2021

Uncertainty bounds for multivariate machine learning predictions on high-strain brittle fracture

Simulation of the crack network evolution on high strain rate impact experiments performed in brittle materials is very compute-intensive. The cost increases even more if multiple simulations are needed to account for the randomness in crack length, location, and orientation, which is inherently found in real-world materials. Constructing a machine learning emulator can make the process faster by orders of magnitude. There has been little work, however, on assessing the error associated with their predictions. Estimating these errors is imperative for meaningful overall uncertainty quantification. In this work, we extend the heteroscedastic uncertainty estimates to bound a multiple output machine learning emulator. Overall, we find that the response prediction is accurate within its predicted errors, but with a somewhat conservative estimate of uncertainty.

36 MATERIALS SCIENCE↗