Search NASA⌕ Search

Engineering topics

Straeter, T. A.

Publications and source records attributed to Straeter, T. A..

15 records
All sourcesNASA NTRSDOE OSTI
NASA NTRS1979

A progress report on a NASA research program for embedded computer systems software

The paper presents the results of the second stage of the Multipurpose User-oriented Software Technology (MUST) program. Four primary areas of activities are discussed: programming environment, HAL/S higher-order programming language support, the Integrated Verification and Testing System (IVTS), and distributed system language research. The software development environment is provided by the interactive software invocation system. The higher-order programming language (HOL) support chosen for consideration is HAL/S mainly because at the time it was one of the few HOLs with flight computer experience and it is the language used on the Shuttle program. The overall purpose of IVTS is to provide a 'user-friendly' software testing system which is highly modular, user controlled, and cooperative in nature.

Foudriat, E. C.↗
NASA NTRS1977

Research flight software engineering and MUST, an integrated system of support tools

Consideration is given to software development to support NASA flight research. The Multipurpose User-Oriented Software Technology (MUST) program, designed to integrate digital systems into flight research, is discussed. Particular attention is given to the program's special interactive user interface, subroutine library, assemblers, compiler, automatic documentation tools, and test and simulation subsystems.

Straeter, T. A.↗
NASA NTRS1977

MUST - An integrated system of support tools for research flight software engineering

The objectives of NASA's MUST (Multipurpose User-oriented Software Technology) program at Langley Research Center are to cut the cost of producing software which effectively utilizes digital systems for flight research. These objectives will be accomplished by providing an integrated system of support software tools for use throughout the research flight software development process. A description of the overall MUST program and its progress toward the release of a first MUST system will be presented. This release includes: a special interactive user interface, a library of subroutines, assemblers, a compiler, automatic documentation tools, and a test and simulation system.

Straeter, T. A.↗
NASA NTRS1976

TCV software test and validation tools and technique

The paper describes techniques for testing and validating software for the TCV (Terminal Configured Vehicle) program which is intended to solve problems associated with operating a commercial transport aircraft in the terminal area. The TCV research test bed is a Boeing 737 specially configured with digital computer systems to carry out automatic navigation, guidance, flight controls, and electronic displays research. The techniques developed for time and cost reduction include automatic documentation aids, an automatic software configuration, and an all software generation and validation system.

Straeter, T. A.↗
NASA NTRS1975

A parallel Jacobson-Oksman optimization algorithm

A gradient-dependent optimization technique which exploits the vector-streaming or parallel-computing capabilities of some modern computers is presented. The algorithm, derived by assuming that the function to be minimized is homogeneous, is a modification of the Jacobson-Oksman serial minimization method. In addition to describing the algorithm, conditions insuring the convergence of the iterates of the algorithm and the results of numerical experiments on a group of sample test functions are presented. The results of these experiments indicate that this algorithm will solve optimization problems in less computing time than conventional serial methods on machines having vector-streaming or parallel-computing capabilities.

Straeter, T. A.↗
NASA NTRS1973

A parallel variable metric optimization algorithm

An algorithm, designed to exploit the parallel computing or vector streaming (pipeline) capabilities of computers is presented. When p is the degree of parallelism, then one cycle of the parallel variable metric algorithm is defined as follows: first, the function and its gradient are computed in parallel at p different values of the independent variable; then the metric is modified by p rank-one corrections; and finally, a single univariant minimization is carried out in the Newton-like direction. Several properties of this algorithm are established. The convergence of the iterates to the solution is proved for a quadratic functional on a real separable Hilbert space. For a finite-dimensional space the convergence is in one cycle when p equals the dimension of the space. Results of numerical experiments indicate that the new algorithm will exploit parallel or pipeline computing capabilities to effect faster convergence than serial techniques.

Straeter, T. A.↗
NASA NTRS1973

An analytic study of near terminal area optimal sequencing and flow control techniques

Optimal flow control and sequencing of air traffic operations in the near terminal area are discussed. The near terminal area model is based on the assumptions that the aircraft enter the terminal area along precisely controlled approach paths and that the aircraft are segregated according to their near terminal area performance. Mathematical models are developed to support the optimal path generation, sequencing, and conflict resolution problems.

Park, S. K.↗
NASA NTRS1972

Davidon-Broyden rank-one minimization methods in Hilbert space with application to optimal control problems

The Davidon-Broyden class of rank one, quasi-Newton minimization methods is extended from Euclidean spaces to infinite-dimensional, real Hilbert spaces. For several techniques of choosing the step size, conditions are found which assure convergence of the associated iterates to the location of the minimum of a positive definite quadratic functional. For those techniques, convergence is achieved without the problem of the computation of a one-dimensional minimum at each iteration. The application of this class of minimization methods for the direct computation of the solution of an optimal control problem is outlined. The performance of various members of the class are compared by solving a sample optimal control problem. Finally, the sample problem is solved by other known gradient methods, and the results are compared with those obtained with the rank one quasi-Newton methods.

Straeter, T. A.↗
NASA NTRS1972

Application of optimization techniques to near terminal area sequencing and flow control.

Development of an arrival air-traffic management system for a single runway. Traffic is segregated throughout most of the near terminal area according to performance characteristics. Nominal approach routes for each class of aircraft are determined by an optimization procedure. In this fashion, the nominal approach routes are dependent upon and, hence, determined by the near terminal area operating capabilities of each class of aircraft. The landing order and spacing of aircraft on the common approach path are determined so that a measure of total system deviation from the nominal landing times is minimized and safety standards are met. Delay maneuvers required to satisfy sequencing needs are then carried out in a manner dependent upon the particular class of aircraft being maneuvered. Finally, results are presented to illustrate the effects of the rate of arrivals upon a one-runway system serving three different classes of aircraft employing several different sequencing strategies and measures of total system deviation.

Straeter, T. A.↗
NASA NTRS1972

System identification computational considerations.

System identification methods may be accurately characterized as inverse computational problems. Three approaches to the computational problem are considered. Equation error methods are based on regression analysis techniques. Attention is given to the maximum conditional likelihood estimate and the maximum unconditional likelihood (Bayesian) estimate. Gradient dependent algorithms for solving the minimization problems are discussed, taking into account Gaussian methods, quadratic model methods, and the homogeneous function model method of Jacobson and Oksman. Some advanced methods are also examined.

Bowles, R. L.↗