Search NASA⌕ Search

SEARCH · Search NASA

Results for “orthogonal”

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 181 records · Page 10
All sourcesNASA NTRSDOE OSTI
NASA NTRS1971

Self-synchronizing, bi-orthogonal coded PCM telemetry system

Communications and data handling system improves signal to noise ratio when transmission channel is perturbed by noise. Telemetry system consists of airborne source, Gaussian additive noise channel, and ground receiver unit. Advantages of system are given.

Miller, W.↗
NASA NTRS1971

Slewing about non-orthogonal axes

Three-legged slewing about nonorthogonal axes, solving single-axis reorientations by two successive rotations about arbitrary fixed lines

Davenport, P. B.↗
NASA NTRS1971

A comparison of orthogonal transformations for digital speech processing.

Discrete forms of the Fourier, Hadamard, and Karhunen-Loeve transforms are examined for their capacity to reduce the bit rate necessary to transmit speech signals. To rate their effectiveness in accomplishing this goal the quantizing error (or noise) resulting for each transformation method at various bit rates is computed and compared with that for conventional companded PCM processing. Based on this comparison, it is found that Karhunen-Loeve provides a reduction in bit rate of 13.5 kbits/s, Fourier 10 kbits/s, and Hadamard 7.5 kbits/s as compared with the bit rate required for companded PCM. These bit-rate reductions are shown to be somewhat independent of the transmission bit rate.

Campanella, S. J.↗
NASA NTRS1972

L-band orthogonal-mode crossed-slot antenna and VHF crossed-loop antenna

A low gain, circularly polarized, L-band antenna; a low gain, linealy polarized, L-band antenna; and a low gain, circularly polarized, upper hemisphere, VHF satellite communications antenna intended for airborne applications are described. The text includes impedance and antenna radiation pattern data, along with physical description of the construction of the antennas.

Olsson, T.↗
NASA NTRS1973

Sparse matrix methods based on orthogonality and conjugacy

A matrix having a high percentage of zero elements is called spares. In the solution of systems of linear equations or linear least squares problems involving large sparse matrices, significant saving of computer cost can be achieved by taking advantage of the sparsity. The conjugate gradient algorithm and a set of related algorithms are described.

Lawson, C. L.↗
NASA NTRS1975

Sequential Least-Squares Using Orthogonal Transformations

Square root information estimation, starting from its beginnings in least-squares parameter estimation, is considered. Special attention is devoted to discussions of sensitivity and perturbation matrices, computed solutions and their formal statistics, consider-parameters and consider-covariances, and the effects of a priori statistics. The constant-parameter model is extended to include time-varying parameters and process noise, and the error analysis capabilities are generalized. Efficient and elegant smoothing results are obtained as easy consequences of the filter formulation. The value of the techniques is demonstrated by the navigation results that were obtained for the Mariner Venus-Mercury (Mariner 10) multiple-planetary space probe and for the Viking Mars space mission.

Bierman, G. J.↗
NASA NTRS1975

A formulation consideration for orthogonal collocation procedures

Numerical instabilities often arise in the use of high-ordered collocation approximations for numerically solving parabolic partial differential equations. These problems may be reduced by formulations involving evaluation of collocation polynomials rather than combination of the polynomials into a power series. As an illustration, two formulations using shifted Legendre polynomials of order 26 and less are compared.

Lashmet, P. K.↗
NASA NTRS1978

The Lanczos algorithm with selective orthogonalization

A new stable and efficient implementation of the Lanczos algorithm is presented. The algorithm is a powerful method for finding a few eigenvalues and eigenvectors at one or both ends of the spectrum of a symmetric matrix A. The algorithm is particularly effective if A is large and sparse in that the only way in which A enters the calculation is through a subroutine which computes Av for any vector v. Thus the user is free to take advantage of any sparsity structure in A and A need not even be represented as a matrix et al.

Parlett, B. N.↗
NASA NTRS1982

The Orthogonal In-Situ Machining of Single and Polycrystalline Aluminum and Copper, Volume 1

Metal cutting is a unique deformation process characterized by large strains, exceptionally high strain rates and few constraints to the deformation. These factors, along with the difficulty of directly measuring the shear angle, make chip formation difficult to model and understand. One technique for skirting the difficulty of post mortem chip measurement is to perform a cutting experiment dynamically in a scanning electron microscope. The performance of the in-situ experiment with full instrumentation allows for component force measurement, orientation measurement (on a round single crystal disk) and a timing device, all superimposed below the deformation on the TV monitor and recorded for future viewing. This allows the sher angle to be directly measured for the screen along with the other needed information.

Cohen, P. H.↗