SEARCH · Engineering Papers
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.
A linear model of the space shuttle main engine for use in Pogo studies was presented. A digital program is included from which engine transfer functions are determined relative to the engine operating level.
A recursive algorithm was designed to invert large, dense, symmetric, positive definite matrices using small amounts of computer core, i.e., a small fraction of the core needed to store the complete matrix. The described algorithm is a generalized Gaussian elimination technique. Other algorithms are also discussed for the Cholesky decomposition and step inversion techniques. The purpose of the inversion algorithm is to solve large linear systems of normal equations generated by working geodetic problems. The algorithm was incorporated into a computer program called SOLVE. In the past the SOLVE program has been used in obtaining solutions published as the Goddard earth models.
A computer program developed for determining the subsonic pressure, force, and moment coefficients for a fuselage-type body using slender body theory is described. The program is suitable for determining the angle of attack and sideslipping characteristics of such bodies in the linear range where viscous effects are not predominant. Procedures developed which are capable of treating cross sections with corners or regions of large curvature are outlined.
Alternative computational procedures for obtaining a feedback control law which yields a control signal based on measurable quantitites are evaluated. The three methods evaluated are: (1) the standard linear quadratic regulator design model; (2) minimization of the norm of the feedback matrix, k via nonlinear programming subject to the constraint that the closed loop eigenvalues be in a specified domain in the complex plane; and (3) maximize the angles between the closed loop eigenvectors in combination with minimizing the norm of K also via the constrained nonlinear programming. The third or robust design method was chosen to yield a closed loop system whose eigenvalues are insensitive to small changes in the A and B matrices. The relationship between orthogonality of closed loop eigenvectors and the sensitivity of closed loop eigenvalues is described. Computer programs are described.
A decomposition of the adapted pattern generated by an adaptive array operating in an environment with one narrowband signal, K-1 narrowband jammers, and programmed to produce the maximum SNR is presented. The antenna voltage pattern is demonstrated to be a linear combination of K (or less) basis patterns, each from a sole source, and the kth basis pattern becomes the desired signal realized by the array. Isotropic array patterns result in retrodirective basis patterns, and the decomposition can be configured to obtain the retrodirective beams for all K.
MSFC has successfully employed the use of the Vibrational Control of Space Structures (VCOSS) Linear Momentum Exchange Devices (LMEDs), which was an outgrowth of the Air Force Wright Aeronautical Laboratory (AFWAL) program, in a distributed control experiment. The control experiment was conducted in MSFC's Ground Facility for Large Space Structures Control Verification (GF/LSSCV). The GF/LSSCV's test article was well suited for this experiment in that the LMED could be judiciously placed on the ASTROMAST. The LMED placements were such that vibrational mode information could be extracted from the accelerometers on the LMED. The LMED accelerometer information was processed by the control algorithms so that the LMED masses could be accelerated to produce forces which would dampen the vibrational modes of interest. Experimental results are presented showing the LMED's capabilities.
Blocked algorithms have much better properties of data locality and therefore can be much more efficient than ordinary algorithms when a memory hierarchy is involved. On the other hand, they are very difficult to write and to tune for particular machines. The reorganization is considered of nested loops through the use of known program transformations in order to create blocked algorithms automatically. The program transformations used are strip mining, loop interchange, and a variant of loop skewing in which invertible linear transformations (with integer coordinates) of the loop indices are allowed. Some problems are solved concerning the optimal application of these transformations. It is shown, in a very general setting, how to choose a nearly optimal set of transformed indices. It is then shown, in one particular but rather frequently occurring situation, how to choose an optimal set of block sizes.
Presented here are the main features of a tool package for manipulating and working with sparse matrices. One of the goals of the package is to provide basic tools to facilitate the exchange of software and data between researchers in sparse matrix computations. The starting point is the Harwell/Boeing collection of matrices for which the authors provide a number of tools. Among other things, the package provides programs for converting data structures, printing simple statistics on a matrix, plotting a matrix profile, and performing linear algebra operations with sparse matrices.
Developments in the area of nonlinear control theory have shown how coordinate changes in the state and input spaces of a dynamical system can be used to transform certain nonlinear differential equations into equivalent linear equations. These techniques are applied to the control of a spacecraft equipped with momentum exchange devices. An optimal control problem is formulated that incorporates a nonlinear spacecraft model. An algorithm is developed for solving the optimization problem using feedback linearization to transform to an equivalent problem involving a linear dynamical constraint and a functional approximation technique to solve for the linear dynamics in terms of the control. The original problem is transformed into an unconstrained nonlinear quadratic program that yields an approximate solution to the original problem. Two examples are presented to illustrate the results.
The purpose of this research is to further develop an understanding of how nonminimum phase zero location is affected by structural link design. As the demand for light-weight robots that can operate in a large workspace increases, the structural flexibility of the links become more of an issue in controls problems. When the objective is to accurately position the tip while the robot is actuated at the base, the system is nonminimum phase. One important characteristic of nonminimum phase systems is system zeros in the right half of the Laplace plane. The ability to pick the location of these nonminimum phase zeros would give the designer a new freedom similar to pole placement. The research targets a single-link manipulator operating in the horizontal plane and modeled as a Euler-Bernoulli beam with pinned-free end conditions. Using transfer matrix theory, one can consider link designs that have variable cross-sections along the length of the beam. A FORTRAN program was developed to determine the location of poles and zeros given the system model. The program was used to confirm previous research on nonminimum phase systems, and develop a relationship for designing linearly tapered links. The method allows the designer to choose the location of the first pole and zero and then defines the appropriate taper to match the desired locations. With the pole and zero location fixes, the designer can independently change the link's moment of inertia about its axis of rotation by adjusting the height of the beam. These results can be applied to inverse dynamic algorithms currently under development at Georgia Tech.
As the demand for light-weight robots that can operate in a large workspace increases, the structural flexibility of the links becomes more of an issue in control. When the objective is to accurately position the tip while the robot is actuated at the base, the system is nonminimum phase. One important characteristic of nonminimum phase systems is system zeros in the right half of the Laplace plane. The ability to pick the location of these nonminimum phase zeros would give the designer a new freedom similar to pole placement. This research targets a single-link manipulator operating in the horizontal plane and modeled as a Euler-Bernoulli beam with pinned-free end conditions. Using transfer matrix theory, one can consider link designs that have variable cross-sections along the length of the beam. A FORTRAN program was developed to determine the location of poles and zeros given the system model. The program was used to confirm previous research on nonminimum phase systems, and develop a relationship for designing linearly tapered links. The method allows the designer to choose the location of the first pole and zero and then defines the appropriate taper to match the desired locations. With the pole and zero location fixed, the designer can independently change the link's moment of inertia about its axis of rotation by adjusting the height of the beam. These results can be applied to the inverse dynamic algorithms that are currently under development.
A time-accurate approximate-factorization (AF) algorithm is described for solution of the three-dimensional unsteady transonic small-disturbance equation. The AF algorithm consists of a time-linearization procedure coupled with a subiteration technique. The algorithm is the basis for the Computational Aeroelasticity Program-Transonic Small Disturbance (CAP-TSD) computer code, which was developed for the analysis of unsteady aerodynamics and aeroelasticity of realistic aircraft configurations. The paper describes details on the governing flow equations and boundary conditions, with an emphasis on documenting the finite-difference formulas of the AF algorithm.
Linear and nonlinear springs have been used to model adhesives in bonded joints. This presentation describes two programs which obtain stresses and strains in bonded joints. For a given bonded joint model, these programs read the corresponding NASTRAN input and output files, use the spring forces or deformations to obtain the adhesive stresses or strain fields, sort the stresses and strains in descending order, and generate Mathematica plot files for three dimensional visualization of the stress and strain fields.
Bayesian Blocks are optimal piecewise linear representations (step function fits) of light-curves. The simple algorithm implementing this idea, using dynamic programming, has been extended to include more data modes and fitness metrics, multivariate analysis, and data on the circle (Studies in Astronomical Time Series Analysis. VI. Bayesian Block Representations, Scargle, Norris, Jackson and Chiang 2013, ApJ, 764, 167), as well as new results on background subtraction and refinement of the procedure for precise timing of transient events in sparse data. Example demonstrations will include exploratory analysis of the Kepler light curve archive in a search for "star-tickling" signals from extraterrestrial civilizations. (The Cepheid Galactic Internet, Learned, Kudritzki, Pakvasa1, and Zee, 2008, arXiv: 0809.0339; Walkowicz et al., in progress).
Capturing into an orbit around Uranus using aerocapture allows one to design a mission with faster interplanetary trajectories and less propellant requirements. Such an aerocapture mission would rely on the onboard Guidance, Navigation, and Control (GNC) subsystems to successfully capture into an orbit around Uranus. Uncertainty in the state information and the noise in the sensor measurements induce navigation errors in the guidance and control subsystems, which can affect the overall performance of the aerocapture mission at Uranus. Understanding the effect of these navigation errors on mission performance is essential. To this end, this work considers different sensors with varying quality to understand their impact on the overall mission performance. In addition, this paper studies the impact of the uncertainty in the initial states used to initialize the onboard navigation filter and understands their effect on mission performance. This paper also shows the onboard navigation errors obtained from the Linear Covariance (LinCov) analysis and uses them for verification and validation (V&V) of the results from Program to Optimize and Simulate Trajectories-II (POST2).
Capturing into an orbit around Uranus using aerocapture allows one to design a mission with faster interplanetary trajectories and less propellant requirements. Such an aerocapture mission would rely on the onboard Guidance, Navigation, and Control (GNC) subsystems to successfully capture into an orbit around Uranus. Uncertainty in the state information and the noise in the sensor measurements induce navigation errors in the guidance and control subsystems, which can affect the overall performance of the aerocapture mission at Uranus. Understanding the effect of these navigation errors on mission performance is essential. To this end, this work considers different sensors with varying quality to understand their impact on the overall mission performance. In addition, this paper studies the impact of the uncertainty in the initial states used to initialize the onboard navigation filter and understands their effect on mission performance. This paper also shows the onboard navigation errors obtained from the Linear Covariance (LinCov) analysis and uses them for verification and validation (V\&V) of the results from Program to Optimize and Simulate Trajectories-II (POST2).
The Grid Optimization Competition Challenge 3 Problem posed a multiperiod security-constrained unit commitment problem with base-case AC power flow. The problem formulation includes binary unit commitment decisions, nonlinear AC power flow and balance, dispatchable loads, and linearized contingency real power flow, among other features. This talk will present a modified consensus ADMM algorithm, which splits the problem into mixed-integer linear and nonlinear components, as a heuristic solution method for this large-scale mixed integer nonlinear program. We will present some computational results from the competition for our implementation and reflect on the challenges of participating the grid optimization competition.
In this study, a heuristic dynamic programming controller is proposed to control a boost converter. Conventional controllers such as proportional-integral-derivative (PID) or proportional-integral (PI) are designed based on the linearized small-signal model near the operating point. Therefore, the performance of the controller during the start-up, the load change, or the input voltage variation is not optimal since the system model changes by varying the operating point. The heuristic dynamic programming controller optimally controls the boost converter by following the approximate dynamic programming. The advantage of the HDP is that the neural network-based characteristic of the proposed controller enables boost converters to easily cope with large disturbances. An HDP with a well-trained critic and action networks can perform as an optimal controller for the boost converter. To compare the effectiveness of the traditional PI-based and the HDP boost converter, the simulation results are provided.