Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “fast”

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 793 records · Page 44

A note on parallel and pipeline computation of fast unitary transforms

The parallel and pipeline organization of fast unitary transform algorithms such as the Fast Fourier Transform are discussed. The efficiency is pointed out of a combined parallel-pipeline processor of a transform such as the Haar transform in which 2 to the n minus 1 power hardware butterflies generate a transform of order 2 to the n power every computation cycle.

Fino, B. J.↗

Fast direct numerical solution of the nonhomogeneous Cauchy-Riemann equations

A fast direct (noniterative) 'Cauchy-Riemann Solver' is developed for solving the finite-difference equations representing systems of first-order elliptic partial differential equations in the form of the nonhomogeneous Cauchy-Riemann equations. The method is second-order accurate and requires approximately the same computer time as a fast cyclic-reduction Poisson solver. The accuracy and efficiency of the direct solver are demonstrated in an application to solving an example problem in aerodynamics: subsonic inviscid flow over a biconvex airfoil. The analytical small-perturbation solution contains singularities, which are captured well by the computational technique. The algorithm is expected to be useful in nonlinear subsonic and transonic aerodynamics.

Lomax, H.↗

Angular distribution, kinetic energy distributions, and excitation functions of fast metastable oxygen fragments following electron impact of CO2

Dissociative excitation of CO2 by electron impact was studied using the methods of translational spectroscopy and angular distribution analysis. Earlier time of flight studies revealed two overlapping spectra, the slower of which was attributed to metastable CO(a3 pi) fragments. The fast peak is the focus of this study. Threshold energy, angular distribution, and improve time of flight measurements indicate that the fast peak actually consists of five overlapping features. The slowest of the five features is found to consist of metastable 0(5S) produced by predissociation of a sigma u + state of CO2 into 0(5S) + CO(a3 pi). Oxygen Rydberg fragments originating directly from a different sigma u + state are believed to make up the next fastest feature. Mechanisms for producing the three remaining features are discussed.

Misakian, M.↗

Parallel and pipeline computation of fast unitary transforms

The letter discusses the parallel and pipeline organization of fast-unitary-transform algorithms such as the fast Fourier transform, and points out the efficiency of a combined parallel-pipeline processor of a transform such as the Haar transform, in which (2 to the n-th power) -1 hardware 'butterflies' generate a transform of order 2 to the n-th power every computation cycle.

Fino, B. J.↗

Computer program for fast Karhunen Loeve transform algorithm

The fast KL transform algorithm was applied for data compression of a set of four ERTS multispectral images and its performance was compared with other techniques previously studied on the same image data. The performance criteria used here are mean square error and signal to noise ratio. The results obtained show a superior performance of the fast KL transform coding algorithm on the data set used with respect to the above stated perfomance criteria. A summary of the results is given in Chapter I and details of comparisons and discussion on conclusions are given in Chapter IV.

Jain, A. K.↗

Variants and extensions of a fast direct numerical cauchy-riemann solver, with illustrative applications

Revised and extended versions of a fast, direct (noniterative) numerical Cauchy-Riemann solver are presented for solving finite difference approximations of first order systems of partial differential equations. Although the difference operators treated are linear and elliptic, one significant application of these extended direct Cauchy-Riemann solvers is in the fast, semidirect (iterative) solution of fluid dynamic problems governed by the nonlinear mixed elliptic-hyperbolic equations of transonic flow. Different versions of the algorithms are derived and the corresponding FORTRAN computer programs for a simple example problem are described and listed. The algorithms are demonstrated to be efficient and accurate.

Martin, E. D.↗

Transient excitation and data processing techniques employing the fast fourier transform for aeroelastic testing

The development of testing techniques useful in airplane ground resonance testing, wind tunnel aeroelastic model testing, and airplane flight flutter testing is presented. Included is the consideration of impulsive excitation, steady-state sinusoidal excitation, and random and pseudorandom excitation. Reasons for the selection of fast sine sweeps for transient excitation are given. The use of the fast fourier transform dynamic analyzer (HP-5451B) is presented, together with a curve fitting data process in the Laplace domain to experimentally evaluate values of generalized mass, model frequencies, dampings, and mode shapes. The effects of poor signal to noise ratios due to turbulence creating data variance are discussed. Data manipulation techniques used to overcome variance problems are also included. The experience is described that was gained by using these techniques since the early stages of the SST program. Data measured during 747 flight flutter tests, and SST, YC-14, and 727 empennage flutter model tests are included.

Jennings, W. P.↗

Fast arithmetic in MacLISP

MacLISP provides a compiler which produces numerical code competitive in speed with some FORTRAN implementations and yet compatible with the rest of the MacLISP system. All numerical programs can be run under the MacLISP interpreter. Additional declarations to the compiler specify type information which allows the generation of optimized numerical code which generally does not require the garbage collection of temporary numerical results. Array accesses are almost as fast as in FORTRAN, and permit the use of dynamically allocated arrays of varying dimensions. The implementation decisions regarding user interface, data representations, and interfacing conventions are discussed which allow the generation of fast numerical LISP code.

Steele, G. L., Jr.↗

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

Fast processing of data from Sneg-2MP experiment

The following subjects are covered: Basic stages during computer processing of data from Sneg-2MP instrument, basic modes during separation and fast processing (separation of data during satellite flight, separation of burst data segments, sampling and analysis of initial burst data segment). Experimental results obtained on the basis of fast processed data are reported.

Dumer, I. I.↗

Restraint ulcers in the rat. 1: Influence on ulcer frequency of fasting and of environmental temperature associated with immobilization of varying durations

The results of the production of experimental ulcers in rats are described. Two experimental conditions were found to regularly provoke the appearance of gastric ulcers in a high percentage of rats: (1) two-and-a-half hour restraint, proceeded by a 24 hour fast; and (2) one-and-a-half hour restraint with lowering of the environmental temperature while fasting.

Buchel, L.↗

On the application of a fast polynomial transform and the Chinese remainder theorem to compute a two-dimensional convolution

A fast algorithm is developed to compute two dimensional convolutions of an array of d sub 1 X d sub 2 complex number points, where d sub 2 = 2(M) and d sub 1 = 2(m-r+) for some 1 or = r or = m. This algorithm requires fewer multiplications and about the same number of additions as the conventional fast fourier transform method for computing the two dimensional convolution. It also has the advantage that the operation of transposing the matrix of data can be avoided.

Truong, T. K.↗

Absorption of thiamine and nicotinic acid in the rat intestine during fasting and immobilization stress

By perfusion of isolated sections of intestine with a solution containing thiamine at a concentration of 3.1 micromole, it was established that thiamine absorption in animals fasted for 72 hours decreased by 28 percent, whereas absorption increased by 12 percent in rats after 24 hour immobilization. After immobilization, absorption of label in the intestinal mucosa increased. Na K ATPase activity in the intestinal mucosa decreased by 10 percent during fasting, and it increased with immobilization of the animals. Activity of Na K ATPase in the intestinal mucosa cells determined the absorption rate of thiamine and nicotinic acid at the level of vitamin transport through the plasma membranes of the enterocytes.

Kirilyuk, O. G.↗

Low-cost conversion of polycrystalline silicon into sheet by HEM and FAST

The conversion of polycrystalline silicon to sheet form (the wafers produced are 10 cm x 10 cm cross section with minimum surface damage) by the Heat Exchanger Method (HEM) and multi-wire Fixed Abrasive Slicing Technique (FAST), as a means of reducing the cost of solar arrays for adaptation of photovoltaic technology for terrestrial applications, is given. A schematic of a HEM furnace, which includes a silica crucible, and developments in the HEM process are presented. A new machine for slicing with wire was designed and fabricated. The high-speed slicer has been used to slice 19 wafers per cm from 10 cm diameter crystals. Both HEM and FAST are low-cost processes and they have the potential of giving one of the lowest add-on costs ($6.24 and $6.48 per square meter of sheet respectively, with the combination add-on cost of $14.87 per square meter) of this conversion.

Khattak, C. P.↗

Use of vacuum tubes in test instrumentation for measuring characteristics of fast high-voltage semiconductor devices

Circuits are described that permit measurement of fast events occurring in power semiconductors. These circuits were developed for the dynamic characterization of transistors used in inductive-load switching applications. Fast voltage clamping using vacuum diodes is discussed, and reference is made to a unique circuit that was built for performing nondestructive, reverse-bias, second-breakdown tests on transistors.

Berning, D.↗

Recovery time course in contractile function of fast and slow skeletal muscle after hindlimb immobilization

The present study was undertaken to characterize the time course and extent of recovery in the isometric and isotonic contractile properties of fast and slow skeletal muscle following 6 wk of hindlimb immobilization. Female Sprague-Dawley rats were randomly assigned to an immobilized group or a control group. The results of the study show that fast and slow skeletal muscles possess the ability to completely recover normal contractile function following 6 wk of hindlimb immobilization. The rate of recovery is dependent on the fiber type composition of the affected muscle.

Witzmann, F. A.↗

A fast hidden line algorithm for plotting finite element models

Effective plotting of finite element models requires the use of fast hidden line plot techniques that provide interactive response. A high speed hidden line technique was developed to facilitate the plotting of NASTRAN finite element models. Based on testing using 14 different models, the new hidden line algorithm (JONES-D) appears to be very fast: its speed equals that for normal (all lines visible) plotting and when compared to other existing methods it appears to be substantially faster. It also appears to be very reliable: no plot errors were observed using the new method to plot NASTRAN models. The new algorithm was made part of the NPLOT NASTRAN plot package and was used by structural analysts for normal production tasks.

Jones, G. K.↗