Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “linear programming problem”

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 523 records · Page 29
All sourcesNASA NTRSDOE OSTI
NASA NTRS1988

Probabilistic system identification in the time domain

The objective of system identification is to determine reliable dynamical models of a structure by systematically using its measured excitation and response. It brings together in an integrated fashion, experimental, analytical, and computational techniques in structural dynamics. Areas of application for system identification include the following: (1) Model Evaluation--assessing assumptions (linearity and equivalent viscous damping) and techniques (finite-element modeling) used to construct theoretical models of a structure; (2) Model Improvement--updating of a theoretical model to enable more accurate response predictions for possible future loads on the structure, or for control of the structure; (3) Empirical Modelling--developing empirical relationships (nonlinear models) or empirical parameter values (modal damping) because the present state of the art does not provide theoretical results; and (4) Damage Detection and Assessment--continual or episodic updating of a structural model through vibration monitoring to detect and locate any structural damage. It can be argued that since the construction or modification of models using test data is subject to inherent uncertainties, the above problems should be properly treated within a Bayesian probabilistic framework. Such a methodology is presented which allows the precision of the estimates of the model parameters to be computed. It also leads to a guiding principle in applications. Namely, when selecting a single model from a given class of models, one should take the most probable model in the class based on the experimental data. Practical applications of this principle are given which are based on the utilization of measured seismic motions in large civil structures. Examples include the application of a computer program MODE-ID to identify modal properties directly from seismic excitation and response time histories from a nine-story steel-frame building at JPL and from a freeway overpass bridge.

Beck, James L.↗
NASA NTRS1996

Multiresolution and Explicit Methods for Vector Field Analysis and Visualization

We first report on our current progress in the area of explicit methods for tangent curve computation. The basic idea of this method is to decompose the domain into a collection of triangles (or tetrahedra) and assume linear variation of the vector field over each cell. With this assumption, the equations which define a tangent curve become a system of linear, constant coefficient ODE's which can be solved explicitly. There are five different representation of the solution depending on the eigenvalues of the Jacobian. The analysis of these five cases is somewhat similar to the phase plane analysis often associate with critical point classification within the context of topological methods, but it is not exactly the same. There are some critical differences. Moving from one cell to the next as a tangent curve is tracked, requires the computation of the exit point which is an intersection of the solution of the constant coefficient ODE and the edge of a triangle. There are two possible approaches to this root computation problem. We can express the tangent curve into parametric form and substitute into an implicit form for the edge or we can express the edge in parametric form and substitute in an implicit form of the tangent curve. Normally the solution of a system of ODE's is given in parametric form and so the first approach is the most accessible and straightforward. The second approach requires the 'implicitization' of these parametric curves. The implicitization of parametric curves can often be rather difficult, but in this case we have been successful and have been able to develop algorithms and subsequent computer programs for both approaches. We will give these details along with some comparisons in a forthcoming research paper on this topic.

Source record↗
NASA NTRS1994

The Electronic Documentation Project in the NASA mission control center environment

NASA's space programs like many other technical programs of its magnitude is supported by a large volume of technical documents. These documents are not only diverse but also abundant. Management, maintenance, and retrieval of these documents is a challenging problem by itself; but, relating and cross-referencing this wealth of information when it is all on a medium of paper is an even greater challenge. The Electronic Documentation Project (EDP) is to provide an electronic system capable of developing, distributing and controlling changes for crew/ground controller procedures and related documents. There are two primary motives for the solution. The first motive is to reduce the cost of maintaining the current paper based method of operations by replacing paper documents with electronic information storage and retrieval. And, the other is to improve the efficiency and provide enhanced flexibility in document usage. Initially, the current paper based system will be faithfully reproduced in an electronic format to be used in the document viewing system. In addition, this metaphor will have hypertext extensions. Hypertext features support basic functions such as full text searches, key word searches, data retrieval, and traversal between nodes of information as well as speeding up the data access rate. They enable related but separate documents to have relationships, and allow the user to explore information naturally through non-linear link traversals. The basic operational requirements of the document viewing system are to: provide an electronic corollary to the current method of paper based document usage; supplement and ultimately replace paper-based documents; maintain focused toward control center operations such as Flight Data File, Flight Rules and Console Handbook viewing; and be available NASA wide.

Wang, Lui↗
NASA NTRS2013

Parametric Thermal Soak Model for Earth Entry Vehicles

The analysis and design of an Earth Entry Vehicle (EEV) is multidisciplinary in nature, requiring the application many disciplines. An integrated tool called Multi Mission System Analysis for Planetary Entry Descent and Landing or M-SAPE is being developed as part of Entry Vehicle Technology project under In-Space Technology program. Integration of a multidisciplinary problem is a challenging task. Automation of the execution process and data transfer among disciplines can be accomplished to provide significant benefits. Thermal soak analysis and temperature predictions of various interior components of entry vehicle, including the impact foam and payload container are part of the solution that M-SAPE will offer to spacecraft designers. The present paper focuses on the thermal soak analysis of an entry vehicle design based on the Mars Sample Return entry vehicle geometry and discusses a technical approach to develop parametric models for thermal soak analysis that will be integrated into M-SAPE. One of the main objectives is to be able to identify the important parameters and to develop correlation coefficients so that, for a given trajectory, can estimate the peak payload temperature based on relevant trajectory parameters and vehicle geometry. The models are being developed for two primary thermal protection (TPS) materials: 1) carbon phenolic that was used for Galileo and Pioneer Venus probes and, 2) Phenolic Impregnated Carbon Ablator (PICA), TPS material for Mars Science Lab mission. Several representative trajectories were selected from a very large trade space to include in the thermal analysis in order to develop an effective parametric thermal soak model. The selected trajectories covered a wide range of heatload and heatflux combinations. Non-linear, fully transient, thermal finite element simulations were performed for the selected trajectories to generate the temperature histories at the interior of the vehicle. Figure 1 shows the finite element model that was used for the simulations. The results indicate that it takes several hours for the thermal energy to soak into the interior of the vehicle and achieve maximum payload temperatures. In addition, a strong correlation between the heatload and peak payload container temperature is observed that will help establishing the parametric thermal soak model.

Agrawal, Parul↗
NASA NTRS2025

Generalized Reference Targeting for Spaceflight

For spaceflight programs to achieve some of the aggressive exploration initiatives such as visiting and landing on other celestial bodies, rendezvousing with other orbiting vehicles, and ultimately returning crew safely to Earth, an assortment of targeting algorithms to compute the necessary burns to strategically maneuver a spacecraft to a variety of destinations are required. Numerous examples exist, but rather than creating and implementing multiple targeting solutions, is it possible to have a general targeting model that can accommodate a variety of applications? Originally motivated for mission design and analysis purposes, this paper outlines a generalized reference targeting algorithm for spaceflight that may also have applications in on-orbit flight software. It accommodates arbitrary flight dynamics and both impulsive and finite burns for either absolute or relative targeting applications. It also allows for an arbitrary number of targeting design parameters such as multiple discrete correction burns or finite thrust parameters to satisfy numerous combinations of targeting constraints that can have fixed or variable time epochs. Given a reference trajectory, this targeting technique provides a general framework to quickly solve an assortment of targeting problems that may be well-defined, over-determined, or under-determined while naturally producing metrics providing insight into the controllability for a given problem formulation. Due to the derivation, speed, and accuracy of the algorithm, it lends to supporting rapid linear covariance analysis and robust trajectory design applications for a variety of flight phases such as rendezvous and docking, cislunar transfer, interplanetary flight, orbit maintenance, de-orbit, and powered descent and landing.

Targeting↗
NASA NTRS1993

Status of LDEF ionizing radiation measurements and analysis

At this symposium significant new data and analyses were reported in cosmic ray research, radiation dosimetry, induced radioactivity, and radiation environment modeling. Measurements of induced radioactivity and absorbed dose are nearly complete, but much analysis and modeling remains. Measurements and analyses of passive nuclear track detectors (PNTD), used to derive the cosmic ray composition and spectra, and linear energy transfer (LET) spectra, are only a few percent complete, but important results have already emerged. As one might expect at this stage of the research, some of the new information has produced questions rather than answers. Low-energy heavy nuclei detected by two experiments are not compatible with known solar or cosmic components. Various data sets on absorbed dose are not consistent, and a new trapped proton environment model does not match the absorbed dose data. A search for cosmogenic nuclei other than Be-7 on Long Duration Exposure Facility (LDEF) surfaces has produced an unexpected result, and some activation data relating to neutrons is not yet understood. Most of these issues will be resolved by the analysis of further experiment data, calibrations, or the application of the large LDEF data set that offers alternate data or analysis techniques bearing on the same problem. The scope of the papers at this symposium defy a compact technical summary. I have attempted to group the new information that I noted into the following groups: induced radioactivity; absorbed dose measurements; LET spectra and heavy ion dosimetry; environment modeling and three dimensional shielding effects; cosmogenic nuclei; and cosmic rays and other heavy ions. The papers generally are expository and have excellent illustrations, and I refer to their figures rather than reproduce them here. The general program and objectives of ionizing radiation measurements and analyses on LDEF has been described previously.

Parnell, Thomas A.↗
NASA NTRS2007

Generative Representations for Automated Design of Robots

A method of automated design of complex, modular robots involves an evolutionary process in which generative representations of designs are used. The term generative representations as used here signifies, loosely, representations that consist of or include algorithms, computer programs, and the like, wherein encoded designs can reuse elements of their encoding and thereby evolve toward greater complexity. Automated design of robots through synthetic evolutionary processes has already been demonstrated, but it is not clear whether genetically inspired search algorithms can yield designs that are sufficiently complex for practical engineering. The ultimate success of such algorithms as tools for automation of design depends on the scaling properties of representations of designs. A nongenerative representation (one in which each element of the encoded design is used at most once in translating to the design) scales linearly with the number of elements. Search algorithms that use nongenerative representations quickly become intractable (search times vary approximately exponentially with numbers of design elements), and thus are not amenable to scaling to complex designs. Generative representations are compact representations and were devised as means to circumvent the above-mentioned fundamental restriction on scalability. In the present method, a robot is defined by a compact programmatic form (its generative representation) and the evolutionary variation takes place on this form. The evolutionary process is an iterative one, wherein each cycle consists of the following steps: 1. Generative representations are generated in an evolutionary subprocess. 2. Each generative representation is a program that, when compiled, produces an assembly procedure. 3. In a computational simulation, a constructor executes an assembly procedure to generate a robot. 4. A physical-simulation program tests the performance of a simulated constructed robot, evaluating the performance according to a fitness criterion to yield a figure of merit that is fed back into the evolutionary subprocess of the next iteration. In comparison with prior approaches to automated evolutionary design of robots, the use of generative representations offers two advantages: First, a generative representation enables the reuse of components in regular and hierarchical ways and thereby serves a systematic means of creating more complex modules out of simpler ones. Second, the evolved generative representation may capture intrinsic properties of the design problem, so that variations in the representations move through the design space more effectively than do equivalent variations in a nongenerative representation. This method has been demonstrated by using it to design some robots that move, variously, by walking, rolling, or sliding. Some of the robots were built (see figure). Although these robots are very simple, in comparison with robots designed by humans, their structures are more regular, modular, hierarchical, and complex than are those of evolved designs of comparable functionality synthesized by use of nongenerative representations.

Homby, Gregory S.↗
NASA NTRS1994

Locating buildings in aerial photos

Algorithms and techniques for use in the identification and location of large buildings in digitized copies of aerial photographs are developed and tested. The building data would be used in the simulation of objects located in the vicinity of an airport that may be detected by aircraft radar. Two distinct approaches are considered. Most building footprints are rectangular in form. The first approach studied is to search for right-angled corners that characterize rectangular objects and then to connect these corners to complete the building. This problem is difficult because many nonbuilding objects, such as street corners, parking lots, and ballparks often have well defined corners which are often difficult to distinguish from rooftops. Furthermore, rooftops come in a number of shapes, sizes, shadings, and textures which also limit the discrimination task. The strategy used linear sequences of different samples to detect straight edge segments at multiple angles and to determine when these segments meet at approximately right-angles with respect to each other. This technique is effective in locating corners. The test image used has a fairly rectangular block pattern oriented about thirty degrees clockwise from a vertical alignment, and the overall measurement data reflect this. However, this technique does not discriminate between buildings and other objects at an operationally suitable rate. In addition, since multiple paths are tested for each image pixel, this is a time consuming task. The process can be speeded up by preprocessing the image to locate the more optimal sampling paths. The second approach is to rely on a human operator to identify and select the building objects and then to have the computer determine the outline and location of the selected structures. When presented with a copy of a digitized aerial photograph, the operator uses a mouse and cursor to select a target building. After a button on the mouse is pressed, with the cursor fully within the perimeter of the building, the program scans from the position of the cursor to a perimeter position where a shift in grayscale is detected. Once at the perimeter, the process traces along it, around the building, until it eventually returns to the perimeter starting point. Spatial resolution limits cause the perimeter trace to be somewhat course so that a line straightening algorithm is employed. One result is that the building corner positions become more distinctly defined.

Green, James S.↗
NASA NTRSDate not supplied

Improved Benchmarking of Cohesive Elements in Abaqus Standard for Predicting Disbond and Delamination in Composite Structures

Traditional approaches for aircraft certification require the assumption of an initial flaw condition, either represented as barely visible impact damage (BVID) or through inclusion of a Teflon insert to serve as surrogate damage. Based on the initial composite damage state, the structure must be shown to demonstrate structural durability and damage tolerance (DaDT) according to the following criteria: a. Damage displays no detrimental growth under cyclic loading b. The structure is able to sustain design limit load (DLL) Currently, the only available manner for validating structural performance is through test. Since damage can occur over a wide variety of areas within a structure, this approach has proven to be increasingly expensive and time consuming for composite airframes and acreage structure within the design-test-certification building block. A further complicating factor is the requirement to accurately capture the most critical damage morphologies as a starting condition. To understand the severity of the damage, it is either required to experimentally determine the most critical areas at tremendous expense or rely on legacy data of similar structural testing, which limits design space expansion. A preferred solution is to use advanced analysis to provide improved understanding of load margins for critical locations based on a wide variety of potential starting damage conditions. The standard industry approach for DaDT certification adheres to the use of the traditional virtual crack closure technique (VCCT) method. VCCT is generally a preferred method because it conforms to the current certification principles of damage from a known flaw, and when used correctly, can be effective at predicting delamination propagation under static and cyclic loading. The VCCT method requires the inclusion of an initial flaw in the finite element (FE) model requiring a-priori knowledge of the flaw location. This in turn requires a plethora of analysis cases to be examined to cover a reasonable span of potential damage states. Additionally, the VCCT approach requires node-to-node connectivity rendering it incompatible with the best practices and approaches for using continuum damage mechanics (CDM) based progressive damage and failure analysis (PDFA) tools within a typical FE solver. Alternatives to VCCT have emerged in the form of cohesive elements which utilize the cohesive zone model (CZM). Unlike VCCT which models linear elastic fracture mechanics, cohesive elements couples continuum and fracture based responses through the use of bilinear traction separation laws. These laws are defined based on a penalty stiffness, a cohesive strength, and a strain energy release rate. The approach can be mesh regularized with native cohesive elements within many FE solvers such as Abaqus and LS-DYNA. In Phase I of the NASA Advanced Composites Consortium (ACC) post-buckled stiffened panel with BVID, Strength and Life [1], the performance of cohesive elements were benchmarked in comparison to VCCT and LEFM solutions and showed good agreement using Abaqus explicit [2]. To realize savings on current and future programs, it is still necessary to close technical gaps related to the use of cohesive elements with Abaqus Standard. Within a program environment, standard finite element analysis is the preferred analytical capability for quasi-static loading as it eliminates uncertainty due to oscillatory behavior commonly seen with explicit analysis. This oscillatory behavior creates difficulties in writing margins of safety based on the analysis. The use of negative tangent stiffness material models complicates convergence which typically requires the use of numerical controls such as viscous damping to overcome. To date, there has not been a comprehensive study on how to establish best practices for cohesive element convergence for predictive capability within the Abaqus implicit solver. In pursuit of these goals, under the NASA ACC program, several numerical benchmark problems were proposed including pure mode I (double cantilevered beam – DCB), pure mode II (end notch flexure – ENF), and symmetric/unsymmetric evolving mixed mode (single leg bend – SLB). This paper focuses on the use of cohesive elements to model the delamination through the use of CZM. Specifically, finite element models for the DCB, ENF, symmetric SLB, and unsymmetric SLB, are developed and various solution controls for convergence are studied to develop a best practice. Once the best practice has been developed, the predictive capability of the objective CZM model is used to analyze the hat pull-off strength of a standard hat stiffened configuration under various loading conditions.

Abaqus↗
NASA NTRS1992

Mapping unstructured grid computations to massively parallel computers

Investigated here is this mapping problem: assign the tasks of a parallel program to the processors of a parallel computer such that the execution time is minimized. First, a taxonomy of objective functions and heuristics used to solve the mapping problem is presented. Next, we develop a highly parallel heuristic mapping algorithm, called Cyclic Pairwise Exchange (CPE), and discuss its place in the taxonomy. CPE uses local pairwise exchanges of processor assignments to iteratively improve an initial mapping. A variety of initial mapping schemes are tested and recursive spectral bipartitioning (RSB) followed by CPE is shown to result in the best mappings. For the test cases studied here, problems arising in computational fluid dynamics and structural mechanics on unstructured triangular and tetrahedral meshes, RSB and CPE outperform methods based on simulated annealing. Much less time is required to do the mapping and the results obtained are better. Compared with random and naive mappings, RSB and CPE reduce the communication time two fold for the test problems used. Finally, we use CPE in two applications on a CM-2. The first application is a data parallel mesh-vertex upwind finite volume scheme for solving the Euler equations on 2-D triangular unstructured meshes. CPE is used to map grid points to processors. The performance of this code is compared with a similar code on a Cray-YMP and an Intel iPSC/860. The second application is parallel sparse matrix-vector multiplication used in the iterative solution of large sparse linear systems of equations. We map rows of the matrix to processors and use an inner-product based matrix-vector multiplication. We demonstrate that this method is an order of magnitude faster than methods based on scan operations for our test cases.

Hammond, Steven Warren↗
NASA NTRS2002

NASA Tech Briefs, April 2002

The contents include: 1) Application Briefs; 2) Sneak Preview of Sensors Expo; 3) The Complexity of the Diagnosis Problem; 4) Design Concepts for the ISS TransHab Module; 5) Characteristics of Supercritical Transitional Mixing Layers; 6) Electrometer for Triboelectric Evaluation of Materials; 7) Infrared CO2 Sensor With Built-In Calibration Chambers; 8) Solid-State Potentiometric CO Sensor; 9) Planetary Rover Absolute Heading Detection Using a Sun Sensor; 10) Concept for Utilizing Full Areas of STJ Photodetector Arrays; 11) Development of Cognitive Sensors; 12) Enabling Higher-Voltage Operation of SOl CMOS Transistors; 13) Estimating Antenna-Pointing Errors From Beam Squints; 14) Advanced-Fatigue-Crack-Growth and Fracture- Mechanics Program; 15) Software for Sequencing Spacecraft Actions; 16) Program Distributes and Tracks Organizational Memoranda; 16) Flat Membrane Device for Dehumidification of Air; 17) Inverted Hindle Mount Reduces Sag of a Large, Precise Mirror; 18) Heart-Pump-Outlet/Cannula Coupling; 19) Externally Triggered Microcapsules Release Drugs In Situ; 20) Combinatorial Drug Design Augmented by Information Theory; 21) Multiple-Path-Length Optical Absorbance Cell; 22) Model of a Fluidized Bed Containing a Mixture of Particles; 23) Refractive Secondary Concentrators for Solar Thermal Systems; 24) Cold Flow Calorimeter; 25) Methodology for Tracking Hazards and Predicting Failures; 26) Estimating Heterodyne-Interferometer Polarization Leakage; 27) An Efficient Algorithm for Propagation of Temporal- Constraint Networks; 28) Software for Continuous Replanning During Execution; 29) Surface-Launched Explorers for Reconnaissance/Scouting; 30) Firmware for a Small Motion-Control Processor; 31) Gear Bearings and Gear-Bearing Transmissions; and 32) Linear Dynamometer With Variable Stroke and Frequency.

Source record↗
NASA NTRS1999

Integration of a Decentralized Linear-Quadratic-Gaussian Control into GSFC's Universal 3-D Autonomous Formation Flying Algorithm

A decentralized control is investigated for applicability to the autonomous formation flying control algorithm developed by GSFC for the New Millenium Program Earth Observer-1 (EO-1) mission. This decentralized framework has the following characteristics: The approach is non-hierarchical, and coordination by a central supervisor is not required; Detected failures degrade the system performance gracefully; Each node in the decentralized network processes only its own measurement data, in parallel with the other nodes; Although the total computational burden over the entire network is greater than it would be for a single, centralized controller, fewer computations are required locally at each node; Requirements for data transmission between nodes are limited to only the dimension of the control vector, at the cost of maintaining a local additional data vector. The data vector compresses all past measurement history from all the nodes into a single vector of the dimension of the state; and The approach is optimal with respect to standard cost functions. The current approach is valid for linear time-invariant systems only. Similar to the GSFC formation flying algorithm, the extension to linear LQG time-varying systems requires that each node propagate its filter covariance forward (navigation) and controller Riccati matrix backward (guidance) at each time step. Extension of the GSFC algorithm to non-linear systems can also be accomplished via linearization about a reference trajectory in the standard fashion, or linearization about the current state estimate as with the extended Kalman filter. To investigate the feasibility of the decentralized integration with the GSFC algorithm, an existing centralized LQG design for a single spacecraft orbit control problem is adapted to the decentralized framework while using the GSFC algorithm's state transition matrices and framework. The existing GSFC design uses both reference trajectories of each spacecraft in formation and by appropriate choice of coordinates and simplified measurement modeling is formulated as a linear time-invariant system. Results for improvements to the GSFC algorithm and a multiple satellite formation will be addressed. The goal of this investigation is to progressively relax the assumptions that result in linear time-invariance, ultimately to the point of linearization of the non-linear dynamics about the current state estimate as in the extended Kalman filter. An assessment will then be made about the feasibility of the decentralized approach to the realistic formation flying application of the EO-1/Landsat 7 formation flying experiment.

Folta, David C.↗
NASA NTRS1995

The second-moment climatology of the GATE rain rate data

The first part of this paper presents the description of the GARP (Global Atmospheric Research Program) Atlantic Tropical Experiment (GATE) 1 rain-rate data and its two-dimensional spectral and correlation characteristics, which has made it possible to accomplish the following: to show the concentration of a significant power along the frequency axis in the spatiotemporal spectra; to detect a diurnal cycle (which has a range of variation of about 3.4-5.4 mm/n) as one of the sources of bias in the rain statistics of satellite data; to study the distinction between the north-south and east-west transport of spatial rain-rate field and character of its anisotropy; to evaluate the scales of the distinction between second-moment estimates associated with ground and satellite samples; and to determine the appropriate spatial and temporal scales of simple linear stochastic models fitted to averaged rain-rate fields. The second part of this paper is devoted to an analysis of the diffusion of the rain rate by establishing a relationship between the parameters of the multivariate autoregressive model and the coefficients of a diffusion equation. This analysis led to the use of rain data to estimate the rain advection velocity as well as other coefficients of the diffusion equation of the corresponding field. The results obtained can be used for comparison with corresponding estimates of other sources of data (satellite, Tropical Oceans Global Atmosphere Coupled Ocean - Atmosphere Response Experiment (TOGA, COARE) or simulated by physical models), for generating multiple samples of any size, for solving the inverse problems of some of the hydrodynamic equations, and in some other areas of rain data analysis and modeling.

Polyak, Ilya↗
NASA NTRS2009

Smart and Intelligent Sensors

John C. Stennis Space Center (SSC) provides rocket engine propulsion testing for NASA's space programs. Since the development of the Space Shuttle, every Space Shuttle Main Engine (SSME) has undergone acceptance testing at SSC before going to Kennedy Space Center (KSC) for integration into the Space Shuttle. The SSME is a large cryogenic rocket engine that uses Liquid Hydrogen (LH2) as the fuel. As NASA moves to the new ARES V launch system, the main engines on the new vehicle, as well as the upper stage engine, are currently base lined to be cryogenic rocket engines that will also use LH2. The main rocket engines for the ARES V will be larger than the SSME, while the upper stage engine will be approximately half that size. As a result, significant quantities of hydrogen will be required during the development, testing, and operation of these rocket engines.Better approaches are needed to simplify sensor integration and help reduce life-cycle costs. 1.Smarter sensors. Sensor integration should be a matter of "plug-and-play" making sensors easier to add to a system. Sensors that implement new standards can help address this problem; for example, IEEE STD 1451.4 defines transducer electronic data sheet (TEDS) templates for commonly used sensors such as bridge elements and thermocouples. When a 1451.4 compliant smart sensor is connected to a system that can read the TEDS memory, all information needed to configure the data acquisition system can be uploaded. This reduces the amount of labor required and helps minimize configuration errors. 2.Intelligent sensors. Data received from a sensor be scaled, linearized; and converted to engineering units. Methods to reduce sensor processing overhead at the application node are needed. Smart sensors using low-cost microprocessors with integral data acquisition and communication support offer the means to add these capabilities. Once a processor is embedded, other features can be added; for example, intelligent sensors can make a health assessment to inform the data acquisition client when sensor performance is suspect. 3.Distributed sample synchronization. Networks of sensors require new ways for synchronizing samples. Standards that address the distributed timing problem (for example, IEEE STD 1588) provide the means to aggregate samples from many distributed smart sensors with sub-microsecond accuracy. 4. Reduction in interconnect. Alternative means are needed to reduce the frequent problems associated with cabling and connectors. Wireless technologies offer the promise of reducing interconnects and simultaneously making it easy to quickly add a sensor to a system.

Lansaw, John↗
NASA NTRS1998

Turbulence Measurements on a Flap-Edge Model

Turbulence measurements have been made on a flap-edge and leading-edge slat model using hot-wire anemometry, and, later, particle image velocimetry. The properties of hot-wire anemometry were studied using facilities at NASA Ames Research Center. Hot-film probes were used because of their durability, but cross-films were limited by non-linear end effects. As a warm-up exercise, hot-film probes were used to measure velocities in the farfield wake of a cylinder with an airfoil in the near-field wake. The airfoil reduced the drag coefficient of the system by 10%. A single-wire hot-film probe was used to measure velocity profiles over the top of a NACA 63(sub 2)-215 Mod. B wing with a Fowler flap and leading,-edge slat. Results showed the size of slat wake was dependent upon the slat deflection angle. Velocity increased through the slat gap with increased deflection. The acoustically modified slat decreased the chance of separation. Measurements were taken at the flap edge with a single hot-film. Trends in the data indicate velocity and turbulence levels increase at the flap edge. The acoustically modified flap modifies the mean flow near the flap edge. Correlations were made between the hot-film signal and the unsteady pressure transducers on the wing which were published in a NASA CDTM. The principles of Particle Image Velocimetry (PIV) were studied at Florida State University. Spectral PIV was used to measure the spectra of a subsonic jet. Measured frequencies were close to the predicted frequency of jet shedding. Spectral PIV will be used to measure the spectra of the slat flow in the second 7 x lO-ft. wind tunnel test. PIV has an advantage that it can measure velocity and spectra of the entire flowfield instantaneously. However, problems arise when trying, to store this massive amount of PIV data. Support for this research has continued through a NASA Graduate Student Program Fellowship which will end in June 1999. The thesis should be completed by this time.

Moriarty, Patrick↗
NASA NTRS1996

Multi Objective Controller Design for Linear System via Optimal Interpolation

We propose a methodology for the design of a controller which satisfies a set of closed-loop objectives simultaneously. The set of objectives consists of: (1) pole placement, (2) decoupled command tracking of step inputs at steady-state, and (3) minimization of step response transients with respect to envelope specifications. We first obtain a characterization of all controllers placing the closed-loop poles in a prescribed region of the complex plane. In this characterization, the free parameter matrix Q(s) is to be determined to attain objectives (2) and (3). Objective (2) is expressed as determining a Pareto optimal solution to a vector valued optimization problem. The solution of this problem is obtained by transforming it to a scalar convex optimization problem. This solution determines Q(O) and the remaining freedom in choosing Q(s) is used to satisfy objective (3). We write Q(s) = (l/v(s))bar-Q(s) for a prescribed polynomial v(s). Bar-Q(s) is a polynomial matrix which is arbitrary except that Q(O) and the order of bar-Q(s) are fixed. Obeying these constraints bar-Q(s) is now to be 'shaped' to minimize the step response characteristics of specific input/output pairs according to the maximum envelope violations. This problem is expressed as a vector valued optimization problem using the concept of Pareto optimality. We then investigate a scalar optimization problem associated with this vector valued problem and show that it is convex. The organization of the report is as follows. The next section includes some definitions and preliminary lemmas. We then give the problem statement which is followed by a section including a detailed development of the design procedure. We then consider an aircraft control example. The last section gives some concluding remarks. The Appendix includes the proofs of technical lemmas, printouts of computer programs, and figures.

Ozbay, Hitay↗
NASA NTRS2000

Performance of the OVERFLOW-MLP and LAURA-MLP CFD Codes on the NASA Ames 512 CPU Origin System

The shared memory Multi-Level Parallelism (MLP) technique, developed last year at NASA Ames has been very successful in dramatically improving the performance of important NASA CFD codes. This new and very simple parallel programming technique was first inserted into the OVERFLOW production CFD code in FY 1998. The OVERFLOW-MLP code's parallel performance scaled linearly to 256 CPUs on the NASA Ames 256 CPU Origin 2000 system (steger). Overall performance exceeded 20.1 GFLOP/s, or about 4.5x the performance of a dedicated 16 CPU C90 system. All of this was achieved without any major modification to the original vector based code. The OVERFLOW-MLP code is now in production on the inhouse Origin systems as well as being used offsite at commercial aerospace companies. Partially as a result of this work, NASA Ames has purchased a new 512 CPU Origin 2000 system to further test the limits of parallel performance for NASA codes of interest. This paper presents the performance obtained from the latest optimization efforts on this machine for the LAURA-MLP and OVERFLOW-MLP codes. The Langley Aerothermodynamics Upwind Relaxation Algorithm (LAURA) code is a key simulation tool in the development of the next generation shuttle, interplanetary reentry vehicles, and nearly all "X" plane development. This code sustains about 4-5 GFLOP/s on a dedicated 16 CPU C90. At this rate, expected workloads would require over 100 C90 CPU years of computing over the next few calendar years. It is not feasible to expect that this would be affordable or available to the user community. Dramatic performance gains on cheaper systems are needed. This code is expected to be perhaps the largest consumer of NASA Ames compute cycles per run in the coming year.The OVERFLOW CFD code is extensively used in the government and commercial aerospace communities to evaluate new aircraft designs. It is one of the largest consumers of NASA supercomputing cycles and large simulations of highly resolved full aircraft are routinely undertaken. Typical large problems might require 100s of Cray C90 CPU hours to complete. The dramatic performance gains with the 256 CPU steger system are exciting. Obtaining results in hours instead of months is revolutionizing the way in which aircraft manufacturers are looking at future aircraft simulation work. Figure 2 below is a current state of the art plot of OVERFLOW-MLP performance on the 512 CPU Lomax system. As can be seen, the chart indicates that OVERFLOW-MLP continues to scale linearly with CPU count up to 512 CPUs on a large 35 million point full aircraft RANS simulation. At this point performance is such that a fully converged simulation of 2500 time steps is completed in less than 2 hours of elapsed time. Further work over the next few weeks will improve the performance of this code even further.The LAURA code has been converted to the MLP format as well. This code is currently being optimized for the 512 CPU system. Performance statistics indicate that the goal of 100 GFLOP/s will be achieved by year's end. This amounts to 20x the 16 CPU C90 result and strongly demonstrates the viability of the new parallel systems rapidly solving very large simulations in a production environment.

Taft, James R.↗
NASA NTRS1994

A new look at the simultaneous analysis and design of structures

The minimum weight optimization of structural systems, subject to strength and displacement constraints as well as size side constraints, was investigated by the Simultaneous ANalysis and Design (SAND) approach. As an optimizer, the code NPSOL was used which is based on a sequential quadratic programming (SQP) algorithm. The structures were modeled by the finite element method. The finite element related input to NPSOL was automatically generated from the input decks of such standard FEM/optimization codes as NASTRAN or ASTROS, with the stiffness matrices, at present, extracted from the FEM code ANALYZE. In order to avoid ill-conditioned matrices that can be encountered when the global stiffness equations are used as additional nonlinear equality constraints in the SAND approach (with the displacements as additional variables), the matrix displacement method was applied. In this approach, the element stiffness equations are used as constraints instead of the global stiffness equations, in conjunction with the nodal force equilibrium equations. This approach adds the element forces as variables to the system. Since, for complex structures and the associated large and very sparce matrices, the execution times of the optimization code became excessive due to the large number of required constraint gradient evaluations, the Kreisselmeier-Steinhauser function approach was used to decrease the computational effort by reducing the nonlinear equality constraint system to essentially a single combined constraint equation. As the linear equality and inequality constraints require much less computational effort to evaluate, they were kept in their previous form to limit the complexity of the KS function evaluation. To date, the standard three-bar, ten-bar, and 72-bar trusses have been tested. For the standard SAND approach, correct results were obtained for all three trusses although convergence became slower for the 72-bar truss. When the matrix displacement method was used, correct results were still obtained, but the execution times became excessive due to the large number of constraint gradient evaluations required. Using the KS function, the computational effort dropped, but the optimization seemed to become less robust. The investigation of this phenomenon is continuing. As an alternate approach, the code MINOS for the optimization of sparse matrices can be applied to the problem in lieu of the Kreisselmeier-Steinhauser function. This investigation is underway.

Striz, Alfred G.↗