Search NASA⌕ Search

SEARCH · Search NASA

Results for “vector programs”

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 271 records · Page 15

The nondeterministic divide

The nondeterministic divide partitions a vector into two non-empty slices by allowing the point of division to be chosen nondeterministically. Support for high-level divide-and-conquer programming provided by the nondeterministic divide is investigated. A diva algorithm is a recursive divide-and-conquer sequential algorithm on one or more vectors of the same range, whose division point for a new pair of recursive calls is chosen nondeterministically before any computation is performed and whose recursive calls are made immediately after the choice of division point; also, access to vector components is only permitted during activations in which the vector parameters have unit length. The notion of diva algorithm is formulated precisely as a diva call, a restricted call on a sequential procedure. Diva calls are proven to be intimately related to associativity. Numerous applications of diva calls are given and strategies are described for translating a diva call into code for a variety of parallel computers. Thus diva algorithms separate logical correctness concerns from implementation concerns.

Charlesworth, Arthur↗

Improvement of Automated POST Case Success Rate Using Support Vector Machines

During early conceptual design of complex systems, concept down selection can have a large impact upon program life-cycle cost. Therefore, any concepts selected during early design will inherently commit program costs and affect the overall probability of program success. For this reason it is important to consider as large a design space as possible in order to better inform the down selection process. For conceptual design of launch vehicles, trajectory analysis and optimization often presents the largest obstacle to evaluating large trade spaces. This is due to the sensitivity of the trajectory discipline to changes in all other aspects of the vehicle design. Small deltas in the performance of other subsystems can result in relatively large fluctuations in the ascent trajectory because the solution space is non-linear and multi-modal. In order to help capture large design spaces for new launch vehicles, the authors have performed previous work seeking to automate the execution of the industry standard tool, Program to Optimize Simulated Trajectories (POST). This work initially focused on implementation of analyst heuristics to enable closure of cases in an automated fashion, with the goal of applying the concepts of design of experiments (DOE) and surrogate modeling to enable near instantaneous throughput of vehicle cases.3 As noted in [4] work was then completed to improve the DOE process by utilizing a graph theory based approach to connect similar design points.

Zwack, Mathew R.↗

Improvement of Automated POST Case Success Rate Using Support Vector Machines

During early conceptual design of complex systems, concept down selection can have a large impact upon program life-cycle cost. Therefore, any concepts selected during early design will inherently commit program costs and affect the overall probability of program success. For this reason it is important to consider as large a design space as possible in order to better inform the down selection process. For conceptual design of launch vehicles, trajectory analysis and optimization often presents the largest obstacle to evaluating large trade spaces. This is due to the sensitivity of the trajectory discipline to changes in all other aspects of the vehicle design. Small deltas in the performance of other subsystems can result in relatively large fluctuations in the ascent trajectory because the solution space is non-linear and multi-modal [1]. In order to help capture large design spaces for new launch vehicles, the authors have performed previous work seeking to automate the execution of the industry standard tool, Program to Optimize Simulated Trajectories (POST). This work initially focused on implementation of analyst heuristics to enable closure of cases in an automated fashion, with the goal of applying the concepts of design of experiments (DOE) and surrogate modeling to enable near instantaneous throughput of vehicle cases [2]. Additional work was then completed to improve the DOE process by utilizing a graph theory based approach to connect similar design points [3]. The conclusion of the previous work illustrated the utility of the graph theory approach for completing a DOE through POST. However, this approach was still dependent upon the use of random repetitions to generate seed points for the graph. As noted in [3], only 8% of these random repetitions resulted in converged trajectories. This ultimately affects the ability of the random reps method to confidently approach the global optima for a given vehicle case in a reasonable amount of time. With only an 8% pass rate, tens or hundreds of thousands of reps may be needed to be confident that the best repetition is at least close to the global optima. However, typical design study time constraints require that fewer repetitions be attempted, sometimes resulting in seed points that have only a handful of successful completions. If a small number of successful repetitions are used to generate a seed point, the graph method may inherit some inaccuracies as it chains DOE cases from the non-global-optimal seed points. This creates inherent noise in the graph data, which can limit the accuracy of the resulting surrogate models. For this reason, the goal of this work is to improve the seed point generation method and ultimately the accuracy of the resulting POST surrogate model. The work focuses on increasing the case pass rate for seed point generation.

Zwack, Matthew R.↗

Four-body trajectory optimization

A collection of typical three-body trajectories from the L1 libration point on the sun-earth line to the earth is presented. These trajectories in the sun-earth system are grouped into four distinct families which differ in transfer time and delta V requirements. Curves showing the variations of delta V with respect to transfer time, and typical two and three-impulse primer vector histories, are included. The development of a four-body trajectory optimization program to compute fuel optimal trajectories between the earth and a point in the sun-earth-moon system are also discussed. Methods for generating fuel optimal two-impulse trajectories which originate at the earth or a point in space, and fuel optimal three-impulse trajectories between two points in space, are presented. A brief qualitative comparison of these methods is given. An example of a four-body two-impulse transfer from the Li libration point to the earth is included.

Pu, C. L.↗

Three-dimensional vector modeling and restoration of flat finite wave tank radiometric measurements

The three-dimensional vector interaction between a microwave radiometer and a wave tank was modeled. Computer programs for predicting the response of the radiometer to the brightness temperature characteristics of the surroundings were developed along with a computer program that can invert (restore) the radiometer measurements. It is shown that the computer programs can be used to simulate the viewing of large bodies of water, and is applicable to radiometer measurements received from satellites monitoring the ocean. The water temperature, salinity, and wind speed can be determined.

Truman, W. M.↗

Some methods of computing platform transmitter terminal location estimates

A position estimation algorithm was developed to track a humpback whale tagged with an ARGOS platform after a transmitter deployment failure and the whale's diving behavior precluded standard methods. The algorithm is especially useful where a transmitter location program exists; it determines the classical keplarian elements from the ARGOS spacecraft position vectors included with the probationary file messages. A minimum of three distinct messages are required. Once the spacecraft orbit is determined, the whale is located using standard least squares regression techniques. Experience suggests that in instances where circumstances inherent in the experiment yield message data unsuitable for the standard ARGOS reduction, (message data may be too sparse, span an insufficient period, or include variable-length messages). System ARGOS can still provide much valuable location information if the user is willing to accept the increased location uncertainties.

Hoisington, C. M.↗

Algorithms versus architectures for computational chemistry

The algorithms employed are computationally intensive and, as a result, increased performance (both algorithmic and architectural) is required to improve accuracy and to treat larger molecular systems. Several benchmark quantum chemistry codes are examined on a variety of architectures. While these codes are only a small portion of a typical quantum chemistry library, they illustrate many of the computationally intensive kernels and data manipulation requirements of some applications. Furthermore, understanding the performance of the existing algorithm on present and proposed supercomputers serves as a guide for future programs and algorithm development. The algorithms investigated are: (1) a sparse symmetric matrix vector product; (2) a four index integral transformation; and (3) the calculation of diatomic two electron Slater integrals. The vectorization strategies are examined for these algorithms for both the Cyber 205 and Cray XMP. In addition, multiprocessor implementations of the algorithms are looked at on the Cray XMP and on the MIT static data flow machine proposed by DENNIS.

Partridge, H.↗

Analysis of harmonic spline gravity models for Venus and Mars

Methodology utilizing harmonic splines for determining the true gravity field from Line-Of-Sight (LOS) acceleration data from planetary spacecraft missions was tested. As is well known, the LOS data incorporate errors in the zero reference level that appear to be inherent in the processing procedure used to obtain the LOS vectors. The proposed method offers a solution to this problem. The harmonic spline program was converted from the VAX 11/780 to the Ridge 32C computer. The problem with the matrix inversion routine that improved inversion of the data matrices used in the Optimum Estimate program for global Earth studies was solved. The problem of obtaining a successful matrix inversion for a single rev supplemented by data for the two adjacent revs still remains.

Bowin, Carl↗

Application of the p-version of the finite-element method to global-local problems

A brief survey is given of some recent developments in finite-element analysis technology which bear upon the three main research areas under consideration in this workshop: (1) analysis methods; (2) software testing and quality assurance; and (3) parallel processing. The variational principle incorporated in a finite-element computer program, together with a particular set of input data, determines the exact solution corresponding to that input data. Most finite-element analysis computer programs are based on the principle of virtual work. In the following, researchers consider only programs based on the principle of virtual work and denote the exact displacement vector field corresponding to some specific set of input data by vector u(EX). The exact solution vector u(EX) is independent of the design of the mesh or the choice of elements. Except for very simple problems, or specially constructed test problems, vector u(EX) is not known. Researchers perform a finite-element analysis (or any other numerical analysis) because they wish to make conclusions concerning the response of a physical system to certain imposed conditions, as if vector u(EX) were known.

Szabo, Barna A.↗

The F-18 High Alpha Research Vehicle: A High-Angle-of-Attack Testbed Aircraft

The F-18 High Alpha Research Vehicle is the first thrust-vectoring testbed aircraft used to study the aerodynamics and maneuvering available in the poststall flight regime and to provide the data for validating ground prediction techniques. The aircraft includes a flexible research flight control system and full research instrumentation. The capability to control the vehicle at angles of attack up to 70 degrees is also included. This aircraft was modified by adding a pitch and yaw thrust-vectoring system. No significant problems occurred during the envelope expansion phase of the program. This aircraft has demonstrated excellent control in the wing rock region and increased rolling performance at high angles of attack. Initial pilot reports indicate that the increased capability is desirable although some difficulty in judging the size and timing of control inputs was observed. The aircraft, preflight ground testing and envelope expansion flight tests are described.

Regenie, Victoria↗

The F-18 High Alpha Research Vehicle - A high-angle-of-attack testbed aircraft

The F-18 High Alpha Research Vehicle is the first thrust-vectoring testbed aircraft used to study the aerodynamics and maneuvering available in the poststall flight regime and to provide the data for validating ground prediction techniques. The aircraft includes a flexible research flight control system and full research instrumentation. The capability to control the vehicle at angles of attack up to 70 degrees is also included. This aircraft was modified by adding a pitch and yaw thrust-vectoring system. No significant problems occurred during the envelope expansion phase of the program.

Regenie, Victoria↗

Thrust Vectoring on the NASA F-18 High Alpha Research Vehicle

Investigations into a multiaxis thrust-vectoring system have been conducted on an F-18 configuration. These investigations include ground-based scale-model tests, ground-based full-scale testing, and flight testing. This thrust-vectoring system has been tested on the NASA F-18 High Alpha Research Vehicle (HARV). The system provides thrust vectoring in pitch and yaw axes. Ground-based subscale test data have been gathered as background to the flight phase of the program. Tests investigated aerodynamic interaction and vane control effectiveness. The ground-based full-scale data were gathered from static engine runs with image analysis to determine relative thrust-vectoring effectiveness. Flight tests have been conducted at the NASA Dryden Flight Research Center. Parameter identification input techniques have been developed. Individual vanes were not directly controlled because of a mixer-predictor function built into the flight control laws. Combined effects of the vanes have been measured in flight and compared to combined effects of the vanes as predicted by the cold-jet test data. Very good agreement has been found in the linearized effectiveness derivatives.

Bowers, Albion H.↗

Modeling material failure with a vectorized routine

The computational aspects of modelling material failure in structural wood members are presented with particular reference to vector processing aspects. Wood members are considered to be highly orthotropic, inhomogeneous, and discontinuous due to the complex microstructure of wood material and the presence of natural growth characteristics such as knots, cracks and cross grain in wood members. The simulation of strength behavior of wood members is accomplished through the use of a special purpose finite element/fracture mechanics routine, program STARW (Strength Analysis Routine for Wood). Program STARW employs quadratic finite elements combined with singular crack tip elements in a finite element mesh. Vector processing techniques are employed in mesh generation, stiffness matrix formation, simultaneous equation solution, and material failure calculations. The paper addresses these techniques along with the time and effort requirements needed to convert existing finite element code to a vectorized version. Comparisons in execution time between vectorized and nonvectorized routines are provided.

Cramer, S. M.↗

A VLBI variance-covariance analysis interactive computer program

An interactive computer program (in FORTRAN) for the variance covariance analysis of VLBI experiments is presented for use in experiment planning, simulation studies and optimal design problems. The interactive mode is especially suited to these types of analyses providing ease of operation as well as savings in time and cost. The geodetic parameters include baseline vector parameters and variations in polar motion and Earth rotation. A discussion of the theroy on which the program is based provides an overview of the VLBI process emphasizing the areas of interest to geodesy. Special emphasis is placed on the problem of determining correlations between simultaneous observations from a network of stations. A model suitable for covariance analyses is presented. Suggestions towards developing optimal observation schedules are included.

Bock, Y.↗

Bifurcations and sensitivity in parametric nonlinear programming

The parametric nonlinear programming problem is that of determining the behavior of solution(s) as a parameter or vector of parameters alpha belonging to R(sup r) varies over a region of interest for the problem: Minimize over x the set f(x, alpha):h(x, alpha) = 0, g(x, alpha) is greater than or equal to 0, where f:R(sup (n+r)) approaches R, h:R(sup (n+r)) approaches R(sup q) and g:R(sup (n+r)) approaches R(sup p) are assumed to be at least twice continuously differentiable. Some of these parameters may be fixed but not known precisely and others may be varied to enhance the performance of the system. In both cases a fundamentally important problem in the investigation of global sensitivity of the system is to determine the stability boundaries of the regions in parameter space which define regions of qualitatively similar solutions. The objective is to explain how numerical continuation and bifurcation techniques can be used to investigate the parametric nonlinear programming problem in a global sense. Thus, first the problem is converted to a closed system of parameterized nonlinear equations whose solution set contains all local minimizers of the original problem. This system, which will be represented as F(z,alpha) = O, will include all Karush-Kuhn-Tucker and Fritz John points, both feasible and infeasible solutions, and relative minima, maxima, and saddle points of the problem. The local existence and uniqueness of a solution path (z(alpha), alpha) of this system as well as the solution type persist as long as a singularity in the Jacobian D(sub z)F(z,alpha) is not encountered. Thus the nonsingularity of this Jacobian is characterized in terms of conditions on the problem itself. Then, a class of efficient predictor-corrector continuation procedures for tracing solution paths of the system F(z,alpha) = O which are tailored specifically to the parametric programming problem are described. Finally, these procedures and the obtained information are illustrated within the context of design optimization.

Lundberg, Bruce N.↗

Wind loads for bar-truss structures

An analysis method developed to calculate the wind loads on the nodes or joints of the truss type support structure of the 64 meter antenna is described. The method uses the CBAR element and GRID coordinate cards of the NASTRAN or IDEAS structural analysis programs as inputs to the computer model of the structure. Cross flow principles and vector analysis are also used in the analysis. The algorithms used are described and probable accuracy of the solution is discussed.

Katow, M. S.↗