Search NASA⌕ Search

SEARCH · Search NASA

Results for “Arithmetic”

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
All sourcesNASA NTRSDOE OSTI
NASA NTRS1975

Turbine vane coolant flow variations and calculated effects on metal temperatures

Seventy-two air-cooled turbine vanes were tested to determine coolant flow variations among the vanes. Calculations were made to estimate the effect of measured coolant flow variations on local vane metal temperatures. The calculations were based on the following assumed operating conditions: turbine inlet temperature, 1700 K (2600 F); turbine inlet pressure, 31 N/sq cm (45 psia); coolant inlet temperature, 811 K (1000 F); and total coolant to gas flow ratio, 0.065. Variations of total coolant flow were not large (about 10 percent from the arithmetic mean) for all 72 vanes, but variations in local coolant flows were large. The local coolant flow variations ranged from 8 to 75 percent, and calculated metal temperature variations ranged from 8 to 60 K (15 to 180 F).

Yeh, F. C.↗
NASA NTRS1975

System balance analysis for vector computers

The availability of vector processors capable of sustaining computing rates of 10 to the 8th power arithmetic results pers second raised the question of whether peripheral storage devices representing current technology can keep such processors supplied with data. By examining the solution of a large banded linear system on these computers, it was found that even under ideal conditions, the processors will frequently be waiting for problem data.

Knight, J. C.↗
NASA NTRS1974

One way Doppler Extractor. Volume 2: Digital VCO technique

A feasibility analysis and trade-offs for a one-way Doppler extractor using digital VCO techniques is presented. The method of Doppler measurement involves the use of a digital phase lock loop; once this loop is locked to the incoming signal, the precise frequency and hence the Doppler component can be determined directly from the contents of the digital control register. The only serious error source is due to internally generated noise. Techniques are presented for minimizing this error source and achieving an accuracy of 0.01 Hz in a one second averaging period. A number of digitally controlled oscillators were analyzed from a performance and complexity point of view. The most promising technique uses an arithmetic synthesizer as a digital waveform generator.

Nossen, E. J.↗
NASA NTRS1974

An improved version of the table look-up algorithm for pattern recognition

The table look-up approach to pattern recognition has been used for 3 years at several research centers in a variety of applications. A new version has been developed which is faster, requires significantly less core memory, and retains full precision of the input data. The new version can be used on low-cost minicomputers having 32K words (16 bits each) of core memory and fixed-point arithmetic; no special-purpose hardware is required. An initial FORTRAN version of this system can classify an ERTS computer-compatible tape into 24 classes in less than 15 minutes.

Eppler, W. G.↗
NASA NTRS1975

Gravitational effects on body composition in birds

Gallinaceous birds, presenting a wide range of body size, were adapted physiologically to hyperdynamic environments, provided by chronic centrifugation. Chemical composition was measured directly on prepared carcasses, which were anatomically comparable, and more amenable to analysis than the intact body. Body mass and body fat decreased arithmetically with increasing field strength and also with increasing body mass. Water content of lean tissue increased in hyperdynamic environments, but irrespectively of body size.

Smith, A. H.↗
NASA NTRS1977

Signal enhancement filters

Designed to smooth digital output of radar tracking system, two filters prevent noise-induced inaccuracies and result in input/output noise-variance reduction on order of 10:1. One filter is special purpose device with limited arithmetic-logic unit, and other is true programmable microprocessor.

Killen, H. B.↗
NASA NTRS1977

Microprogramed telemetry processor

Minimum hardware, reliable processor responds rapidly to changing requirements simply by changes in contents of programmable read-only memory. General purpose controller can transfer data onto and off of data bus, perform logic and arithmetic manipulations, and store pertinent data in small internal random-access memory.

Gordon, L. H.↗
NASA NTRS1975

A computerized symbolic integration technique for development of triangular and quadrilateral composite shallow-shell finite elements

Computerized symbolic integration was used in conjunction with group-theoretic techniques to obtain analytic expressions for the stiffness, geometric stiffness, consistent mass, and consistent load matrices of composite shallow shell structural elements. The elements are shear flexible and have variable curvature. A stiffness (displacement) formulation was used with the fundamental unknowns consisting of both the displacement and rotation components of the reference surface of the shell. The triangular elements have six and ten nodes; the quadrilateral elements have four and eight nodes and can have internal degrees of freedom associated with displacement modes which vanish along the edges of the element (bubble modes). The stiffness, geometric stiffness, consistent mass, and consistent load coefficients are expressed as linear combinations of integrals (over the element domain) whose integrands are products of shape functions and their derivatives. The evaluation of the elemental matrices is divided into two separate problems - determination of the coefficients in the linear combination and evaluation of the integrals. The integrals are performed symbolically by using the symbolic-and-algebraic-manipulation language MACSYMA. The efficiency of using symbolic integration in the element development is demonstrated by comparing the number of floating-point arithmetic operations required in this approach with those required by a commonly used numerical quadrature technique.

Anderson, C. M.↗
NASA NTRS1975

Special analysis of community annoyance with aircraft noise reported by residents in the vicinity of JFK Airport, 1972

During the summer of 1972, about 1500 residents were interviewed twice in 11 communities near JFK airport. Detailed aircraft operations reports were also collected for this period, and an effort has been made to analyze recorded human response data in relation to a number of physical exposure parameters. A series of exposure indexes, based on an arithmetic integration of aircraft operations, were correlated with summated aircraft noise annoyance responses. None of these correlations were as good as the CNR index which assumes a logrithmetic integration of numbers of aircraft exposures and includes a day-night differential weighting of 10:1. There were substantial variations in average annoyance responses among communities with similar CNR exposures, substantiating previous findings that attitudinal and other personal variables also play an important role in determining annoyance differences.

Borsky, P. N.↗
NASA NTRS1976

A numerical comparison of discrete Kalman filtering algorithms: An orbit determination case study

The numerical stability and accuracy of various Kalman filter algorithms are thoroughly studied. Numerical results and conclusions are based on a realistic planetary approach orbit determination study. The case study results of this report highlight the numerical instability of the conventional and stabilized Kalman algorithms. Numerical errors associated with these algorithms can be so large as to obscure important mismodeling effects and thus give misleading estimates of filter accuracy. The positive result of this study is that the Bierman-Thornton U-D covariance factorization algorithm is computationally efficient, with CPU costs that differ negligibly from the conventional Kalman costs. In addition, accuracy of the U-D filter using single-precision arithmetic consistently matches the double-precision reference results. Numerical stability of the U-D filter is further demonstrated by its insensitivity of variations in the a priori statistics.

Thornton, C. L.↗
NASA NTRS1975

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

Optical computing with laser light

Linear and nonlinear optical processing techniques (Fourier transformation, convolution and correlation, arithmetic operations - addition and subtraction with gratings, generalized orthogonal transformations; theta modulation, half-tone screen process, optical feedback) for mathematical computations are reviewed. The use of gratings and computer holograms in addition, subtraction, differentiation, and application of generalized transformations is discussed. Use of nonlinear optical elements with or without optical coherent feedback in such nonlinear operations as taking logarithms and thresholding is described. Applications in hybrid systems incorporating digital computer and optical processor with real-time interface devices, or optical threshold and logic devices for parallel processing to apply digital techniques to optical information are considered.

Lee, S. H.↗
NASA NTRS1976

Technique for atmospheric rate chemistry calculations

The possibility that predictions of atmospheric photochemistry/transport models are sensitive to uncertainties in reaction rates and other inputs stresses the need for rapid numerical integration schemes in rate photochemistry problems. Reducing the computational burden has a major merit in facilitating sensitivity studies to assess the effect of uncertainties on predicted ozone diminutions from NOx (NO + NO2) in the exhaust plume of SST engines. The paper discusses the validity of an algorithmic approach to integration of rate chemistry problems in combustion, developed by Rubel and Baronti for an approximate calculation of the production rate of the i-th chemical species involved. An analysis of two projected SST engines confirms the validity of the proposed algorithm. Because of the relative arithmetical simplicity, it may be easier to treat diffusion rate chemistry calculations using the Rubel and Baronti approximation than would be possible by other approaches.

Matloff, G. L.↗
NASA NTRS1976

Regions of constrained maximum likelihood parameter identifiability

This short paper considers the parameter-identification problem of general discrete-time, nonlinear, multiple input-multiple output dynamic systems with Gaussian white distributed measurement errors. Knowledge of the system parameterization is assumed to be available. Regions of constrained maximum likelihood (CML) parameter identifiability are established. A computation procedure employing interval arithmetic is proposed for finding explicit regions of parameter identifiability for the case of linear systems.

Lee, C.-H.↗
NASA NTRS1976

The fast decoding of Reed-Solomon codes using number theoretic transforms

It is shown that Reed-Solomon (RS) codes can be encoded and decoded by using a fast Fourier transform (FFT) algorithm over finite fields. The arithmetic utilized to perform these transforms requires only integer additions, circular shifts and a minimum number of integer multiplications. The computing time of this transform encoder-decoder for RS codes is less than the time of the standard method for RS codes. More generally, the field GF(q) is also considered, where q is a prime of the form K x 2 to the nth power + 1 and K and n are integers. GF(q) can be used to decode very long RS codes by an efficient FFT algorithm with an improvement in the number of symbols. It is shown that a radix-8 FFT algorithm over GF(q squared) can be utilized to encode and decode very long RS codes with a large number of symbols. For eight symbols in GF(q squared), this transform over GF(q squared) can be made simpler than any other known number theoretic transform with a similar capability. Of special interest is the decoding of a 16-tuple RS code with four errors.

Reed, I. S.↗
NASA NTRS1976

A variant of nested dissection for solving n by n grid problems

Nested dissection orderings are known to be very effective for solving the sparse positive definite linear systems which arise from n by n grid problems. In this paper nested dissection is shown to be the final step of incomplete nested dissection, an ordering which corresponds to the premature termination of dissection. Analyses of the arithmetic and storage requirements for incomplete nested dissection are given, and the ordering is shown to be competitive with nested dissection under certain conditions.

George, A.↗
NASA NTRS1977

Exact solution of some linear matrix equations using algebraic methods

A study is done of solution methods for Linear Matrix Equations including Lyapunov's equation, using methods of modern algebra. The emphasis is on the use of finite algebraic procedures which are easily implemented on a digital computer and which lead to an explicit solution to the problem. The action f sub BA is introduced a Basic Lemma is proven. The equation PA + BP = -C as well as the Lyapunov equation are analyzed. Algorithms are given for the solution of the Lyapunov and comment is given on its arithmetic complexity. The equation P - A'PA = Q is studied and numerical examples are given.

Djaferis, T. E.↗
NASA NTRS1977

Matrix computations in MACSYMA

Facilities built into MACSYMA for manipulating matrices with numeric or symbolic entries are described. Computations will be done exactly, keeping symbols as symbols. Topics discussed include how to form a matrix and create other matrices by transforming existing matrices within MACSYMA; arithmetic and other computation with matrices; and user control of computational processes through the use of optional variables. Two algorithms designed for sparse matrices are given. The computing times of several different ways to compute the determinant of a matrix are compared.

Wang, P. S.↗