SEARCH · Engineering Papers

Results for “vectorization”

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.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 1,387 records · Page 77

All sources NASA NTRS DOE OSTI

NASA NTRS1981

Structure of correlation tensors in homogeneous anisotropic turbulence

The theory of isotropic tensors, developed by Robertson (1940), Batchelor (1946), and Chandrasekhar (1951), is extended to cover the general case of turbulence with a pseudo-vector-preferred direction, without assuming mirror-reflection invariance. Attention is focused on two-point-correlation functions, and it is shown that the form of the decomposition into proper and pseudo-tensor contributions is restricted by the homogeneity requirement. The somewhat unexpected result that the vector- and pseudo-vector-preferred-direction cases yield different results is presented: A pseudo-vector-preferred direction allows the correlation matrix one more functional degree of freedom than does the proper vector case. An explicit form of the two-point-correlation tensor in the presence of a uniform mean magnetic field is presented which may be appropriate for use in analysis of magnetic fluctuations in plasma containment devices or the interplanetary medium. A procedure for determining the magnetic helicity from experimental data is presented.

Matthaeus, W. H.↗

NASA NTRS1981

The reduction, verification and interpretation of MAGSAT magnetic data over Canada

Analysis of Investigator B tapes was extended to use a statistical screening of individual data points in each grid cell over the map area. The mean value of data from each cell was computed and all data values more than 4nT from the mean were rejected. The revised mean and standard deviation was computed. The average standard deviation for all map grid cells was 1.4nT for the scalar anomaly map and about 2nT for the vector component anomaly maps. At this stage, the grid cell is larger and spatial resolution lower for the vector maps than for the scalar maps, because the vector components are considerably more disturbed and more data points were rejected. An approach for altitude adjustment is in progress so that corrections can be made and data reduction procede. To evaluate the use of scalar and vector MAGSAT data for the production of regional magnetic charts, charts of the north, east, vertical, and scalar field derived from MAGSAT and from Canadian aeromagnetic data were compared. It appears possible to retrieve crustal signals from the horizontal vector components despite external disturbance fields at high latitude.

Coles, R. L.↗

NASA NTRS1982

Design of analytical failure detection using secondary observers

The problem of designing analytical failure-detection systems (FDS) for sensors and actuators, using observers, is addressed. The use of observers in FDS is related to the examination of the n-dimensional observer error vector which carries the necessary information on possible failures. The problem is that in practical systems, in which only some of the components of the state vector are measured, one has access only to the m-dimensional observer-output error vector, with m or = to n. In order to cope with these cases, a secondary observer is synthesized to reconstruct the entire observer-error vector from the observer output error vector. This approach leads toward the design of highly sensitive and reliable FDS, with the possibility of obtaining a unique fingerprint for every possible failure. In order to keep the observer's (or Kalman filter) false-alarm rate under a certain specified value, it is necessary to have an acceptable matching between the observer (or Kalman filter) models and the system parameters. A previously developed adaptive observer algorithm is used to maintain the desired system-observer model matching, despite initial mismatching or system parameter variations. Conditions for convergence for the adaptive process are obtained, leading to a simple adaptive law (algorithm) with the possibility of an a priori choice of fixed adaptive gains. Simulation results show good tracking performance with small observer output errors, while accurate and fast parameter identification, in both deterministic and stochastic cases, is obtained.

Sisar, M.↗

NASA NTRS1986

Supercomputer implementation of finite element algorithms for high speed compressible flows

Prediction of compressible flow phenomena using the finite element method is of recent origin and considerable interest. Two shock capturing finite element formulations for high speed compressible flows are described. A Taylor-Galerkin formulation uses a Taylor series expansion in time coupled with a Galerkin weighted residual statement. The Taylor-Galerkin algorithms use explicit artificial dissipation, and the performance of three dissipation models are compared. A Petrov-Galerkin algorithm has as its basis the concepts of streamline upwinding. Vectorization strategies are developed to implement the finite element formulations on the NASA Langley VPS-32. The vectorization scheme results in finite element programs that use vectors of length of the order of the number of nodes or elements. The use of the vectorization procedure speeds up processing rates by over two orders of magnitude. The Taylor-Galerkin and Petrov-Galerkin algorithms are evaluated for 2D inviscid flows on criteria such as solution accuracy, shock resolution, computational speed and storage requirements. The convergence rates for both algorithms are enhanced by local time-stepping schemes. Extension of the vectorization procedure for predicting 2D viscous and 3D inviscid flows are demonstrated. Conclusions are drawn regarding the applicability of the finite element procedures for realistic problems that require hundreds of thousands of nodes.

Thornton, E. A.↗

NASA NTRS1989

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.↗

NASA NTRS1989

Autonomous frequency domain identification: Theory and experiment

The analysis, design, and on-orbit tuning of robust controllers require more information about the plant than simply a nominal estimate of the plant transfer function. Information is also required concerning the uncertainty in the nominal estimate, or more generally, the identification of a model set within which the true plant is known to lie. The identification methodology that was developed and experimentally demonstrated makes use of a simple but useful characterization of the model uncertainty based on the output error. This is a characterization of the additive uncertainty in the plant model, which has found considerable use in many robust control analysis and synthesis techniques. The identification process is initiated by a stochastic input u which is applied to the plant p giving rise to the output. Spectral estimation (h = P sub uy/P sub uu) is used as an estimate of p and the model order is estimated using the produce moment matrix (PMM) method. A parametric model unit direction vector p is then determined by curve fitting the spectral estimate to a rational transfer function. The additive uncertainty delta sub m = p - unit direction vector p is then estimated by the cross spectral estimate delta = P sub ue/P sub uu where e = y - unit direction vectory y is the output error, and unit direction vector y = unit direction vector pu is the computed output of the parametric model subjected to the actual input u. The experimental results demonstrate the curve fitting algorithm produces the reduced-order plant model which minimizes the additive uncertainty. The nominal transfer function estimate unit direction vector p and the estimate delta of the additive uncertainty delta sub m are subsequently available to be used for optimization of robust controller performance and stability.

Yam, Yeung↗

NASA NTRS1990

Piezoelectrically forced vibrations of electroded doubly rotated quartz plates by state space method

The purpose of this investigation is to develop an analytical method to study the vibration characteristics of piezoelectrically forced quartz plates. The procedure can be summarized as follows. The three dimensional governing equations of piezoelectricity, the constitutive equations and the strain-displacement relationships are used in deriving the final equations. For this purpose, a state vector consisting of stresses and displacements are chosen and the above equations are manipulated to obtain the projection of the derivative of the state vector with respect to the thickness coordinate on to the state vector itself. The solution to the state vector at any plane is then easily obtained in a closed form in terms of the state vector quantities at a reference plane. To simplify the analysis, simple thickness mode and plane strain approximations are used.

Chander, R.↗

NASA NTRS1989

Selection of optimum median-filter-based ambiguity removal algorithm parameters for NSCAT

The NASA Scatterometer, NSCAT, is an active spaceborne radar designed to measure the normalized radar backscatter coefficient (sigma0) of the ocean surface. These measurements can, in turn, be used to infer the surface vector wind over the ocean using a geophysical model function. Several ambiguous wind vectors result because of the nature of the model function. A median-filter-based ambiguity removal algorithm will be used by the NSCAT ground data processor to select the best wind vector from the set of ambiguous wind vectors. This process is commonly known as dealiasing or ambiguity removal. The baseline NSCAT ambiguity removal algorithm and the method used to select the set of optimum parameter values are described. An extensive simulation of the NSCAT instrument and ground data processor provides a means of testing the resulting tuned algorithm. This simulation generates the ambiguous wind-field vectors expected from the instrument as it orbits over a set of realistic meoscale wind fields. The ambiguous wind field is then dealiased using the median-based ambiguity removal algorithm. Performance is measured by comparison of the unambiguous wind fields with the true wind fields. Results have shown that the median-filter-based ambiguity removal algorithm satisfies NSCAT mission requirements.

Shaffer, Scott↗

NASA NTRS1991

Generalized covariance analysis for partially autonomous deep space missions

A new covariance analysis method is presented that is suitable for the evaluation of multiple impulsive controllers acting on some stochastic process x. The method accommodates batch and sequential estimators with equal ease and accounts for time-delay effects in a natural manner. The formalism is developed in terms of a generalized state vector that is formed from the system state vector x, augmented by various fixed epoch estimates, and a data vector formed from discrete time observations of the system. Recursions are developed for time transition, measurement incorporation, and impulsive control updating of the generalized covariance matrix. Means of limiting the dimensional growth of the generalized state vector via the processes of estimator epoch adjustment and measurement vector deflation are described and the application of numerically stable matrix factorization methods to the generalized covariance recursions is outlined. The method is applied to the Magellan spacecraft to demonstrate the capability of ground-based optimal estimation and control of gyro/star scanner misalignment.

Boone, Jack N.↗

NASA NTRS1991

Navigation of the TSS-1 mission

The Tethered Satellite System Mission was analyzed to determine its impacts on the Mission Control Center (MCC) Navigation section's ability to maintain an accurate state vector for the Space Shuttle during nominal and off-nominal flight operations. Tether dynamics expected on the Shuttle introduces new phenomena when determining the best estimation of its position and velocity. In the analysis, emphasis was placed on determining the navigation state vectors accuracies resulting when the tether induced forces were and were not modeled as an additional acceleration upon processing tracking measurements around a TSS-1 trajectory. Results of the analyses show that when the forces are not modeled in the state vector generation process, the resulting solution state reflects a solution about the center of gravity of the tethered system and not that of the orbiter. The Navigation team's ability to provide accurate state vector estimates necessary for trajectory planning are impeded. In addition to this consequent, is an impact on Onboard Navigation state vector accuracies. These analyses will show that in order to preserve an accurate state onboard the orbiter a new operational procedure would have to be adopted.

Jackson, Timothy C.↗

NASA NTRS1992

Reduced basis technique for calculating sensitivity coefficients of nonlinear structural response

An efficient reduced basis technique is presented for calculating the sensitivity of nonlinear structural response to variations in the design variables. The structure is discretized by using two-field mixed finite element models. The vector of structural response and its sensitivity coefficients (derivatives with respect to design variables) are each expressed as a linear combination of a small number of basis (or global approximation) vectors. The Bubnov-Galerkin technique is then used to approximate each of the finite element equations governing the response and the sensitivity coefficients by a small number of algebraic equations in the amplitudes of these vectors. The path derivatives (derivatives of the response vector with respect to path parameters, e.g., load parameters) are used as basis vectors for approximating the response. A combination of the path derivatives and their derivatives with respect to the design variables is used for approximating the sensitivity coefficients. The potential of the proposed technique is discussed and its effectiveness is demonstrated by means of numerical examples of laminated composite plates subjected to mechanical and thermal loads.

Noor, Ahmed K.↗

NASA NTRS1990

Implicit application of polynomial filters in a k-step Arnoldi method

The Arnoldi process is a well known technique for approximating a few eigenvalues and corresponding eigenvectors of a general square matrix. Numerical difficulties such as loss of orthogonality and assessment of the numerical quality of the approximations as well as a potential for unbounded growth in storage have limited the applicability of the method. These issues are addressed by fixing the number of steps in the Arnoldi process at a prescribed value k and then treating the residual vector as a function of the initial Arnoldi vector. This starting vector is then updated through an iterative scheme that is designed to force convergence of the residual to zero. The iterative scheme is shown to be a truncation of the standard implicitly shifted QR-iteration for dense problems and it avoids the need to explicitly restart the Arnoldi sequence. The main emphasis of this paper is on the derivation and analysis of this scheme. However, there are obvious ways to exploit parallelism through the matrix-vector operations that comprise the majority of the work in the algorithm. Preliminary computational results are given for a few problems on some parallel and vector computers.

Sorensen, D. C.↗

NASA NTRS1991

Path planning for assembly of strut-based structures

A path planning method with collision avoidance for a general single chain nonredundant or redundant robot is proposed. Joint range boundary overruns are also avoided. The result is a sequence of joint vectors which are passed to a trajectory planner. A potential field algorithm in joint space computes incremental joint vectors delta-q = delta-q(sub a) + delta-q(sub c) + delta-q(sub r). Adding delta-q to the robot's current joint vector leads to the next step in the path. Delta-q(sub a) is obtained by computing the minimum norm solution of the underdetermined linear system J delta-q(sub a) = x(sub a) where x(sub a) is a translational and rotational force vector that attracts the robot to its goal position and orientation. J is the manipulator Jacobian. Delta-q(sub c) is a collision avoidance term encompassing collisions between the robot (links and payload) and obstacles in the environment as well as collisions among links and payload of the robot themselves. It is obtained in joint space directly. Delta-q(sub r) is a function of the current joint vector and avoids joint range overruns. A higher level discrete search over candidate safe positions is used to provide alternatives in case the potential field algorithm encounters a local minimum and thus fails to reach the goal. The best first search algorithm A* is used for graph search. Symmetry properties of the payload and equivalent rotations are exploited to further enlarge the number of alternatives passed to the potential field algorithm.

Muenger, Rolf↗

NASA NTRS1992

Human-like agents with posture planning ability

Human body models are geometric structures which may be ultimately controlled by kinematically manipulating their joints, but for animation, it is desirable to control them in terms of task-level goals. We address a fundamental problem in achieving task-level postural goals: controlling massively redundant degrees of freedom. We reduce the degrees of freedom by introducing significant control points and vectors, e.g., pelvis forward vector, palm up vector, and torso up vector, etc. This reduced set of parameters are used to enumerate primitive motions and motion dependencies among them, and thus to select from a small set of alternative postures (e.g., bend vs. squat to lower shoulder height). A plan for a given goal is found by incrementally constructing a goal/constraint set based on the given goal, motion dependencies, collision avoidance requirements, and discovered failures. Global postures satisfying a given goal/constraint set are determined with the help of incremental mental simulation which uses a robust inverse kinematics algorithm. The contributions of the present work are: (1) There is no need to specify beforehand the final goal configuration, which is unrealistic for the human body, and (2) the degrees of freedom problem becomes easier by representing body configurations in terms of 'lumped' control parameters, that is, control points and vectors.

Jung, Moon R.↗

NASA NTRS1995

Coherent states for the relativistic harmonic oscillator

Recently we have obtained, on the basis of a group approach to quantization, a Bargmann-Fock-like realization of the Relativistic Harmonic Oscillator as well as a generalized Bargmann transform relating fock wave functions and a set of relativistic Hermite polynomials. Nevertheless, the relativistic creation and annihilation operators satisfy typical relativistic commutation relations of the Lie product (vector-z, vector-z(sup dagger)) approximately equals Energy (an SL(2,R) algebra). Here we find higher-order polarization operators on the SL(2,R) group, providing canonical creation and annihilation operators satisfying the Lie product (vector-a, vector-a(sup dagger)) = identity vector 1, the eigenstates of which are 'true' coherent states.

Aldaya, Victor↗

NASA NTRS1992

An implementation of the QMR method based on coupled two-term recurrences

The authors have proposed a new Krylov subspace iteration, the quasi-minimal residual algorithm (QMR), for solving non-Hermitian linear systems. In the original implementation of the QMR method, the Lanczos process with look-ahead is used to generate basis vectors for the underlying Krylov subspaces. In the Lanczos algorithm, these basis vectors are computed by means of three-term recurrences. It has been observed that, in finite precision arithmetic, vector iterations based on three-term recursions are usually less robust than mathematically equivalent coupled two-term vector recurrences. This paper presents a look-ahead algorithm that constructs the Lanczos basis vectors by means of coupled two-term recursions. Implementation details are given, and the look-ahead strategy is described. A new implementation of the QMR method, based on this coupled two-term algorithm, is described. A simplified version of the QMR algorithm without look-ahead is also presented, and the special case of QMR for complex symmetric linear systems is considered. Results of numerical experiments comparing the original and the new implementations of the QMR method are reported.

Freund, Roland W.↗

NASA NTRS1995

Low-frequency variations in the atmospheric branch of the global hydrological cycle

The annual variation of the hydrological cycle is illustrated in terms of hemispheric-mean hydrological variables for the Northern and Southern Hemispheres, while the intraseasonal variations of the global hydrological cycle are illustrated with mean values over two hemispheres that form an east-west partition of the globe. This partition is defined by the 60 deg E-120 deg W great circle and was chosen so that the mean precipitation difference and the divergent water vapor transport between the two hemispheres was maximized. Two years (1979-80) of daily precipitation estimates from the Goddard Laboratory for Atmospheres an 14 years (1979-92) of upper-air data generated by the Global Data Assimilation System at the National Meteorological Center are used in making quantitative estimates of the annual and intraseasonal variations in the global hydrological cycle. The annual variations in hemispheric-mean precipitation (P-circumflex) and water vapor flux divergence (del(vector differential operator) dot Q-circumflex) for the Northern and Southern Hemispheres are comparable with amplitudes of about 0.5 approximately 0.7 mm/day. Both (P-circumflex) and (del(vector differential operator) dot Q-circumflex) vary annually in a coherent way in each hemisphere so that water vapor diverges from the winter hemisphere, where (P-circumflex) reaches its minimum, to the summer hemisphere, where (P-circumflex) attains its maximum. In fact, the hemispheric-mean divergence of water vapor flux changes sign during the annual cycle. Intraseasonal variations of hemispheric-mean precipitation mean P-tilde, evaporation mean E-tilde, and water vapor flux divergence mean del (vector differential operator) dot Q-tilde in the two hemisphres in the east-west direction are comparable with amplitudes of about 0.1 approximately 0.2 mm/day, although amplitudes in some cases exceed 0.3 mm/day. Hemispheric-mean precipitation mean P-tilde varies coherently in opposite phase for the two hemispheres, while mean del (vector differential operator) dot Q-tilde varies so that water vapor diverges from the hemisphere of maximum mean P-tilde to the hemisphere to the hemisphere of minimum mean P-tilde. Intraseasonal variations of mean P-tilde, mean E-tilde, and mean del (vector differential oprator) dot Q-tilde are in accord with the eastward propagation of the intraseasonal global divergent circulation.

Chen, Tsing-Chang↗

NASA NTRS1995

Model-based VQ for image data archival, retrieval and distribution

An ideal image compression technique for image data archival, retrieval and distribution would be one with the asymmetrical computational requirements of Vector Quantization (VQ), but without the complications arising from VQ codebooks. Codebook generation and maintenance are stumbling blocks which have limited the use of VQ as a practical image compression algorithm. Model-based VQ (MVQ), a variant of VQ described here, has the computational properties of VQ but does not require explicit codebooks. The codebooks are internally generated using mean removed error and Human Visual System (HVS) models. The error model assumed is the Laplacian distribution with mean, lambda-computed from a sample of the input image. A Laplacian distribution with mean, lambda, is generated with uniform random number generator. These random numbers are grouped into vectors. These vectors are further conditioned to make them perceptually meaningful by filtering the DCT coefficients from each vector. The DCT coefficients are filtered by multiplying by a weight matrix that is found to be optimal for human perception. The inverse DCT is performed to produce the conditioned vectors for the codebook. The only image dependent parameter used in the generation of codebook is the mean, lambda, that is included in the coded file to repeat the codebook generation process for decoding.

Manohar, Mareboyana↗