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 721 records · Page 40

Variational fast forwarding for quantum simulation beyond the coherence time

Abstract Trotterization-based, iterative approaches to quantum simulation (QS) are restricted to simulation times less than the coherence time of the quantum computer (QC), which limits their utility in the near term. Here, we present a hybrid quantum-classical algorithm, called variational fast forwarding (VFF), for decreasing the quantum circuit depth of QSs. VFF seeks an approximate diagonalization of a short-time simulation to enable longer-time simulations using a constant number of gates. Our error analysis provides two results: (1) the simulation error of VFF scales at worst linearly in the fast-forwarded simulation time, and (2) our cost function’s operational meaning as an upper bound on average-case simulation error provides a natural termination condition for VFF. We implement VFF for the Hubbard, Ising, and Heisenberg models on a simulator. In addition, we implement VFF on Rigetti’s QC to demonstrate simulation beyond the coherence time. Finally, we show how to estimate energy eigenvalues using VFF.

97 MATHEMATICS AND COMPUTING↗

Sources of error in detonation calorimeters and error analysis for neat 2,4,6-triamino-1,3,5- trinitrobenzene (TATB)

Here, a calorimeter for measuring heats of detonation at Lawrence Livermore National Laboratory is described. A calibration precision of 0.2 % at the 95 % confidence interval (CI) is reported. Sources of uncertainty are discussed, including nonequivalent sources, which are those arising from differences between calibration and experimental tests. The systematic error due to nonequivalent sources is bounded to 0.19–0.22 % of the measured heat for a standard detonation test where the confinement material is gold. The recommendation is to correct for the systematic error by adding 0.19 % to the reported value and adding 0.03 % to the uncertainty. It is demonstrated that the precision of a detonation test is variable with testing duration because a source of uncertainty resides in the thermodynamic correction factor k6, which accounts for the contribution to heat by stirring; the generated power is additive and therefore highly impacted by total test time. The relative proportion also varies with the magnitude of heat release and sample size, adding variance to the weight of the error arising from the correction factor. A full error analysis based on the described sources of uncertainty is developed. The methodology is applied to a test series on neat 2,4,6-triamino-1,3,5- trinitrobenzene (TATB), demonstrating an ultimate precision of 0.7 % (single test) for materials testing and a relative standard deviation of 1.8 %.

47 OTHER INSTRUMENTATION↗

Generating moment matching scenarios using optimization techniques

An optimization based method is proposed to generate moment matching scenarios for numerical integration and its use in stochastic programming. The main advantage of the method is its flexibility: it can generate scenarios matching any prescribed set of moments of the underlying distribution rather than matching all moments up to a certain order, and the distribution can be defined over an arbitrary set. This allows for a reduction in the number of scenarios and allows the scenarios to be better tailored to the problem at hand. The method is based on a semi-infinite linear programming formulation of the problem that is shown to be solvable with polynomial iteration complexity. A practical column generation method is implemented. The column generation subproblems are polynomial optimization problems; however, they need not be solved to optimality. It is found that the columns in the column generation approach can be efficiently generated by random sampling. The number of scenarios generated matches a lower bound of Tchakaloff's. The rate of convergence of the approximation error is established for continuous integrands, and an improved bound is given for smooth integrands. Extensive numerical experiments are presented in which variants of the proposed method are compared to Monte Carlo and quasi-Monte Carlo methods on both numerical integration problems and stochastic optimization problems. The benefits of being able to match any prescribed set of moments, rather than all moments up to a certain order, is also demonstrated using optimization problems with 100-dimensional random vectors. Here, empirical results show that the proposed approach outperforms Monte Carlo and quasi-Monte Carlo based approaches on the tested problems.

97 MATHEMATICS AND COMPUTING↗

Demonstration of Deployment Accuracy of the Starshade Inner Disk Subsystem

We present experimental results that demonstrate the required in-plane deployment accuracy of the starshade Inner Disk Subsystem (IDS). This effort was to address Milestone 7C of the Starshade Technology Activity S5, which requires that the in-plane deployment accuracy of the petal interfaces on the IDS be within +/-300um. A full-scale 10m-diameter IDS prototype was constructed. This prototype comprised a medium-fidelity perimeter truss, medium-fidelity spokes, and a low-fidelity optical shield (OS). The testbed also included gravity compensation systems and a laser tracker metrology system. The post-processed measurement uncertainties of the laser tracker were less than 30um at the 3 sigma level. Design, engineering and fabrication of these components was done by JPL, Tendeg, and Roccor. Testing was performed at the Tendeg facility in Louisville, Colorado. The IDS prototype was deployed 22 times and the locations of petal interfaces on the IDS were measured after each deployment. Based on this data, tolerance intervals were calculated that would contain 99.73% of future deployment accuracy errors with 90% confidence. These tolerance intervals are conservative estimates for 3 sigma bounds. The tolerance intervals for the three pertinent error components were found to be within the required allocations, with at least 19% margin.

Turse, Dana↗

A posteriori error estimation and adaptivity in hp virtual elements

An explicit and computable error estimator for the hp version of the virtual element method (VEM), together with lower and upper bounds with respect to the exact energy error, is presented. Such error estimator is employed to provide, following the approach of Melenk and Wohlmuth (Adv Comput Math 15(1–4):311–331, 2001), hp adaptive mesh refinements for very general polygonal meshes. In addition, a novel VEM hp Clément quasi-interpolant, instrumental for the a posteriori error analysis, is introduced. The performances of the adaptive method are validated by a number of numerical experiments.

97 MATHEMATICS AND COMPUTING↗

Probabilistic error estimation for non-intrusive reduced models learned from data of systems governed by linear parabolic partial differential equations

This work derives a residual-based a posteriori error estimator for reduced models learned with non-intrusive model reduction from data of high-dimensional systems governed by linear parabolic partial differential equations with control inputs. It is shown that quantities that are necessary for the error estimator can be either obtained exactly as the solutions of least-squares problems in a non-intrusive way from data such as initial conditions, control inputs, and high-dimensional solution trajectories or bounded in a probabilistic sense. Here, the computational procedure follows an offline/online decomposition. In the offline (training) phase, the high-dimensional system is judiciously solved in a black-box fashion to generate data and to set up the error estimator. In the online phase, the estimator is used to bound the error of the reduced-model predictions for new initial conditions and new control inputs without recourse to the high-dimensional system. Numerical results demonstrate the workflow of the proposed approach from data to reduced models to certified predictions.

97 MATHEMATICS AND COMPUTING↗

An implicit solution for Asay foil trajectories generated by separable, sustained-production ejecta source models

We present a simple implicit solution for the time-dependent trajectory of a thin Asay foil ejecta diagnostic for the general case where the impinging ejecta cloud is generated by a source function characterized by an arbitrary (sustained) time dependence and a time-independent (stationary) particle velocity distribution. In the limit that the source function time dependence becomes a delta function, this solution—which is amenable to rapid numerical calculations of arbitrary accuracy—exactly recovers a previously published solution for the special case of instantaneous ejecta production. We also derive simple expressions for the free-surface arrival (catch-up) time as well as the true ejecta areal mass accumulation on the accelerating foil and place bounds on the level of error incurred when applying instant-production mass solutions to a sustained-production trajectory. We demonstrate these solutions with example calculations for hypothetical source functions spanning a wide range of ejecta production durations, velocity distributions, and temporal behaviors. These calculations demonstrate how the foil trajectory is often insensitive to the temporal dependence of the source function, instead being dominated by the velocity distribution. We quantify this insensitivity using a “compatibility score” metric. Under certain conditions, one may capitalize upon this insensitivity to obtain a good approximation of the second integral of the velocity distribution from the observed foil trajectory.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Determination of stability derivatives from flight data using a Newton-Raphson minimization technique

A modified Newton-Raphson or quasilinearization minimization technique for determining stability derivatives from flight data was developed and compared with simple-equations, analog-matching, least-squares, and Shinbrot methods of analysis. For the data analyzed, the solutions computed by using the estimates obtained from the Newton-Raphson technique fit the data and determined coefficients adequately. A further modification to include a priori information was found to be useful. A model statistically similar to the flight data was analyzed using the same methods (excluding analog matching), and the Newton-Raphson technique was found to yield superior estimates. An approximate Cramer-Rao bound was compared with the error covariance matrix of the model and was found to provide information about the reliability of the individual estimates obtained. The technique was successfully applied to data obtained from a light airplane, a large supersonic airplane, and a lifting body vehicle. It was shown that the reliability of the estimates of a given coefficient obtained from these vehicles depends upon the data analyzed.

Iliff, K. W.↗

Minimax control of a system with process uncertainty in substate space

The control of a single input-single output plant with parameter uncertainty was approached using a minimax technique. A linear time invariant controller results which requires only partial state feedback and is optimal in the sense that it minimizes a quadratic criterion involving tracking error, control, and parameter uncertainty. Bounded input-bounded output stability is guaranteed provided the transfer function has only left half plane zeros. If uncertainties are bounded, it is always possible to stabilize the system when sufficient control amplitude is available. The number of states required to generate the control is equal to the system order less the number of zeros.

Basuthakur, S.↗

Robustness of linear quadratic state feedback designs in the presence of system uncertainty

The paper deals with the problem of expressing the robustness (stability) property of a linear quadratic state feedback (LQSF) design quantitatively in terms of bounds on the perturbations (modeling errors or parameter variations) in the system matrices so that the closed-loop system remains stable. Nonlinear time-varying and linear time-invariant perturbations are considered. The only computation required in obtaining a measure of the robustness of an LQSF design is to determine the eigenvalues of two symmetric matrices determined when solving the algebraic Riccati equation corresponding to the LQSF design problem. Results are applied to a complex dynamic system consisting of the flare control of a STOL aircraft. The design of the flare control is formulated as an LQSF tracking problem.

Patel, R. V.↗

On the synchronizability and detectability of random PPM sequences

The problem of synchronization and detection of random pulse-position-modulation (PPM) sequences is investigated under the assumption of perfect slot synchronization. Maximum-likelihood PPM symbol synchronization and receiver algorithms are derived that make decisions based both on soft as well as hard data; these algorithms are seen to be easily implementable. Bounds derived on the symbol error probability as well as the probability of false synchronization indicate the existence of a rather severe performance floor, which can easily be the limiting factor in the overall system performance. The performance floor is inherent in the PPM format and random data and becomes more serious as the PPM alphabet size Q is increased. A way to eliminate the performance floor is suggested by inserting special PPM symbols in the random data stream.

Georghiades, Costas N.↗

A frequency-domain estimator for use in adaptive control systems

The paper presents a frequency-domain estimator which can identify both a nominal model of a plant as well as a frequency-domain bounding function on the modeling error associated with this nominal model. This estimator, which is called a robust estimator, can be used in conjunction with a robust control-law redesign algorithm to form a robust adaptive controller.

Lamaire, Richard O.↗

A frequency-domain estimator for use in adaptive control systems

This paper presents a frequency-domain estimator that can identify both a parametrized nominal model of a plant as well as a frequency-domain bounding function on the modeling error associated with this nominal model. This estimator, which we call a robust estimator, can be used in conjunction with a robust control-law redesign algorithm to form a robust adaptive controller.

Lamaire, Richard O.↗

Model reference adaptive control of flexible robots in the presence of sudden load changes

Direct command generator tracker based model reference adaptive control (MRAC) algorithms are applied to the dynamics for a flexible-joint arm in the presence of sudden load changes. Because of the need to satisfy a positive real condition, such MRAC procedures are designed so that a feedforward augmented output follows the reference model output, thus, resulting in an ultimately bounded rather than zero output error. Thus, modifications are suggested and tested that: (1) incorporate feedforward into the reference model's output as well as the plant's output, and (2) incorporate a derivative term into only the process feedforward loop. The results of these simulations give a response with zero steady state model following error, and thus encourage further use of MRAC for more complex flexibile robotic systems.

Steinvorth, Rodrigo↗

Analysis of spinning in a monoplane wing by the induction method as compared with the strip method

The problem of autorotation has been attacked by various authors, in particular Fuchs and Schmidt who applied the so-called strip method which is based upon the assumption that the forces and moments per unit length acting in each section of the wing are equal to those on an infinite cylindrical wing of equal section in an air flow of intensity and direction resulting from the apparent relative motion of this section with respect to the surrounding air. In other words they disregarded the induced velocities, which, however, are of such importance that their omission is bound to result in appreciable errors, as we attempt to prove in this report.

Poggi, L↗

Development of An Intelligent Flight Propulsion Control System

The initial design and demonstration of an Intelligent Flight Propulsion and Control System (IFPCS) is documented. The design is based on the implementation of a nonlinear adaptive flight control architecture. This initial design of the IFPCS enhances flight safety by using propulsion sources to provide redundancy in flight control. The IFPCS enhances the conventional gain scheduled approach in significant ways: (1) The IFPCS provides a back up flight control system that results in consistent responses over a wide range of unanticipated failures. (2) The IFPCS is applicable to a variety of aircraft models without redesign and,(3) significantly reduces the laborious research and design necessary in a gain scheduled approach. The control augmentation is detailed within an approximate Input-Output Linearization setting. The availability of propulsion only provides two control inputs, symmetric and differential thrust. Earlier Propulsion Control Augmentation (PCA) work performed by NASA provided for a trajectory controller with pilot command input of glidepath and heading. This work is aimed at demonstrating the flexibility of the IFPCS in providing consistency in flying qualities under a variety of failure scenarios. This report documents the initial design phase where propulsion only is used. Results confirm that the engine dynamics and associated hard nonlineaaities result in poor handling qualities at best. However, as demonstrated in simulation, the IFPCS is capable of results similar to the gain scheduled designs of the NASA PCA work. The IFPCS design uses crude estimates of aircraft behaviour. The adaptive control architecture demonstrates robust stability and provides robust performance. In this work, robust stability means that all states, errors, and adaptive parameters remain bounded under a wide class of uncertainties and input and output disturbances. Robust performance is measured in the quality of the tracking. The results demonstrate the flexibility of the IFPCS architecture and the ability to provide robust performance under a broad range of uncertainty. Robust stability is proved using Lyapunov like analysis. Future development of the IFPCS will include integration of conventional control surfaces with the use of propulsion augmentation, and utilization of available lift and drag devices, to demonstrate adaptive control capability under a greater variety of failure scenarios. Further work will specifically address the effects of actuator saturation.

Calise, A. J.↗

Stochastic Formal Correctness of Numerical Algorithms

We provide a framework to bound the probability that accumulated errors were never above a given threshold on numerical algorithms. Such algorithms are used for example in aircraft and nuclear power plants. This report contains simple formulas based on Levy's and Markov's inequalities and it presents a formal theory of random variables with a special focus on producing concrete results. We selected four very common applications that fit in our framework and cover the common practices of systems that evolve for a long time. We compute the number of bits that remain continuously significant in the first two applications with a probability of failure around one out of a billion, where worst case analysis considers that no significant bit remains. We are using PVS as such formal tools force explicit statement of all hypotheses and prevent incorrect uses of theorems.

Daumas, Marc↗