Search NASA⌕ Search

SEARCH · Search NASA

Results for “VECTOR”

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 379 records · Page 21

Development of computer program NAS3D using Vector processing for geometric nonlinear analysis of structures

An algorithm for vectorized computation of stiffness matrices of an 8 noded isoparametric hexahedron element for geometric nonlinear analysis was developed. This was used in conjunction with the earlier 2-D program GAMNAS to develop the new program NAS3D for geometric nonlinear analysis. A conventional, modified Newton-Raphson process is used for the nonlinear analysis. New schemes for the computation of stiffness and strain energy release rates is presented. The organization the program is explained and some results on four sample problems are given. The study of CPU times showed that savings by a factor of 11 to 13 were achieved when vectorized computation was used for the stiffness instead of the conventional scalar one. Finally, the scheme of inputting data is explained.

Mangalgiri, P. D.↗

User's guide for NASCRIN: A vectorized code for calculating two-dimensional supersonic internal flow fields

A computer program NASCRIN has been developed for analyzing two-dimensional flow fields in high-speed inlets. It solves the two-dimensional Euler or Navier-Stokes equations in conservation form by an explicit, two-step finite-difference method. An explicit-implicit method can also be used at the user's discretion for viscous flow calculations. For turbulent flow, an algebraic, two-layer eddy-viscosity model is used. The code is operational on the CDC CYBER 203 computer system and is highly vectorized to take full advantage of the vector-processing capability of the system. It is highly user oriented and is structured in such a way that for most supersonic flow problems, the user has to make only a few changes. Although the code is primarily written for supersonic internal flow, it can be used with suitable changes in the boundary conditions for a variety of other problems.

Kumar, A.↗

The design and implementation of cost-effective algorithms for direct solution of banded linear systems on the vector processor system 32 supercomputer

The problem of solving banded linear systems by direct (non-iterative) techniques on the Vector Processor System (VPS) 32 supercomputer is considered. Two efficient direct methods for solving banded linear systems on the VPS 32 are described. The vector cyclic reduction (VCR) algorithm is discussed in detail. The performance of the VCR on a three parameter model problem is also illustrated. The VCR is an adaptation of the conventional point cyclic reduction algorithm. The second direct method is the Customized Reduction of Augmented Triangles' (CRAT). CRAT has the dominant characteristics of an efficient VPS 32 algorithm. CRAT is tailored to the pipeline architecture of the VPS 32 and as a consequence the algorithm is implicitly vectorizable.

Samba, A. S.↗

Multi-color incomplete Cholesky conjugate gradient methods for vector computers

In this research, we are concerned with the solution on vector computers of linear systems of equations, Ax = b, where A is a larger, sparse symmetric positive definite matrix. We solve the system using an iterative method, the incomplete Cholesky conjugate gradient method (ICCG). We apply a multi-color strategy to obtain p-color matrices for which a block-oriented ICCG method is implemented on the CYBER 205. (A p-colored matrix is a matrix which can be partitioned into a pXp block matrix where the diagonal blocks are diagonal matrices). This algorithm, which is based on a no-fill strategy, achieves O(N/p) length vector operations in both the decomposition of A and in the forward and back solves necessary at each iteration of the method. We discuss the natural ordering of the unknowns as an ordering that minimizes the number of diagonals in the matrix and define multi-color orderings in terms of disjoint sets of the unknowns. We give necessary and sufficient conditions to determine which multi-color orderings of the unknowns correpond to p-color matrices. A performance model is given which is used both to predict execution time for ICCG methods and also to compare an ICCG method to conjugate gradient without preconditioning or another ICCG method. Results are given from runs on the CYBER 205 at NASA's Langley Research Center for four model problems.

Poole, E. L.↗

Vector representation of trade cumulus thermodynamic fluxes

A tephigram of BOMEX averaged thermodynamic flux vectors, developed from two tradewind budgets, is presented. The parametric model, which is utilized to represent the fluxes in the tradewind layer of the product as a mass flux and a cloud-environment difference, is examined. A table of mean structure and fluxes of a dataset for the BOMEX ship array, and the Bowen ratio and convective mass flux for a nonmixing and a cloud-top mixing model is provided. The fluxes which are displayed in a simple vector format, using the saturation point notation of Betts (1982) reveal a coupling of fluxes and the relationship between Bowen ratio and height. It is concluded that with good tradewind budget data about the statistics of cloud mixing and radiative-convective coupling can be expressed.

Betts, A. K.↗

Numerical solution of 2-D thrust reversing and thrust vectoring nozzle

The flowfield within and around two dimensional thrust reversing and thrust vectoring nozzles has been calculated using a new unfactored implicit method with a multiple zone grid. Computations are done for fully deployed thrust reversing nozzles, partially deployed thrust reversing nozzles with thrust vectoring, and a nozzle transitioning from partially to fully deployed. Agreement with available experimental data is good.

Imlay, S.↗

The effect of the arbitrary level assignment of satellite cloud motion wind vectors on wind analyses in the pre-thunderstorm environment

The impact of satellite-derived cloud motion vectors on SESAME rawinsonde wind fields was studied in two separate cases. The effect of wind and moisture gradients on the arbitrary assignment of the satellite data is assessed to coordinate surfaces in a severe storm environment marked by strong vertical wind shear. Objective analyses of SESAME rawinsonde winds and combined winds are produced and differences between these two analyzed fields are used to make an assessment of coordinate level choice. It is shown that the standard method of arbitrarily assigning wind vectors to a low level coordinate surface yields systematic differences between the rawinsonde and combined wind analyses. Arbitrary assignment of cloud motions to the 0.9 sigma surface produces smaller differences than assignment to the 825 mb pressure surface. Systematic differences occur near moisture discontinuities and in regions of horizontal and vertical wind shears. The differences between the combined and SESAME wind fields are made smallest by vertically interpolating cloud motions to either a pressure or sigma surface.

Peslen, C. A.↗

Thrust vectoring for single-stage-to-orbit, horizontal takeoff, horizontal landing, space vehicles

The preliminary design of a horizontal takeoff, horizontal landing, single-stage-to-orbit, rocket-powered space vehicle was performed. The purpose was to examine technology requirements for future small payload launch vehicles. The distinguishing aspect of the design was the utilization of thrust vectoring to provide half of the lift at takeoff. The inclusion of a canard was necessary to provide additional lift at takeoff and to balance the moments produced with thrust vectoring. A weights estimation, an aerodynamic assessment, a trajectory analysis, and a gear weight analysis were performed. The takeoff weight of the resulting vehicle was approximately 1.26 million pounds, based on advanced technology structures and subsystems. The vehicle was designed to deliver a 5000-pound payload to a polar orbit.

Cunningham, M. J.↗

Acceleration of convergence of vector sequences

A general approach to the construction of convergence acceleration methods for vector sequence is proposed. Using this approach, one can generate some known methods, such as the minimal polynomial extrapolation, the reduced rank extrapolation, and the topological epsilon algorithm, and also some new ones. Some of the new methods are easier to implement than the known methods and are observed to have similar numerical properties. The convergence analysis of these new methods is carried out, and it is shown that they are especially suitable for accelerating the convergence of vector sequences that are obtained when one solves linear systems of equations iterative. A stability analysis is also given, and numerical examples are provided. The convergence and stability properties of the topological epsilon algorithm are likewise given.

Sidi, A.↗

Static internal performance of single-expansion-ramp nozzles with thrust-vectoring capability up to 60 deg

An investigation has been conducted at static conditions (wind off) in the static-test facility of the Langley 16-Foot Transonic Tunnel. The effects of geometric thrust-vector angle, sidewall containment, ramp curvature, lower-flap lip angle, and ramp length on the internal performance of nonaxisymmetric single-expansion-ramp nozzles were investigated. Geometric thrust-vector angle was varied from -20 deg. to 60 deg., and nozzle pressure ratio was varied from 1.0 (jet off) to approximately 10.0.

Berrier, B. L.↗

Preloadable vector sensitive latch

A preloadable vector-sensitive latch which automatically releases when the force vector from a latch memebr reaches a specified release angle is presented. In addition, it contains means to remove clearance between the latched members and to preload the latch to prevent separation at angles less than the specified release angle. The latch comprises a triangular main link, a free link connected between a first corner of the main link and a yoke member, a housing, and an actuator connected between the yoke member and the housing. A return spring bias means connects the main link to a portion of the housing. A second corner of the main link is slidably and pivotally connected to the housing via a slot in a web portion of the housing. The latch housing has a rigid docking ring alignable with a mating locking ring which is engageable by a locking roller journalled on the third corner of the triangular main link.

Acres, William R.↗

Bubble vector in automatic merging

It is shown that it is within the capability of the DMAP language to build a set of vectors that can grow incrementally to be applied automatically and economically within a DMAP loop that serves to append sub-matrices that are generated within a loop to a core matrix. The method of constructing such vectors is explained.

Pamidi, P. R.↗

The preloadable vector sensitive latch for orbital docking/berthing

The workings and function of the Preloader Vector Sensitive Latch are described. A discussion of docking systems used in the U.S. manned space flight programs is included to show how docking systems have evolved, and to highlight the potential advantages of a preloadable vector sensitive latch in such systems.

Acres, William R.↗

Vector computer memory bank contention

A number of vector supercomputers feature very large memories. Unfortunately the large capacity memory chips that are used in these computers are much slower than the fast central processing unit (CPU) circuitry. As a result, memory bank reservation times (in CPU ticks) are much longer than on previous generations of computers. A consequence of these long reservation times is that memory bank contention is sharply increased, resulting in significantly lowered performance rates. The phenomenon of memory bank contention in vector computers is analyzed using both a Markov chain model and a Monte Carlo simulation program. The results of this analysis indicate that future generations of supercomputers must either employ much faster memory chips or else feature very large numbers of independent memory banks.

Bailey, David H.↗

Vector constraints on western U.S. deformation from space geodesy, neotectonics, and plate motions

The rate-of-slip vector on the San Andreas fault in central California estimated from geodetic and Holocene geological data is inconsistent with the prediction of rigid plate models such as RM2. This well-known 'San Andreas discrepancy' is diagnostic of plate deformation distributed both east of the fault in the Basin and Range and west of the fault along the California continental margin. Constraints on the integrated deformation rates across these two regions consistent with: (1) the kinematical boundary conditions imposed by the rigid plate model; (2) neotectonic and paleoseismic estimates of deformation rates; (3) ground-based geodetic measurements; and (4) rates of change observed by very long baseline interferometry along seven baselines to western U.S. sites are constructed. The space-geodetic data on Basin and Range extension taken over a 4-year interval are compatible with geological observations averaged over the Holocene; the best estimate of its integrated deformation rate, provided by the joint inversion of both data types, is 9.7 + or - 2.1 mm/yr, N 56 deg W + or - 10 deg, too small and in the wrong direction to account entirely for the San Andreas discrepancy. The integral of this deformation, estimated by subtracting the Basin and Range contribution from the discrepancy vector, requires significant right-lateral shear parallel to the San Andreas (13 + or - 5 mm/yr) and some compression perpendicular to it (9 + or - 3 mm/yr).

Minster, J. Bernard↗

A vectorized Poisson solver over a spherical shell and its application to the quasi-geostrophic omega-equation

The quasi-geostrophic omega-equation in flux form is developed as an example of a Poisson problem over a spherical shell. Solutions of this equation are obtained by applying a two-parameter Chebyshev solver in vector layout for CDC 200 series computers. The performance of this vectorized algorithm greatly exceeds the performance of its scalar analog. The algorithm generates solutions of the omega-equation which are compared with the omega fields calculated with the aid of the mass continuity equation.

Mullenmeister, Paul↗

Convergence acceleration for vector sequences and applications to computational fluid dynamics

Some recent developments in acceleration of convergence methods for vector sequences are reviewed. The methods considered are the minimal polynomial extrapolation, the reduced rank extrapolation, and the modified minimal polynomial extrapolation. The vector sequences to be accelerated are those that are obtained from the iterative solution of linear or nonlinear systems of equations. The convergence and stability properties of these methods as well as different ways of numerical implementation are discussed in detail. Based on the convergence and stability results, strategies that are useful in practical applications are suggested. Two applications to computational fluid mechanics involving the three dimensional Euler equations for ducted and external flows are considered. The numerical results demonstrate the usefulness of the methods in accelerating the convergence of the time marching techniques in the solution of steady state problems.

Sidi, Avram↗

A sparse matrix algorithm on the Boolean vector machine

VLSI technology is being used to implement a prototype Boolean Vector Machine (BVM), which is a large network of very small processors with equally small memories that operate in SIMD mode; these use bit-serial arithmetic, and communicate via cube-connected cycles network. The BVM's bit-serial arithmetic and the small memories of individual processors are noted to compromise the system's effectiveness in large numerical problem applications. Attention is presently given to the implementation of a basic matrix-vector iteration algorithm for space matrices of the BVM, in order to generate over 1 billion useful floating-point operations/sec for this iteration algorithm. The algorithm is expressed in a novel language designated 'BVM'.

Wagner, Robert A.↗