Engineering Papers⌕ Search

SEARCH · Engineering Papers

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 847 records · Page 47

Electromechanical actuation for thrust vector control applications

The advanced launch system (ALS), is a launch vehicle that is designed to be cost-effective, highly reliable, and operationally efficient with a goal of reducing the cost per pound to orbit. An electromechanical actuation (EMA) system is being developed as an attractive alternative to the hydraulic systems. The controller will integrate 20 kHz resonant link power management and distribution (PMAD) technology and pulse population modulation (PPM) techniques to implement field-oriented vector control (FOVC) of a new advanced induction motor. The driver and the FOVC will be microprocessor controlled. For increased system reliability, a built-in test (BITE) capability will be included. This involves introducing testability into the design of a system such that testing is calibrated and exercised during the design, manufacturing, maintenance, and prelaunch activities. An actuator will be integrated with the motor controller for performance testing of the EMA thrust vector control (TVC) system. The EMA system and work proposed for the future are discussed.

Roth, Mary Ellen↗

Vectorization of a particle code used in the simulation of rarefied hypersonic flow

A limitation of the direct simulation Monte Carlo (DSMC) method is that it does not allow efficient use of vector architectures that predominate in current supercomputers. Consequently, the problems that can be handled are limited to those of one- and two-dimensional flows. This work focuses on a reformulation of the DSMC method with the objective of designing a procedure that is optimized to the vector architectures found on machines such as the Cray-2. In addition, it focuses on finding a better balance between algorithmic complexity and the total number of particles employed in a simulation so that the overall performance of a particle simulation scheme can be greatly improved. Simulations of the flow about a 3D blunt body are performed with 10 to the 7th particles and 4 x 10 to the 5th mesh cells. Good statistics are obtained with time averaging over 800 time steps using 4.5 h of Cray-2 single-processor CPU time.

Baganoff, D.↗

Gain in computational efficiency by vectorization in the dynamic simulation of multi-body systems

An improved technique for the identification and extraction of the exact quantities associated with the degrees of freedom at the element as well as the flexible body level is presented. It is implemented in the dynamic equations of motions based on the recursive formulation of Kane et al. (1987) and presented in a matrix form, integrating the concepts of strain energy, the finite-element approach, modal analysis, and reduction of equations. This technique eliminates the CPU intensive matrix multiplication operations in the code's hot spots for the dynamic simulation of the interconnected rigid and flexible bodies. A study of a simple robot with flexible links is presented by comparing the execution times on a scalar machine and a vector-processor with and without vector options. Performance figures demonstrating the substantial gains achieved by the technique are plotted.

Amirouche, F. M. L.↗

More About Vector Adaptive/Predictive Coding Of Speech

Report presents additional information about digital speech-encoding and -decoding system described in "Vector Adaptive/Predictive Encoding of Speech" (NPO-17230). Summarizes development of vector adaptive/predictive coding (VAPC) system and describes basic functions of algorithm. Describes refinements introduced enabling receiver to cope with errors. VAPC algorithm implemented in integrated-circuit coding/decoding processors (codecs). VAPC and other codecs tested under variety of operating conditions. Tests designed to reveal effects of various background quiet and noisy environments and of poor telephone equipment. VAPC found competitive with and, in some respects, superior to other 4.8-kb/s codecs and other codecs of similar complexity.

Jedrey, Thomas C.↗

Analysis of superconducting electromagnetic finite elements based on a magnetic vector potential variational principle

Electromagnetic finite elements are extended based on a variational principle that uses the electromagnetic four potential as primary variable. The variational principle is extended to include the ability to predict a nonlinear current distribution within a conductor. The extension of this theory is first done on a normal conductor and tested on two different problems. In both problems, the geometry remains the same, but the material properties are different. The geometry is that of a 1-D infinite wire. The first problem is merely a linear control case used to validate the new theory. The second problem is made up of linear conductors with varying conductivities. Both problems perform well and predict current densities that are accurate to within a few ten thousandths of a percent of the exact values. The fourth potential is then removed, leaving only the magnetic vector potential, and the variational principle is further extended to predict magnetic potentials, magnetic fields, the number of charge carriers, and the current densities within a superconductor. The new element produces good results for the mean magnetic field, the vector potential, and the number of superconducting charge carriers despite a relatively high system condition number. The element did not perform well in predicting the current density. Numerical problems inherent to this formulation are explored and possible remedies to produce better current predicting finite elements are presented.

Schuler, James J.↗

Application of vector-valued rational approximations to the matrix eigenvalue problem and connections with Krylov subspace methods

Let F(z) be a vectored-valued function F: C approaches C sup N, which is analytic at z=0 and meromorphic in a neighborhood of z=0, and let its Maclaurin series be given. We use vector-valued rational approximation procedures for F(z) that are based on its Maclaurin series in conjunction with power iterations to develop bona fide generalizations of the power method for an arbitrary N X N matrix that may be diagonalizable or not. These generalizations can be used to obtain simultaneously several of the largest distinct eigenvalues and the corresponding invariant subspaces, and present a detailed convergence theory for them. In addition, it is shown that the generalized power methods of this work are equivalent to some Krylov subspace methods, among them the methods of Arnoldi and Lanczos. Thus, the theory provides a set of completely new results and constructions for these Krylov subspace methods. This theory suggests at the same time a new mode of usage for these Krylov subspace methods that were observed to possess computational advantages over their common mode of usage.

Sidi, Avram↗

Upper bounds for convergence rates of vector extrapolation methods on linear systems with initial iterations

The application of the minimal polynomial extrapolation (MPE) and the reduced rank extrapolation (RRE) to a vector sequence obtained by the linear iterative technique x(sub j) + 1 = Ax(sub j) = b,j = 1,2,..., is considered. Both methods produce a two dimensional array of approximations s(sub n,k) to the solution of the system (I - A)x = b. Here, s(sub n,k) is obtained from the vectors x(sub j), n is less than or equal to j is less than or equal to n + k + 1. It was observed in an earlier publication by the first author that the sequence s(sub n,k), k = 1,2,..., for n greater than 0, but fixed, possesses better convergence properties than the sequence s(sub 0,k), k = 1,2,.... A detailed theoretical explanation for this phenomenon is provided in the present work. This explanation is heavily based on approximations by incomplete polynomials. It is demonstrated by numerical examples when the matrix A is sparse that cycling with s(sub n,k) for n greater than 0, but fixed, produces better convergence rates and costs less computationally than cycling with s(sub 0,k). It is also illustrated numerically with a convection-diffusion problem that the former may produce excellent results where the latter may fail completely. As has been shown in an earlier publication, the results produced by s(sub 0,k) are identical to the corresponding results obtained by applying the Arnoldi method or generalized minimal residual scheme (GMRES) to the system (I - A)x = b.

Sidi, Avram↗

Vector-averaged gravity alters myocyte and neuron properties in cell culture

The effect of changes in the gravitational field of developing neurons and myocytes on the development of these cells was investigated using observations of rotated cultures of embryonic spinal neurons and myocytes in a horizontal clinostat, in which rotation produces, from the cells' perspective, a 'vector-free' gravity environment by continous averaging of the vector, thus simulating the microgravity of space. It was found that, at rotation rates between 1 and 50 rpm, cellular and nuclear areas of myocytes become significantly enlarged and the number of presumptive nucleoli increase; in neurons, frequent and large swellings appeared along neuritic shafts. Some of these changes were reversible after the cessation of rotation.

Gruener, Raphael↗

A combined vector potential-scalar potential method for FE computation of 3D magnetic fields in electrical devices with iron cores

A method of combined use of magnetic vector potential based finite-element (FE) formulations and magnetic scalar potential (MSP) based formulations for computation of three-dimensional magnetostatic fields is introduced. In this method, the curl-component of the magnetic field intensity is computed by a reduced magnetic vector potential. This field intensity forms the basic of a forcing function for a global magnetic scalar potential solution over the entire volume of the region. This method allows one to include iron portions sandwiched in between conductors within partitioned current-carrying subregions. The method is most suited for large-scale global-type 3-D magnetostatic field computations in electrical devices, and in particular rotating electric machinery.

Wang, R.↗

Evolution of vector magnetic fields and the August 27 1990 X-3 flare

Vector magnetic fields in an active region of the sun are studied by means of continuous observations of magnetic-field evolution emphasizing magnetic shear build-up. The vector magnetograms are shown to measure magnetic fields correctly based on concurrent observations and a comparison of the transverse field with the H alpha fibril structure. The morphology and velocity pattern are examined, and these data and the shear build-up suggest that the active region's two major footprints are separated by a region with flows, new flux emergence, and several neutral lines. The magnetic shear appears to be caused by the collision and shear motion of two poles of opposite polarities. The transverse field is shown to turn from potential to sheared during the process of flux cancellation, and this effect can be incorporated into existing models of magnetic flux cancellation.

Wang, Haimin↗

Vector Quantization With Emergent Codebook Structure

Proposed scheme under development for transmission of vector-quantized digital video images, vector quantizer codebook updated to adapt quantizer to changing signal statistics. Intended to be realized with electronic neural network. Codebook, which consists of patterns constituting video images, will undergo training during operation and scheme will develop codebooks ordered during training. System enables coding more compact, more immune to noise, and supports variable rate compression.

Ahalt, Stanley C.↗

Parallel-vector unsymmetric Eigen-Solver on high performance computers

The popular QR algorithm for solving all eigenvalues of an unsymmetric matrix is reviewed. Among the basic components in the QR algorithm, it was concluded from this study, that the reduction of an unsymmetric matrix to a Hessenberg form (before applying the QR algorithm itself) can be done effectively by exploiting the vector speed and multiple processors offered by modern high-performance computers. Numerical examples of several test cases have indicated that the proposed parallel-vector algorithm for converting a given unsymmetric matrix to a Hessenberg form offers computational advantages over the existing algorithm. The time saving obtained by the proposed methods is increased as the problem size increased.

Nguyen, Duc T.↗

Improved determination of vector lithospheric magnetic anomalies from MAGSAT data

Scientific contributions made in developing new methods to isolate and map vector magnetic anomalies from measurements made by Magsat are described. In addition to the objective of the proposal, the isolation and mapping of equatorial vector lithospheric Magsat anomalies, isolation of polar ionospheric fields during the period were also studied. Significant progress was also made in isolation of polar delta(Z) component and scalar anomalies as well as integration and synthesis of various techniques of removing equatorial and polar ionospheric effects. The significant contributions of this research are: (1) development of empirical/analytical techniques in modeling ionospheric fields in Magsat data and their removal from uncorrected anomalies to obtain better estimates of lithospheric anomalies (this task was accomplished for equatorial delta(X), delta(Z), and delta(B) component and polar delta(Z) and delta(B) component measurements; (2) integration of important processing techniques developed during the last decade with the newly developed technologies of ionospheric field modeling into an optimum processing scheme; and (3) implementation of the above processing scheme to map the most robust magnetic anomalies of the lithosphere (components as well as scalar).

Ravat, Dhananjay↗

Matrix-vector multiplication using digital partitioning for more accurate optical computing

Digital partitioning offers a flexible means of increasing the accuracy of an optical matrix-vector processor. This algorithm can be implemented with the same architecture required for a purely analog processor, which gives optical matrix-vector processors the ability to perform high-accuracy calculations at speeds comparable with or greater than electronic computers as well as the ability to perform analog operations at a much greater speed. Digital partitioning is compared with digital multiplication by analog convolution, residue number systems, and redundant number representation in terms of the size and the speed required for an equivalent throughput as well as in terms of the hardware requirements. Digital partitioning and digital multiplication by analog convolution are found to be the most efficient alogrithms if coding time and hardware are considered, and the architecture for digital partitioning permits the use of analog computations to provide the greatest throughput for a single processor.

Gary, C. K.↗

On the electromagnetic fields, Poynting vector, and peak power radiated by lightning return strokes

The initial radiation fields, Poynting vector, and total electromagnetic power that a vertical return stroke radiates into the upper half space have been computed when the speed of the stroke, nu, is a significant fraction of the speed of light, c, assuming that at large distances and early times the source is an infinitesimal dipole. The initial current is also assumed to satisfy the transmission-line model with a constant nu and to be perpendicular to an infinite, perfectly conducting ground. The effect of a large nu is to increase the radiation fields by a factor of (1-beta-sq cos-sq theta) exp -1, where beta = nu/c and theta is measured from the vertical, and the Poynting vector by a factor of (1-beta-sq cos-sq theta) exp -2.

Krider, E. P.↗

Joint vector magnetograph observations at BBSO, Huairou Station and Mees Solar Observatory

Joint vector magnetograph observations were carried out at Big Bear Solar Observatory (BBSO), Huairou Solar Observing Station (Huairou), and Mees Solar Observatory (MSO) in late September 1989. Comparisons of vector magnetograms obtained at the three stations show a high degree of consistency in the morphology of both longitudinal and transverse fields. Quantitative comparisons show the presence of noise, cross-talk between longitudinal field and transverse field, Faraday rotation and signal saturation effects in the magnetograms. We have tried to establish how the scatter in measurements from different instruments is apportioned between these sources of error.

Wang, Haimin↗

Parallel-vector design sensitivity analysis in structural dynamics

This paper presents a parallel-vector algorithm for sensitivity calculations in linear structural dynamics. The proposed alternative formulation works efficiently with the reduced system of dynamic equations, since it eliminates the need for expensive and complicated based-vector derivatives, which are required in the conventional reduced system formulation. The relationship between the alternative formulation and the conventional reduced system formulation has been established, and it has been proven analytically that the two approaches are identical when all the mode shapes are included. This paper validates the proposed alternative algorithm through numerical experiments, where only a small number of mode shapes are used. In addition, a modified mode acceleration method is presented, thus not only the displacements but also the velocities and accelerations are shown to be improved.

Zhang, Y.↗

Time-variant analysis of rotorcraft systems dynamics - An exploitation of vector processors

In this paper a generalized algorithmic procedure is presented for handling constraints in mechanical transmissions. The latter are treated as multibody systems of interconnected rigid/flexible bodies. The constraint Jacobian matrices are generated automatically and suitably updated in time, depending on the geometrical and kinematical constraint conditions describing the interconnection between shafts or gears. The type of constraints are classified based on the interconnection of the bodies by assuming that one or more points of contact exist between them. The effects due to elastic deformation of the flexible bodies are included by allowing each body element to undergo small deformations. The procedure is based on recursively formulated Kane's dynamical equations of motion and the finite element method, including the concept of geometrical stiffening effects. The method is implemented on an IBM-3090-600j vector processor with pipe-lining capabilities. A significant increase in the speed of execution is achieved by vectorizing the developed code in computationally intensive areas. An example consisting of two meshing disks rotating at high angular velocity is presented. Applications are intended for the study of the dynamic behavior of helicopter transmissions.

Amirouche, F. M. L.↗