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 289 records · Page 16

On Bartky's method for evaluation of integrals of elliptic type with application to round-nosed wedges

Bartky's method for the numerical evluation of integrals of the complete elliptic type is modified to improve its accuracy. The resulting modified method is then applied to integrals involving complex arithmetic which map the upper half of one plane onto either the interior or exterior of round-nosed wedges. These solutions have engineering applications to such problems as the design of magnets and the flow of fluids in and around corners.

Rossow, V. J.↗

VLSI architectures for computing multiplications and inverses in GF(2m)

Finite field arithmetic logic is central in the implementation of Reed-Solomon coders and in some cryptographic algorithms. There is a need for good multiplication and inversion algorithms that are easily realized on VLSI chips. Massey and Omura recently developed a new multiplication algorithm for Galois fields based on a normal basis representation. A pipeline structure is developed to realize the Massey-Omura multiplier in the finite field GF(2m). With the simple squaring property of the normal-basis representation used together with this multiplier, a pipeline architecture is also developed for computing inverse elements in GF(2m). The designs developed for the Massey-Omura multiplier and the computation of inverse elements are regular, simple, expandable and, therefore, naturally suitable for VLSI implementation.

Wang, C. C.↗

A sequential linear optimization approach for controller design

A linear optimization approach with a simple real arithmetic algorithm is presented for reliable controller design and vibration suppression of flexible structures. Using first order sensitivity of the system eigenvalues with respect to the design parameters in conjunction with a continuation procedure, the method converts a nonlinear optimization problem into a maximization problem with linear inequality constraints. The method of linear programming is then applied to solve the converted linear optimization problem. The general efficiency of the linear programming approach allows the method to handle structural optimization problems with a large number of inequality constraints on the design vector. The method is demonstrated using a truss beam finite element model for the optimal sizing and placement of active/passive-structural members for damping augmentation. Results using both the sequential linear optimization approach and nonlinear optimization are presented and compared. The insensitivity to initial conditions of the linear optimization approach is also demonstrated.

Horta, L. G.↗

Accelerating an iterative process by explicit annihilation

A slowly convergent stationary iterative process can be accelerated by explicitly annihilating (i.e., eliminating) the dominant eigenvector component of the error. The dominant eigenvalue or complex pair of eigenvalues can be estimated from the solution during the iteration. The corresponding eigenvector or complex pair of eigenvectors can then be annihilated by applying an explicit Richardson process over the basic iterative method. This can be done entirely in real arithmetic by analytically combining the complex conjugate annihilation steps. The technique is applied to an implicit algorithm for the calculation of two dimensional steady transonic flow over a circular cylinder using the equations of compressible inviscid gas dynamics. This demonstrates the use of explicit annihilation on a nonlinear problem.

Jespersen, D. C.↗

VLSI Architectures for Computing DFT's

Simplifications result from use of residue Fermat number systems. System of finite arithmetic over residue Fermat number systems enables calculation of discrete Fourier transform (DFT) of series of complex numbers with reduced number of multiplications. Computer architectures based on approach suitable for design of very-large-scale integrated (VLSI) circuits for computing DFT's. General approach not limited to DFT's; Applicable to decoding of error-correcting codes and other transform calculations. System readily implemented in VLSI.

Truong, T. K.↗

The effect of varying task difficulty on subjective workload

The effect of different difficulty distribution patterns on subjective workload, and the presence of a primacy/recency effect in subjective ratings are examined. Eight subjects performed the perceptual central processing required for response selection and manual target acquisition for response execution. The reaction time, movement time, and the percent of correct pattern matching and arithmetic equations are analyzed. The data reveal that subjective rating is unaffected by different task difficulty and no primacy/recency effects are observed in subjective ratings. It is concluded that subjective workload reflects the experience of an ongoing integration process.

Yeh, Y.-Y.↗

Catching the whispers from Uranus

Sophisticated telecommunications techniques are described that were used to acquire images of Uranus, its 14 moons and ten narrow rings darker than coal. The images, equal in quality to those transmitted from Saturn several years earlier despite the signal being weaker by 6 dB due to the increased distance, were received from Voyager 2 during its January 24, 1986 flyby of Uranus. Solutions to the problem of the weakening signal were found in modifications to Voyager's image processing system and NASA's ground tracking network. In April 1985, Voyager's prime flight data computer was reconfigured to accept only nonimaging science data, and its backup, only imaging data; the latter was reprogrammed to determine only arithmetic differences between adjacent pixel intensities rather than absolute intensities. By image compression, equivalent imaging information could be sent at lower bit rates. Instead of Golay coding, Reed-Solomon onboard encoding was used. These techniques gained the equivalent of 4-dB in imaging yield. Additional improvements were gained by using earth station antennas in pairs (the Parkes radio telescope and the Canberra ground station antenna). Moves under way to prepare for the Voyager encounter with Neptune in 1989 are described (using additional antennas and arrays, scaling up the Deep Space Network antennas from 64 m to 70 m, etc.) to assure almost Saturn-equivalent pictures despite a further 3.5-dB drop in signal strength.

Bartok, C. D.↗

Solving Ordinary Differential Equations

Initial-value ordinary differential equation solution via variable order Adams method (SIVA/DIVA) package is collection of subroutines for solution of nonstiff ordinary differential equations. There are versions for single-precision and double-precision arithmetic. Requires fewer evaluations of derivatives than other variable-order Adams predictor/ corrector methods. Option for direct integration of second-order equations makes integration of trajectory problems significantly more efficient. Written in FORTRAN 77.

Krogh, F. T.↗

Free vibration and dynamic response analysis of spinning structures

The proposed effort involved development of numerical procedures for efficient solution of free vibration problems of spinning structures. An eigenproblem solution procedure, based on a Lanczos method employing complex arithmetic, was successfully developed. This task involved formulation of the numerical procedure, FORTRAN coding of the algorithm, checking and debugging of software, and implementation of the routine in the STARS program. A graphics package for the E/S PS 300 as well as for the Tektronix terminals was successfully generated and consists of the following special capabilities: (1) a dynamic response plot for the stresses and displacements as functions of time; and (2) a menu driven command module enabling input of data on an interactive basis. Finally, the STARS analysis capability was further improved by implementing the dynamic response analysis package that provides information on nodal deformations and element stresses as a function of time. A number of test cases were run utilizing the currently developed algorithm implemented in the STARS program and such results indicate that the newly generated solution technique is significantly more efficient than other existing similar procedures.

Source record↗

A generalized algorithm to design finite field normal basis multipliers

Finite field arithmetic logic is central in the implementation of some error-correcting coders and some cryptographic devices. There is a need for good multiplication algorithms which can be easily realized. Massey and Omura recently developed a new multiplication algorithm for finite fields based on a normal basis representation. Using the normal basis representation, the design of the finite field multiplier is simple and regular. The fundamental design of the Massey-Omura multiplier is based on a design of a product function. In this article, a generalized algorithm to locate a normal basis in a field is first presented. Using this normal basis, an algorithm to construct the product function is then developed. This design does not depend on particular characteristics of the generator polynomial of the field.

Wang, C. C.↗

The fault-tree compiler

The Fault Tree Compiler Program is a new reliability tool used to predict the top event probability for a fault tree. Five different gate types are allowed in the fault tree: AND, OR, EXCLUSIVE OR, INVERT, and M OF N gates. The high level input language is easy to understand and use when describing the system tree. In addition, the use of the hierarchical fault tree capability can simplify the tree description and decrease program execution time. The current solution technique provides an answer precise (within the limits of double precision floating point arithmetic) to the five digits in the answer. The user may vary one failure rate or failure probability over a range of values and plot the results for sensitivity analyses. The solution technique is implemented in FORTRAN; the remaining program code is implemented in Pascal. The program is written to run on a Digital Corporation VAX with the VMS operation system.

Martensen, Anna L.↗

Chemical network problems solved on NASA/Goddard's massively parallel processor computer

The single instruction stream, multiple data stream Massively Parallel Processor (MPP) unit consists of 16,384 bit serial arithmetic processors configured as a 128 x 128 array whose speed can exceed that of current supercomputers (Cyber 205). The applicability of the MPP for solving reaction network problems is presented and discussed, including the mapping of the calculation to the architecture, and CPU timing comparisons.

Cho, Seog Y.↗

Digital control system for space structure dampers

A digital controller was developed using an SKD-51 System Design Kit, which incorporates an 8031 microcontroller. The necessary interfaces were installed in the wire wrap area of the SKD-51 and a pulse width modulator was developed to drive the coil of the actuator. Also, control equations were developed, using floating-point arithmetic. The design of the digital control system is emphasized, and it is shown that, provided certain rules are followed, an adequate design can be achieved. It is recommended that the so-called w-plane design method be used, and that the time elapsed before output of the up-dated coil-force signal be kept as small as possible. However, the cycle time for the controller should be watched carefully, because very small values for this time can lead to digital noise.

Haviland, J. K.↗

Supercomputing on massively parallel bit-serial architectures

Research on the Goodyear Massively Parallel Processor (MPP) suggests that high-level parallel languages are practical and can be designed with powerful new semantics that allow algorithms to be efficiently mapped to the real machines. For the MPP these semantics include parallel/associative array selection for both dense and sparse matrices, variable precision arithmetic to trade accuracy for speed, micro-pipelined train broadcast, and conditional branching at the processing element (PE) control unit level. The preliminary design of a FORTRAN-like parallel language for the MPP has been completed and is being used to write programs to perform sparse matrix array selection, min/max search, matrix multiplication, Gaussian elimination on single bit arrays and other generic algorithms. A description is given of the MPP design. Features of the system and its operation are illustrated in the form of charts and diagrams.

Iobst, Ken↗

Counterface effects on the tribological properties of polyimide composites

Graphite fiber reinforced polyimide composite pins were slid against seven different counterfaces to determine the effect of material type on the tribological properties of polymer composites. In addition, the effect of sliding a new pin on a pre-established transfer film was investigated. The results indicated that almost a five order of magnitude difference in composite wear rate can occur just by varying the counterface material. An attempt to make all surfaces as smooth as possible was made, but due to differences in material composition this was not possible and a range of surface roughnesses were obtained. The results indicate that the smoother the surface, the lower the composite wear rate; but that small protrusions (not discernible with arithmetic surface roughness measurements) can markedly increase wear rates. A pre-established transfer film improved both run in and steady state wear rates.

Fusaro, Robert L.↗

Rarefied aerodynamics and upper atmospheric flight results from the Orbiter High Resolution Accelerometer Package experiment

Data from the High Resolution Accelerometer Package (HiRAP) experiment on the Space Shuttle Orbiter have been analyzed for 10 flights to produce lift-drag (L/D) ratios in the free molecule, transition, and continuum flow flight regimes. Freestream density is also obtained in the altitude range from 60 km to 160 km using an aerodynamic model based upon earlier flight analysis of accelerometer data. The results of the L/D analysis of the latest four flights have been compared with the aerodynamic model developed from the first six HiRAP missions. The new data agree with the established flight-derived model, thereby validating earlier analysis. However, the arithmetic mean of the 10 flight-derived L/D values in the free molecular flow regime is 0.053 (+ or - 0.1) as compared to the initial value of 0.10 (+ or - 0.3), determined from STS-6. Updates to the Orbiter aerodynamic model values and calibration factors have been incorporated into the density calculations for all 10 flights to provide realistic absolute density. The derived density altitude profiles, which have been normalized to the U.S. Standard Atmosphere 1976, are characterized by a large amplitude wave pattern relative to the standard as seen in the initial flight analysis.

Blanchard, R. C.↗

Robust eigensystem assignment for flexible structures

An improved method is developed for eigenvalues and eigenvectors placement of a closed-loop control system using either state or output feedback. The method basically consists of three steps. First, the singular value of QR decomposition is used to generate an orthonormal basis that spans admissible eigenvector space corresponding to each assigned eigenvalue. Secondly, given a unitary matrix, the eigenvector set which best approximates the given matrix in the least-square sense and still satisfy eigenvalue cosntraints is determined. Thirdly, a unitary matrix is sought to minimize the error between the unitary matrix and the assignable eigenvector matrix. For use as the desired eigenvector set, two matrices, namely, the open-loop eigenvector matrix and its closest unitary matrix are proposed. The latter matrix generally encourages both minimum conditioning and control gains. In addition, the algorithm is formulated in real arithmetic for efficient implementation. To illustrate the basic concepts, numerical examples are included.

Juang, Jer-Nan↗