Search NASA⌕ Search

SEARCH · Search NASA

Results for “Transforms”

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 199 records · Page 11

A dynamic transformation method for modal synthesis.

This paper presents a condensation method for large discrete parameter vibration analysis of complex structures that greatly reduces truncation errors and provides accurate definition of modes in a selected frequency range. A dynamic transformation is obtained from the partitioned equations of motion that relates modes not explicity in the condensed solution to the retained modes at a selected system frequency. The generalized mass and stiffness matrices, obtained with existing modal synthesis methods, are reduced using this transformation and solved. Revised solutions are then obtained using new transformations at the calculated eigenvalues and are also used to assess the accuracy of the results. If all the modes of interest have not been obtained, the results are used to select a new set of retained coordinates and a new transformation frequency, and the procedure is repeated for another group of modes.

Kuhar, E. J.↗

RM2: Transform operations

The two-dimensional transform used in the research TV source encoder, RM2 is discussed. It is shown that both conceptually and in terms of the number of required computations, the RM2 transform is considerably simpler than the Fast Hadamard Transform. The latter can in fact be generated by extending the RM2 transform.

Rice, R. F.↗

Applications of the Kustaanheimo-Stieffel transformation of the perturbed two-body problem

The Newtonian differential equations of motion for the two-body problem can be transformed into four linear harmonic-oscillator equations by simultaneously applying the regularization step dt/ds = r and the Kustaanheimo-Stieffel (KS) transformation. The regularization step changes the independent variable from time to a new variable s, and the KS transformation transforms the position and velocity vectors from Cartesian space into a four-dimensional space. A derivation of a uniform, regular solution for the perturbed two-body problem in the four-dimensional space is presented. The variation-of-parameters technique is used to develop expressions for the derivatives of ten elements (which are constants in the unperturbed motion) for the general case that includes both perturbations which can arise from a potential and perturbations which cannot be derived from a potential. This ten-element solution has mixed secular terms that degrade the long-term accuracy during numerical integration. Therefore, to eliminate these terms, the solution is modified by introducing two additional elements.

Bond, V. R.↗

On differential transformations between Cartesian and curvilinear (geodetic) coordinates

Differential transformations are developed between Cartesian and curvilinear orthogonal coordinates. Only matrix algebra is used for the presentation of the basic concepts. After defining the reference systems used the rotation (R), metric (H), and Jacobian (J) matrices of the transformations between cartesian and curvilinear coordinate systems are introduced. A value of R as a function of H and J is presented. Likewise an analytical expression for J(-1) as a function of H(-2) and R is obtained. Emphasis is placed on showing that differential equations are equivalent to conventional similarity transformations. Scaling methods are discussed along with ellipsoidal coordinates. Differential transformations between elipsoidal and geodetic coordinates are established.

Soler, T.↗

A transformation method for deriving from a photograph, position and heading of a vehicle in a plane

Equations have been derived that transform perspectively viewed planar surface coordinates, as seen in a photograph, into coordinates of the original plane surface. These transformation equations are developed in terms of nine geometric variables that define the photographic setup and are redefined in terms of eight parameters. The parameters are then treated as independent quantities that fully characterize the transformation and are expressed directly in terms of the four corner coordinates of a reference rectangle in the object plane and their coordinates as seen in a photograph. Vehicle position is determined by transforming the perspectively viewed coordinate position of a representative vehicle target into runway coordinates. Vehicle heading is determined from the runway coordinates of two vehicle target points. When the targets are elevated above the plane of the reference grid, the computation of the heading angle is unaffected; however, the computation of the target position may require adjustment of two parameters. Methods are given for adjusting the parameters for elevation and an example is included for both nonelevated and elevated target conditions.

Sleeper, R. K.↗

Transformation of apparent ocean wave spectra observed from an aircraft sensor platform

The problem considered was transformation of a unidirectional apparent ocean wave spectrum observed from an aircraft sensor platform into the true spectrum that would be observed from a stationary platform. Spectral transformation equations were developed in terms of the linear wave dispersion relationship and the wave group speed. An iterative solution to the equations was outlined and used to transform reference theoretical apparent spectra for several assumed values of average water depth. Results show that changing the average water depth leads to a redistribution of energy density among the various frequency bands of the transformed spectrum. This redistribution is most severe when much of the energy density is expected, a priori, to reside at relatively low true frequencies.

Poole, L. R.↗

Computation of transform domain covariance matrices

It is often of interest in applications to compute the covariance matrix of a random process transformed by a fast unitary transform. Here, the recursive definition of fast unitary transforms is used to derive recursive relations for the covariance matrices of the transformed process. These relations lead to fast methods of computation of covariance matrices and to substantial reductions of the number of arithmetic operations required.

Fino, B. J.↗

Phase transformation and stabilization of a high strength austenite

An investigation of the phase transformation and the austenite stabilization in a high strength austenite has been made. An Fe-29Ni-4.3Ti austenite age-hardened by gamma-prime (Ni3Ti) precipitates showed a further increase of strength after martensitic and reverse martensitic phase transformations. The stability of ausaged austenite as well as ausaged and transformation-strengthened austenite was improved significantly through an isothermal treatment at 500 C. The Ms temperature of the strengthened austenite was restored to nearly that of annealed austenite while the austenite was hardened to R(C) 41 through precipitation and phase transformations. The observed austenite stabilization is attributed to the formation of GP zones or short-range order of less than about 10A in size.

Jin, S.↗

An algorithm to compute the sequency ordered Walsh transform

A fast sequency-ordered Walsh transform algorithm is presented; this sequency-ordered fast transform is complementary to the sequency-ordered fast Walsh transform introduced by Manz (1972) and eliminating gray code reordering through a modification of the basic fast Hadamard transform structure. The new algorithm retains the advantages of its complement (it is in place and is its own inverse), while differing in having a decimation-in time structure, accepting data in normal order, and returning the coefficients in bit-reversed sequency order. Applications include estimation of Walsh power spectra for a random process, sequency filtering and computing logical autocorrelations, and selective bit reversing.

Larsen, H.↗

A fast Karhunen-Loeve transform for a class of random processes

It is shown that for a class of finite first-order Markov signals, the Karhunen-Loeve (KL) transform for data compression is a set of periodic sine functions if the boundary values of the signal are fixed or known. These sine functions are shown to be related to the Fourier transform so that a fast Fourier transform algorithm can be used to implement the KL transform. Extension to two dimensions with reference to images with separable contravariance function is shown.

Jain, A. K.↗

Transformer design tradeoffs

In space, power system transformer components are frequently the heaviest and bulkiest items in the power conversion circuit. They also have a significant effect upon the overall performance and efficiency of the system. Accordingly, the design of such transformers has an important effect on overall system weight, power-inversion efficiency, and cost. Relationships were between the parameters used by transformer designers that can be used as new tools to standardize and simplify transformer design. They can be used to optimize the design either for small size and weight or efficiency. The metric system of units, rather than the familiar English units, is used; however, material is presented to assist the reader in the transition from one system to the other.

Mclyman, W. T.↗

Euler angles, quaternions, and transformation matrices for space shuttle analysis

Relationships between the Euler angles and the transformation matrix, the quaternion and the transformation matrix, and the Euler angles and the quaternion are analyzed, and equations developed are applied directly to current space shuttle problems. The twelve three-axis Euler transformation matrices as functions of the Euler angles, the equations for the quaternion as a function of the Euler angles, and the Euler angles as a function of the transformation matrix elements are included along with a group of utility subroutines to accomplish the Euler matrix, quaternion matrix, and Euler quaternion relationships.

Henderson, D. M.↗

Shuttle Program. Euler angles, quaternions, and transformation matrices working relationships

A brief mathematical development of the relationship between the Euler angles and the transformation matrix, the quaternion and the transformation matrix, and the Euler angles and the quaternion is presented. The analysis and equations presented apply directly to current space shuttle problems. The twelve three-axis Euler transformation matrices are given as functions of the Euler angles, the equations for the quaternion as a funtion of the Euler angles, and the Euler angles as a function of the transformation matrix elements.

Henderson, D. M.↗

A fast DFT algorithm using complex integer transforms

Winograd's algorithm for computing the discrete Fourier transform is extended considerably for certain large transform lengths. This is accomplished by performing the cyclic convolution, required by Winograd's method, by a fast transform over certain complex integer fields. This algorithm requires fewer multiplications than either the standard fast Fourier transform or Winograd's more conventional algorithms.

Reed, I. S.↗

A new hybrid algorithm for computing a fast discrete Fourier transform

For certain long transform lengths, Winograd's algorithm for computing the discrete Fourier transform is extended considerably. This is accomplished by performing the cyclic convolution, required by Winograd's method, with the Mersenne-prime number theoretic transform. This new algorithm requires fewer multiplications than either the standard fast Fourier transform or Winograd's more conventional algorithm.

Reed, I. S.↗

On decoding of Reed-Solomon codes over GF/32/ and GF/64/ using the transform techniques of Winograd

An algorithm based on the Winograd (1976) method is developed to compute a Fourier-like transform over Galois field GF(2 exp n) for n equal to 5 and 6. It is shown that this transform algorithm requires fewer multiplications than the more conventional fast transform algorithm described by Gentleman (1968). Such a transform can be used to encode and decode Reed-Solomon codes of length (2 exp n) -1.

Reed, I. S.↗

A new hybrid algorithm for computing a fast discrete Fourier transform

In this paper for certain long transform lengths, Winograd's algorithm for computing the discrete Fourier transform (DFT) is extended considerably. This is accomplished by performing the cyclic convolution, required by Winograd's method, with the Mersenne prime number-theoretic transform developed originally by Rader. This new algorithm requires fewer multiplications than either the standard fast Fourier transform (FFT) or Winograd's more conventional algorithm. However, more additions are required.

Reed, I. S.↗

A new coordinate transformation for turbulent boundary layer flows

The transformation permits a uniform mesh to be used in the computational coordinate which extends across the layer. This coordinate transformation uses the local value of the skin friction coefficient to scale the thickness of the wall layer region, and the local maximum value of turbulent viscosity to scale the boundary-layer thickness. Results are presented for two dimensional boundary layers in both positive and negative pressure gradients and comparisons are made with experimental data and conventional variable-grid results for low speed turbulent boundary-layers. The cases chosen illustrate the capability of this new transformation to capture the boundary layer growth over the full extent of laminar, transitional, and turbulent flow with no grid adjustment as well as its ability to consistently enlarge the wall layer region for accurate shear stress representation. Results of mesh refinement studies using the new coordinate transformation are presented.

Carter, J. E.↗