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 235 records · Page 13
All sourcesNASA NTRSDOE OSTI
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↗
NASA NTRS2004

Bounding the Resource Availability of Partially Ordered Events with Constant Resource Impact

We compare existing techniques to bound the resource availability of partially ordered events. We first show that, contrary to intuition, two existing techniques, one due to Laborie and one due to Muscettola, are not strictly comparable in terms of the size of the search trees generated under chronological search with a fixed heuristic. We describe a generalization of these techniques called the Flow Balance Constraint to tightly bound the amount of available resource for a set of partially ordered events with piecewise constant resource impact We prove that the new technique generates smaller proof trees under chronological search with a fixed heuristic, at little increase in computational expense. We then show how to construct tighter resource bounds but at increased computational cost.

Frank, Jeremy↗
NASA NTRS2004

Finding Bounded Rational Equilibria: Iterative Focusing - Part 1

A long-running difficulty with conventional game theory has been how to modify it to accommodate the bounded rationality characterizing all real-world players. A recurring issue in statistical physics is how best to approximate joint probability distributions with decoupled (and therefore far more tractable) distributions. It has recently been shown that the same information theoretic mathematical structure, known as Probability Collectives (PC) underlies both issues. This relationship between statistical physics and game theory allows techniques and insights from the one field to be applied to the other. In particular, PC provides a formal model-independent definition of the degree of rationality of a player and of bounded rationality equilibria. This pair of papers extends previous work on PC by introducing new computational approaches to effectively find bounded rationality equilibria of common-interest (team) games.

Wolpert, David H.↗
NASA NTRS2004

Finding Bounded Rational Equilibria: Alternative Lagrangians and Uncountable Move Spaces - Part 2

A long-running difficulty with conventional game theory has been how to modify it to accommodate the bounded rationality characterizing all real-world players. A recurring issue in statistical physics is how best to approximate joint probability distributions with decoupled (and therefore far more tractable) distributions. It has recently been shown that the same information theoretic mathematical structure, known as Probability Collectives (PC) underlies both issues. This relationship between statistical physics and game theory allows techniques and insights &om the one field to be applied to the other. In particular, PC provides a formal model-independent definition of the degree of rationality of a player and of bounded rationality equilibria. This pair of papers extends previous work on PC by introducing new computational approaches to effectively find bounded rationality equilibria of common-interest (team) games.

Wolpert, David H.↗
NASA NTRS2005

Pickup Ion Mass Spectrometry for Surface Bounded Exospheres and Composition Mapping of Lunar and Planetary Surfaces

Many of the small to medium sized objects in the solar system can be characterized as having surface bounded exospheres, or atmospheres so tenuous that scale lengths for inter-particle collisions are much larger than the dimensions of the objects. The atmospheres of these objects are the product of their surfaces, both the surface composition and the interactions that occur on them and also their interiors when gases escape from there. Thus by studying surface bounded exospheres it is possible to develop insight into the composition and processes that are taking place on the surface and interiors of these objects. The Moon and Mercury are two examples of planetary bodies with surface bounded exospheres that have been studied through spectroscopic observations of sodium, potassium, and, on the moon, mass spectrometric measurements of lunar gases such as argon and helium.

Keller, J. W.↗
NASA NTRS1998

Control of Rate-Bounded Hybrid Systems with Liveness Specifications

In the present paper we examine the control problem for a class of composite hybrid machines (CHMs) that consist of concurrent operation (employing synchronous composition) of elementary hybrid machines (EHMs), that allows both signal sharing and event synchronization. A controller can then be coupled with the plant by means of synchronous composition. We confine our attention to controllers that interact with the system only through event synchronization. We present an initial investigation of synthesis of liveness controllers for hybrid machines. To this end we define open hybrid machines as systems that can interact with the environment through event synchronization and can be therefor be "driven" to their marked configuration by user (controller). Liveness specifications must be associated with timing constraints. We may require that for a specified time limit, every run reach a marked configuration within that time limit. Alternatively, a more relaxed specification may be that, for some (unspecified) global time bound, every run of the system reach a marked configuration within that time bound. Finally, the least restrictive liveness requirement is that every run reach a marked configuration within a finite time limit (but we do not insist on the existence of a global time bound for all runs).

Heymann, Michael↗
NASA NTRS2004

College Bound with the Office of Educational Programs

The Educational Programs Office at NASA Glenn Research Center hosts a variety of programs that takes on the hard task of getting students of all ages interested in pursuing careers in science, mathematics, and engineering. To help assist students along the way there are many programs to participate in such as: the explorers, shadowing opportunities, and paid internships. The Educational Programs Office not only creates learning opportunities for students, they also host workshops to help educators enhance their knowledge these fields. This summer I assisted Marie Borowski in the Educational Programs Office with the Tennessee State University College Bound Program. The Tennessee state University College Bound Program is an intensive two-week summer academic workshop designed to introduce minority students to the profession of engineering. NASA Glenn Research Center sent forty dedicated students on a bus to Nashville, Tennessee to experience college life as a whole. At the college the students day consisted of a math class, aeronautics, ACT/SAT preparation, writing and research, African American Culture, computer science, and study sessions. The students also went on educational field trips to the Fisk Museum, the Space and Rocket Center, and the Parthenon Museum. On the last day of the program the students competed in an oratorical contest where the students made a Powerpoint presentation on the class that they enjoyed the most. There were many processes that had to be put into action for the college bound program to run smoothly. The process started in early January with the preparation of applications. Once prepared, the applications were then sent to schools and past participants in hopes of receiving a well-qualified pool of applicants. Once the applications were received, a prescreening is done which ensures all of the information is complete. Then, they are reviewed by a panel, using a rubric to evaluate them, and the semifinalists are then selected. Interviews are held with the students and their parents had to be interviewed by a panel of judges and graded on a rubric. The scores were added up and the forty students were selected. My job this summer was getting the students ready to leave for Tennessee. My job consisted of working very closely with my mentor, Marie Borowski, compile the student data to provide it to the chaperones, TSU records, and NASA records. I learned about the vital communication between the NASA and the TSU program managers. After all the planning was done and the program had begun I had a chance to fly to Tennessee for six days to observe the students daily activities. The students had adjusted very well to the intense schedule, and seemed very enthusiastic about the activities to follow. The whole group was very attentive and enthusiastic program be longer. My goals for the summer were all met. I wanted to learn and retain all the information I possibly could on the job I was given. I was very happy with the end result.

Neal, Brittany D.↗
NASA NTRS2007

Robust Design Optimization via Failure Domain Bounding

This paper extends and applies the strategies recently developed by the authors for handling constraints under uncertainty to robust design optimization. For the scope of this paper, robust optimization is a methodology aimed at problems for which some parameters are uncertain and are only known to belong to some uncertainty set. This set can be described by either a deterministic or a probabilistic model. In the methodology developed herein, optimization-based strategies are used to bound the constraint violation region using hyper-spheres and hyper-rectangles. By comparing the resulting bounding sets with any given uncertainty model, it can be determined whether the constraints are satisfied for all members of the uncertainty model (i.e., constraints are feasible) or not (i.e., constraints are infeasible). If constraints are infeasible and a probabilistic uncertainty model is available, upper bounds to the probability of constraint violation can be efficiently calculated. The tools developed enable approximating not only the set of designs that make the constraints feasible but also, when required, the set of designs for which the probability of constraint violation is below a prescribed admissible value. When constraint feasibility is possible, several design criteria can be used to shape the uncertainty model of performance metrics of interest. Worst-case, least-second-moment, and reliability-based design criteria are considered herein. Since the problem formulation is generic and the tools derived only require standard optimization algorithms for their implementation, these strategies are easily applicable to a broad range of engineering problems.

Crespo, Luis G.↗
NASA NTRS2007

Bounds on Flexural Properties and Buckling Response for Symmetrically Laminated Plates

Nondimensional parameters and equations governing the buckling behavior of rectangular symmetrically laminated plates are presented that can be used to represent the buckling resistance, for plates made of all known structural materials, in a very general, insightful, and encompassing manner. In addition, these parameters can be used to assess the degree of plate orthotropy, to assess the importance of anisotropy that couples bending and twisting deformations, and to characterize quasi-isotropic laminates quantitatively. Bounds for these nondimensional parameters are also presented that are based on thermodynamics and practical laminate construction considerations. These bounds provides insight into potential gains in buckling resistance through laminate tailoring and composite-material development. As an illustration of this point, upper bounds on the buckling resistance of long rectangular orthotropic plates with simply supported or clamped edges and subjected to uniform axial compression, uniform shear, or pure inplane bending loads are presented. The results indicate that the maximum gain in buckling resistance for tailored orthotropic laminates, with respect to the corresponding isotropic plate, is in the range of 26-36% for plates with simply supported edges, irrespective of the loading conditions. For the plates with clamped edges, the corresponding gains in buckling resistance are in the range of 9-12% for plates subjected to compression or pure inplane bending loads and potentially up to 30% for plates subjected to shear loads.

Weaver, Paul M.↗
NASA NTRS2009

Bounded-Angle Iterative Decoding of LDPC Codes

Bounded-angle iterative decoding is a modified version of conventional iterative decoding, conceived as a means of reducing undetected-error rates for short low-density parity-check (LDPC) codes. For a given code, bounded-angle iterative decoding can be implemented by means of a simple modification of the decoder algorithm, without redesigning the code. Bounded-angle iterative decoding is based on a representation of received words and code words as vectors in an n-dimensional Euclidean space (where n is an integer).

Dolinar, Samuel↗
NASA NTRS2009

Application of Bounded Linear Stability Analysis Method for Metrics-Driven Adaptive Control

This paper presents the application of Bounded Linear Stability Analysis (BLSA) method for metrics-driven adaptive control. The bounded linear stability analysis method is used for analyzing stability of adaptive control models, without linearizing the adaptive laws. Metrics-driven adaptive control introduces a notion that adaptation should be driven by some stability metrics to achieve robustness. By the application of bounded linear stability analysis method the adaptive gain is adjusted during the adaptation in order to meet certain phase margin requirements. Analysis of metrics-driven adaptive control is evaluated for a second order system that represents a pitch attitude control of a generic transport aircraft. The analysis shows that the system with the metrics-conforming variable adaptive gain becomes more robust to unmodeled dynamics or time delay. The effect of analysis time-window for BLSA is also evaluated in order to meet the stability margin criteria.

Bakhtiari-Nejad, Maryam↗
NASA NTRS2010

Comparison of Methods to Predict Lower Bound Buckling Loads of Cylinders Under Axial Compression

Results from a numerical study of the buckling response of two different orthogrid stiffened circular cylindrical shells with initial imperfections and subjected to axial compression are used to compare three different lower bound buckling load prediction techniques. These lower bound prediction techniques assume different imperfection types and include an imperfection based on a mode shape from an eigenvalue analysis, an imperfection caused by a lateral perturbation load, and an imperfection in the shape of a single stress-free dimple. The STAGS finite element code is used for the analyses. Responses of the cylinders for ranges of imperfection amplitudes are considered, and the effect of each imperfection is compared to the response of a geometrically perfect cylinder. Similar behavior was observed for shells that include a lateral perturbation load and a single dimple imperfection, and the results indicate that the predicted lower bounds are much less conservative than the corresponding results for the cylinders with the mode shape imperfection considered herein. In addition, the lateral perturbation technique and the single dimple imperfection produce response characteristics that are physically meaningful and can be validated via testing.

Haynie, Waddy T.↗
NASA NTRS2009

Adjustment of Adaptive Gain with Bounded Linear Stability Analysis to Improve Time-Delay Margin for Metrics-Driven Adaptive Control

This paper presents the application of Bounded Linear Stability Analysis (BLSA) method for metrics driven adaptive control. The bounded linear stability analysis method is used for analyzing stability of adaptive control models, without linearizing the adaptive laws. Metrics-driven adaptive control introduces a notion that adaptation should be driven by some stability metrics to achieve robustness. By the application of bounded linear stability analysis method the adaptive gain is adjusted during the adaptation in order to meet certain phase margin requirements. Analysis of metrics-driven adaptive control is evaluated for a linear damaged twin-engine generic transport model of aircraft. The analysis shows that the system with the adjusted adaptive gain becomes more robust to unmodeled dynamics or time delay.

Bakhtiari-Nejad, Maryam↗