Engineering Papers⌕ Search

SEARCH · Engineering Papers

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 217 records · Page 12

A computer program to calculate zeroes, extrema, and interval integrals for the associated Legendre functions

A computer program is described for the calculation of the zeroes of the associated Legendre functions, Pnm, and their derivatives, for the calculation of the extrema of Pnm and also the integral between pairs of successive zeroes. The program has been run for all n,m from (0,0) to (20,20) and selected cases beyond that for n up to 40. Up to (20,20), the program (written in double precision) retains nearly full accuracy, and indications are that up to (40,40) there is still sufficient precision (4-5 decimal digits for a 54-bit mantissa) for estimation of various bounds and errors involved in geopotential modelling, the purpose for which the program was written.

Payne, M. H.↗

A study to determine the usefulness of interval analysis in solving problems in celestial mechanics

This investigation was undertaken to determine the usefulness of interval analysis to numerical integration and matrix inversion techniques and to combine these results to determine the value of interval analysis in bounding computational errors in the two-body problem. Conclusions were that interval analysis may be worthwhile in certain small scale isolated problems, but its usefulness in any large scale problem is doubtful.

Walling, D.↗

Coding for optical channels with photon-counting

The problem of coding for Pierce's recent model for optical communications is studied. It was concluded that for any positive rate rho (measured in nats per photon), the best code of length n has an error probability bounded by an exponentially decaying function of n. Explicit practical schemes are shown for rho less than or = to 1; and evidence is given that rho approximating 1 may be the practical limit for optical communication.

Mceliece, R. J.↗

Trellis phase codes for power-bandwith efficient satellite communications

Support work on improved power and spectrum utilization on digital satellite channels was performed. Specific attention is given to the class of signalling schemes known as continuous phase modulation (CPM). The specific work described in this report addresses: analytical bounds on error probability for multi-h phase codes, power and bandwidth characterization of 4-ary multi-h codes, and initial results of channel simulation to assess the impact of band limiting filters and nonlinear amplifiers on CPM performance.

Wilson, S. G.↗

Convex Interpolating Splines of Arbitrary Degree

Shape preserving approximations are constructed by interpolating the data with polynomial splines of arbitrary degree. A regularity condition is formulated on the data which insures the existence of such a shape preserving spline, an algorithm is presented for its construction, and the uniform norm of the error is bound which results when the algorithm is used to produce an approximation to a given f epsilon Ca,b.

Neuman, E.↗

Stability regions for multiloop LQ-regulated systems with state estimators

This note investigates the closed-loop stability of linear, time-invariant systems controlled by linear-quadratic-Gaussian (LQG) type controllers, when the actuators have nonlinearities. The nonlinearities N(sigma) are assumed to violate the standard LQ robustness condition either for values of sigma away from sigma = 0, or in a neighborhood of sigma = 0. The cases with an exponentially stable state estimator, and an estimator with ultimately bounded estimation error are considered, and expressions are obtained for the regions of attraction and ultimate boundedness.

Joshi, S. M.↗

Simple robust control laws for robot manipulators. Part 1: Non-adaptive case

A new class of exponentially stabilizing control laws for joint level control of robot arms is introduced. It has been recently recognized that the nonlinear dynamics associated with robotic manipulators have certain inherent passivity properties. More specifically, the derivation of the robotic dynamic equations from the Hamilton's principle gives rise to natural Lyapunov functions for control design based on total energy considerations. Through a slight modification of the energy Lyapunov function and the use of a convenient lemma to handle third order terms in the Lyapunov function derivatives, closed loop exponential stability for both the set point and tracking control problem is demonstrated. The exponential convergence property also leads to robustness with respect to frictions, bounded modeling errors and instrument noise. In one new design, the nonlinear terms are decoupled from real-time measurements which completely removes the requirement for on-line computation of nonlinear terms in the controller implementation. In general, the new class of control laws offers alternatives to the more conventional computed torque method, providing tradeoffs between robustness, computation and convergence properties. Furthermore, these control laws have the unique feature that they can be adapted in a very simple fashion to achieve asymptotically stable adaptive control.

Wen, J. T.↗

Application of the operator spline technique to nonlinear estimation and control of moving elastic systems

A bilinear model of the vibrational dynamics of a deformable maneuvering body is described. Estimates of the deformation state are generated through a low dimensional operator spline interpolator of bilinear systems combined with a feedback linearized based observer. Upper bounds on error estimates are also generated through the operator spline, and potential application to shaping control purposes is highlighted.

Karray, Fakhreddine↗

Time domain convergence properties of Lyapunov stable penalty methods

Linear hyperbolic partial differential equations are analyzed using standard techniques to show that a sequence of solutions generated by the Liapunov stable penalty equations approaches the solution of the differential-algebraic equations governing the dynamics of multibody problems arising in linear vibrations. The analysis does not require that the system be conservative and does not impose any specific integration scheme. Variational statements are derived which bound the error in approximation by the norm of the constraint violation obtained in the approximate solutions.

Kurdila, A. J.↗

On the capacity of ternary Hebbian networks

Networks of ternary neurons storing random vectors over the set -1,0,1 by the so-called Hebbian rule are considered. It is shown that the maximal number of stored patterns that are equilibrium states of the network with probability tending to one as N tends to infinity is at least on the order of (N exp 2-1/alpha)/K, where N is the number of neurons, K is the number of nonzero elements in a pattern, and t = alpha x K, alpha between 1/2 and 1, is the threshold in the neuron function. While, for small K, this bound is similar to that obtained for fully connected binary networks, the number of interneural connections required in the ternary case is considerably smaller. Similar bounds, incorporating error probabilities, are shown to guarantee, in the same probabilistic sense, the correction of errors in the nonzero elements and in the location of these elements.

Baram, Yoram↗

Robustness of reduced-order multivariable state-space self-tuning controller

In this paper, we present a quantitative analysis of the robustness of a reduced-order pole-assignment state-space self-tuning controller for a multivariable adaptive control system whose order of the real process is higher than that of the model used in the controller design. The result of stability analysis shows that, under a specific bounded modelling error, the adaptively controlled closed-loop real system via the reduced-order state-space self-tuner is BIBO stable in the presence of unmodelled dynamics.

Yuan, Zhuzhi↗

Robot Position Sensor Fault Tolerance

Robot systems in critical applications, such as those in space and nuclear environments, must be able to operate during component failure to complete important tasks. One failure mode that has received little attention is the failure of joint position sensors. Current fault tolerant designs require the addition of directly redundant position sensors which can affect joint design. A new method is proposed that utilizes analytical redundancy to allow for continued operation during joint position sensor failure. Joint torque sensors are used with a virtual passive torque controller to make the robot joint stable without position feedback and improve position tracking performance in the presence of unknown link dynamics and end-effector loading. Two Cartesian accelerometer based methods are proposed to determine the position of the joint. The joint specific position determination method utilizes two triaxial accelerometers attached to the link driven by the joint with the failed position sensor. The joint specific method is not computationally complex and the position error is bounded. The system wide position determination method utilizes accelerometers distributed on different robot links and the end-effector to determine the position of sets of multiple joints. The system wide method requires fewer accelerometers than the joint specific method to make all joint position sensors fault tolerant but is more computationally complex and has lower convergence properties. Experiments were conducted on a laboratory manipulator. Both position determination methods were shown to track the actual position satisfactorily. A controller using the position determination methods and the virtual passive torque controller was able to servo the joints to a desired position during position sensor failure.

Aldridge, Hal A.↗

A Note About HARP's State Trimming Method

This short note provides some additional insight into how the HARP program works. In some cases, it is possible for HARP to tdm away too many states and obtain an optimistic result. The HARP Version 7.0 manual warns the user that 'Unlike the ALL model, the SAME model can automatically drop failure modes for certain system models. The user is cautioned to insure that no important failure modes are dropped; otherwise, a non-conservative result can be given.' This note provides an example of where this occurs and a pointer to further documentation that gives a means of bounding the error associated with trimming these states.

Butler, Ricky W.↗

Some Decomposable Codes: The |a + x|b + x|a + b + x| Construction

Codes with decomposable structure allow the use of multistage decoding procedures to achieve suboptimum bounded-distance error performance with reduced decoding complexity. This correspondence presents some new decomposable codes, including a class of distance-8 codes, that are constructed based on the|a + x|b + x|a + b + x| construction method. Some existing best codes are shown to be decomposable and hence can be decoded with multistage decoding.

Fossorier, Marc P. C.↗

A Unified Fault-Tolerance Protocol

Davies and Wakerly show that Byzantine fault tolerance can be achieved by a cascade of broadcasts and middle value select functions. We present an extension of the Davies and Wakerly protocol, the unified protocol, and its proof of correctness. We prove that it satisfies validity and agreement properties for communication of exact values. We then introduce bounded communication error into the model. Inexact communication is inherent for clock synchronization protocols. We prove that validity and agreement properties hold for inexact communication, and that exact communication is a special case. As a running example, we illustrate the unified protocol using the SPIDER family of fault-tolerant architectures. In particular we demonstrate that the SPIDER interactive consistency, distributed diagnosis, and clock synchronization protocols are instances of the unified protocol.

Miner, Paul↗

Intelligent, Self-Diagnostic Thermal Protection System for Future Spacecraft

The goal of this project is to provide self-diagnostic capabilities to the thermal protection systems (TPS) of future spacecraft. Self-diagnosis is especially important in thermal protection systems (TPS), where large numbers of parts must survive extreme conditions after weeks or years in space. In-service inspections of these systems are difficult or impossible, yet their reliability must be ensured before atmospheric entry. In fact, TPS represents the greatest risk factor after propulsion for any transatmospheric mission. The concepts and much of the technology would be applicable not only to the Crew Exploration Vehicle (CEV), but also to ablative thermal protection for aerocapture and planetary exploration. Monitoring a thermal protection system on a Shuttle-sized vehicle is a daunting task: there are more than 26,000 components whose integrity must be verified with very low rates of both missed faults and false positives. The large number of monitored components precludes conventional approaches based on centralized data collection over separate wires; a distributed approach is necessary to limit the power, mass, and volume of the health monitoring system. Distributed intelligence with self-diagnosis further improves capability, scalability, robustness, and reliability of the monitoring subsystem. A distributed system of intelligent sensors can provide an assurance of the integrity of the system, diagnosis of faults, and condition-based maintenance, all with provable bounds on errors.

Hyers, Robert W.↗