Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “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 91 records · Page 5
All sourcesNASA NTRSDOE OSTI
NASA NTRS1985

Bounds and approximations for rapid evaluation of coherent MPSK error probabilities

The error probability for MPSK detection is expressed here as a sum of a familiar upper-bound approximation and a correction term which is well suited for numerical integration. An asymptotic expansion of the correction term is derived, from which simple and extremely tight upper and lower bounds are obtained. Relative errors in using these bounds and approximations of them are graphed for cases of practical interest.

Chie, C. M.↗
NASA NTRS1987

Mean-square error bounds for reduced-error linear state estimators

The mean-square error of reduced-order linear state estimators for continuous-time linear systems is investigated. Lower and upper bounds on the minimal mean-square error are presented. The bounds are readily computable at each time-point and at steady state from the solutions to the Ricatti and the Lyapunov equations. The usefulness of the error bounds for the analysis and design of reduced-order estimators is illustrated by a practical numerical example.

Baram, Y.↗
NASA NTRS1986

Reduced conservatism in stability robustness bounds by state transformation

This note addresses the issue of 'conservatism' in the time domain stability robustness bounds obtained by the Liapunov approach. A state transformation is employed to improve the upper bounds on the linear time-varying perturbation of an asymptotically stable linear time-invariant system for robust stability. This improvement is due to the variance of the conservatism of the Liapunov approach with respect to the basis of the vector space in which the Liapunov function is constructed. Improved bounds are obtained, using a transformation, on elemental and vector norms of perturbations (i.e., structured perturbations) as well as on a matrix norm of perturbations (i.e., unstructured perturbations). For the case of a diagonal transformation, an algorithm is proposed to find the 'optimal' transformation. Several examples are presented to illustrate the proposed analysis.

Yedavalli, R. K.↗
NASA NTRS1986

A comparison of the bounded derivative and the normal-mode initialization methods using real data

Application of the bounded-derivative and normal-mode methods to a simple linear barotropic model at a typical middle latitude shows that the two methods lead to identical constraints up to a certain degree of approximation. Beyond this accuracy the two methods may differ from each other. When applied to a global nonlinear barotropic model using real data, again the two methods lead to similar balanced initial states. The gravity oscillations in the unbalanced height field, which have amplitudes of up to 60 m with a dominant periodicity of about 5 to 6 h, are practically eliminated by both initialization methods. The rotational wind component is smooth even for the unbalanced initial state. The small-scale spatial features of the irrotational wind component are drastically reduced by initialization. Both the nonlinear normal-mode and the bounded-derivative initialization methods yield similar divergence fields centered around the areas of highest orography. The comparison shows that there is no significant loss of information in the mass and momentum fields, despite the fact that the bounded-derivative method employs only the original, rotational wind component to construct a balanced initial state compared to the normal-mode method, which, in addition, makes use of the unbalanced divergent wind and height fields.

Semazzi, F. H. M.↗
NASA NTRS1987

An error bound for a discrete reduced order model of a linear multivariable system

The design of feasible controllers for high dimension multivariable systems can be greatly aided by a method of model reduction. In order for the design based on the order reduction to include a guarantee of stability, it is sufficient to have a bound on the model error. Previous work has provided such a bound for continuous-time systems for algorithms based on balancing. In this note an L-infinity bound is derived for model error for a method of order reduction of discrete linear multivariable systems based on balancing.

Al-Saggaf, Ubaid M.↗
NASA NTRS1988

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.↗
NASA NTRS1987

Inflectional instabilities in the wall region of bounded turbulent shear flows

The primary thrust of this research was to identify one or more mechanisms responsible for strong turbulence production events in the wall region of bounded turbulent shear flows. Based upon previous work in a transitional boundary layer, it seemed highly probable that the production events were preceded by an inflectional velocity profile which formed on the interface between the low-speed streak and the surrounding fluid. In bounded transitional flows, this unstable profile developed velocity fluctuations in the streamwise direction and in the direction perpendicular to the sheared surface. The rapid growth of these instabilities leads to a breakdown and production of turbulence. Since bounded turbulent flows have many of the same characteristics, they may also experience a similar type of breakdown and turbulence production mechanism.

Swearingen, Jerry D.↗
NASA NTRS1988

Search for bound states of the eta-meson in light nuclei

A search for nuclear-bound states of the eta meson was carried out. Targets of lithium, carbon, oxygen, and aluminum were placed in a pion(+) beam at 800 MeV/c. A predicted eta bound state in O-15* (E sub x approx. = 540 MeV) with a width of approx. 9 MeV was not observed. A bound state of a size 1/3 of the predicted cross section would have been seen in this experiment at a confidence level of 3sigma (P is greater than 0.9987).

Chrien, R. E.↗
NASA NTRS1987

Mean-square-error bounds for reduced-order linear state estimators

The mean-square error of reduced-order linear state estimators for continuous-time linear systems is investigated. Lower and upper bounds on the minimal mean-square error are presented. The bounds are readily computable at each time-point and at steady state from the solutions to the Ricatti and the Liapunov equations. The usefulness of the error bounds for the analysis and design of reduced-order estimators is illustrated by a practical numerical example.

Baram, Y.↗
NASA NTRS1989

Bounds on dark matter in solar orbit

The possibility is considered that a spherical distribution of dark matter (DM), matter not visible with current instruments, is trapped in the sun's gravitational field. Bounds are placed from the motion of Uranus and Neptune, on the amount of DM that could be so trapped within the radius of those planets' orbits, as follows: from the Voyager 2, Uranus-flyby data new, more accurate ephemeris values are generated. Trapped DM mass is bounded by noting that such a distribution would increase the effective mass of the sun as seen by the outer planets and by using the new ephemeris values to bound such an increase.

Anderson, John D.↗
NASA NTRS1990

Performance bounds on parallel self-initiating discrete-event

The use is considered of massively parallel architectures to execute discrete-event simulations of what is termed self-initiating models. A logical process in a self-initiating model schedules its own state re-evaluation times, independently of any other logical process, and sends its new state to other logical processes following the re-evaluation. The interest is in the effects of that communication on synchronization. The performance is considered of various synchronization protocols by deriving upper and lower bounds on optimal performance, upper bounds on Time Warp's performance, and lower bounds on the performance of a new conservative protocol. The analysis of Time Warp includes the overhead costs of state-saving and rollback. The analysis points out sufficient conditions for the conservative protocol to outperform Time Warp. The analysis also quantifies the sensitivity of performance to message fan-out, lookahead ability, and the probability distributions underlying the simulation.

Nicol, David M.↗
NASA NTRS1990

General upper bound on single-event upset rate

A technique of predicting an upper bound on the rate at which single-event upsets due to ionizing radiation occur in semiconducting memory cells is described. The upper bound on the upset rate, which depends on the high-energy particle environment in earth orbit and accelerator cross-section data, is given by the product of an upper-bound linear energy-transfer spectrum and the mean cross section of the memory cell. Plots of the spectrum are given for low-inclination and polar orbits. An alternative expression for the exact upset rate is also presented. Both methods rely only on experimentally obtained cross-section data and are valid for sensitive bit regions having arbitrary shape.

Chlouber, Dean↗
NASA NTRS1993

Flight control application of new stability robustness bounds for linear uncertain systems

This paper addresses the issue of obtaining bounds on the real parameter perturbations of a linear state-space model for robust stability. Based on Kronecker algebra, new, easily computable sufficient bounds are derived that are much less conservative than the existing bounds since the technique is meant for only real parameter perturbations (in contrast to specializing complex variation case to real parameter case). The proposed theory is illustrated with application to several flight control examples.

Yedavalli, Rama K.↗
NASA NTRS1994

The wave function and minimum uncertainty function of the bound quadratic Hamiltonian system

The bound quadratic Hamiltonian system is analyzed explicitly on the basis of quantum mechanics. We have derived the invariant quantity with an auxiliary equation as the classical equation of motion. With the use of this invariant it can be determined whether or not the system is bound. In bound system we have evaluated the exact eigenfunction and minimum uncertainty function through unitary transformation.

Yeon, Kyu Hwang↗
NASA NTRS1995

An aspect ration bound for triangulating a d-grid cut by a hyperplane

We consider the problem of triangulating a d-dimensional uniform grid of d-cubes that is cut by a k-dimensional affine subspace. The goal is to obtain a triangulation with bounded aspect ratio. To achieve this goal, we allow some of the box faces near the affine subspace to be displaced. This problem has applications to finite element mesh generation. For general d and k, the bound on aspect ratio that we attain is double-exponential in d. For the important special case of d = 3, the aspect ratio bound is small enough that the technique is useful in practice.

Mitchell, Scott A.↗
NASA NTRS1996

Pattern Search Algorithms for Bound Constrained Minimization

We present a convergence theory for pattern search methods for solving bound constrained nonlinear programs. The analysis relies on the abstract structure of pattern search methods and an understanding of how the pattern interacts with the bound constraints. This analysis makes it possible to develop pattern search methods for bound constrained problems while only slightly restricting the flexibility present in pattern search methods for unconstrained problems. We prove global convergence despite the fact that pattern search methods do not have explicit information concerning the gradient and its projection onto the feasible region and consequently are unable to enforce explicitly a notion of sufficient feasible decrease.

Lewis, Robert Michael↗
NASA NTRS1997

Graph Embedding Techniques for Bounding Condition Numbers of Incomplete Factor Preconditioning

We extend graph embedding techniques for bounding the spectral condition number of preconditioned systems involving symmetric, irreducibly diagonally dominant M-matrices to systems where the preconditioner is not diagonally dominant. In particular, this allows us to bound the spectral condition number when the preconditioner is based on an incomplete factorization. We provide a review of previous techniques, describe our extension, and give examples both of a bound for a model problem, and of ways in which our techniques give intuitive way of looking at incomplete factor preconditioners.

Guattery, Stephen↗
NASA NTRS1998

A Globally Convergent Augmented Lagrangian Pattern Search Algorithm for Optimization with General Constraints and Simple Bounds

We give a pattern search adaptation of an augmented Lagrangian method due to Conn, Gould, and Toint. The algorithm proceeds by successive bound constrained minimization of an augmented Lagrangian. In the pattern search adaptation we solve this subproblem approximately using a bound constrained pattern search method. The stopping criterion proposed by Conn, Gould, and Toint for the solution of this subproblem requires explicit knowledge of derivatives. Such information is presumed absent in pattern search methods; however, we show how we can replace this with a stopping criterion based on the pattern size in a way that preserves the convergence properties of the original algorithm. In this way we proceed by successive, inexact, bound constrained minimization without knowing exactly how inexact the minimization is. So far as we know, this is the first provably convergent direct search method for general nonlinear programming.

Lewis, Robert Michael↗