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 721 records · Page 40
All sourcesNASA NTRSDOE OSTI
NASA NTRS1996

Fast Nitrogen Atoms from Dissociative Excitation of N2 by Electron Impact

The Doppler profiles of one of the fine structure lines of the N I (1200 A) g (sup 4)S(sup 0)-(sup 4)P multiplet and of the N II (1085 A) g (sup 3)p(sup O)-(sup 3)D multiplet have been measured. Excitation of the multiplets is produced by electron impact dissociative excitation of N2. The experimental line profiles are evaluated by fast Fourier transform (FFT) techniques and analysis of the profiles yields the kinetic energy distribution of fragments. The full width at half maximum (FWHM) of N I (1200 A) increases from 27+/-6 mA at 30 eV to 37+/-4 mA at 100 eV as the emission cross section of the dissociative ionization excitation process becomes more important relative to the dissociative excitation process. The FWHM of the N II (1085 A) line is 36+/-4 mA at 100 eV. For each multiplet the kinetic energy distribution function of each of the two fragment N atoms (ions) is much broader than thermal with a mean energy above 1.0 eV. The dissociation process with the largest cross section is predissociation and predominantly produces N atoms with kinetic energy distributions having mean energies above 0.5 eV. Dissociative processes can lead to a substantial escape flux of N I atoms from the satellites, Titan and Triton of the outer planets.

Ajello, Joseph M.↗
NASA NTRS1999

Development and Validation of a Fast, Accurate and Cost-Effective Aeroservoelastic Method on Advanced Parallel Computing Systems

Progress to date towards the development and validation of a fast, accurate and cost-effective aeroelastic method for advanced parallel computing platforms such as the IBM SP2 and the SGI Origin 2000 is presented in this paper. The ENSAERO code, developed at the NASA-Ames Research Center has been selected for this effort. The code allows for the computation of aeroelastic responses by simultaneously integrating the Euler or Navier-Stokes equations and the modal structural equations of motion. To assess the computational performance and accuracy of the ENSAERO code, this paper reports the results of the Navier-Stokes simulations of the transonic flow over a flexible aeroelastic wing body configuration. In addition, a forced harmonic oscillation analysis in the frequency domain and an analysis in the time domain are done on a wing undergoing a rigid pitch and plunge motion. Finally, to demonstrate the ENSAERO flutter-analysis capability, aeroelastic Euler and Navier-Stokes computations on an L-1011 wind tunnel model including pylon, nacelle and empennage are underway. All computational solutions are compared with experimental data to assess the level of accuracy of ENSAERO. As the computations described above are performed, a meticulous log of computational performance in terms of wall clock time, execution speed, memory and disk storage is kept. Code scalability is also demonstrated by studying the impact of varying the number of processors on computational performance on the IBM SP2 and the Origin 2000 systems.

Goodwin, Sabine A.↗
NASA NTRS1998

A Spherical Torus Nuclear Fusion Reactor Space Propulsion Vehicle Concept for Fast Interplanetary Travel

A conceptual vehicle design enabling fast outer solar system travel was produced predicated on a small aspect ratio spherical torus nuclear fusion reactor. Initial requirements were for a human mission to Saturn with a greater than 5% payload mass fraction and a one way trip time of less than one year. Analysis revealed that the vehicle could deliver a 108 mt crew habitat payload to Saturn rendezvous in 235 days, with an initial mass in low Earth orbit of 2,941 mt. Engineering conceptual design, analysis, and assessment was performed on all ma or systems including payload, central truss, nuclear reactor (including divertor and fuel injector), power conversion (including turbine, compressor, alternator, radiator, recuperator, and conditioning), magnetic nozzle, neutral beam injector, tankage, start/re-start reactor and battery, refrigeration, communications, reaction control, and in-space operations. Detailed assessment was done on reactor operations, including plasma characteristics, power balance, power utilization, and component design.

Williams, Craig H.↗
NASA NTRS1984

Selection of Slow and Fast Variables in the Three-Dimensional Flight Dynamics

A transformation from the altitude and velocity state variables of three-dimensional flight mechanics to a new set of more desirable variables is found. The new variables provide a greater time-scale separation, decrease system coupling, and give better estimates of the fast-variable values along the reduced solution. One of the new variables is the often-used specific energy, whereas the other variable changes along a given trajectory, depending on the nature of the local reduced solution. Numerical examples are included.

Ardema, M.↗
NASA NTRS1998

Velocity Estimates of Fast-Moving Outlet Glaciers on the Greenland Ice Sheet

In recent years, airborne laser altimetry has been used with great success to investigate the mass balance characteristics of the Greenland ice sheet. One spinoff of this activity has been the application of these measurements to the study of surface velocities in some of Greenland's fast-moving drainage glaciers. This is accomplished by tracking the motion of elevation features, primarily crevasses, in pairs of aircraft laser altimetry surveys. Detailed elevation measurements are made along or across glaciers of interest with a scanning swath of 150 to 200 meters, and the surveys are repeated several days later, typically to within better than 50 meters of the previous flight line. Surface elevation features are identified in each image, and their offsets are compared yielding detailed velocities over narrow regions. During the 1998 field season, repeat flights were made over three glaciers for the purpose of estimating their surface velocities. These were the Kangerdlugssuaq and Helheim glaciers on the east coast and the Jakobshavn Isbrae on the west coast. Each flows at such high speeds (on the order of a few kilometers per year) that their flow rates are difficult to assess by means of radar interferometry. The flexibility of the aircraft platform, however, allows for detailed measurements of the elevation and flow of these drainage areas, which are responsible for a significant portion of the ice discharge from the Greenland ice sheet. Velocity estimates for transects that span these glaciers will be presented, and where the ice thickness values are available (provided by researchers from the University of Kansas) the fluxes will be calculated.

Abdalati, Waleed↗
NASA NTRS1975

Advances in Application of Fast Semidirect Computational Methods in Transonic Flow

This paper is intended as a review and summary of the advances made in a recently developed approach for rapid numerical solution of the equations of inviscid transonic aerodynamics. The investigation has been limited to two-dimensional, steady, inviscid flow over airfoils in a subsonic free stream, with emphasis on development of a rapid computational technique, rather than on generality of application. The approach uses finite-difference algorithms called "fast direct elliptic solvers" within an iteration scheme. "Direct" means that the entire computation field is solved at once, rather than in successive traverses over the field as in a point- or line-relaxation method. Such an iterative method is referred to as "semidirect." The iterative convergence can be faster than in other relaxation methods because changes are felt simultaneously at all points in each succeeding iteration. Direct elliptic solvers and semidirect methods have restrictions, but these are gradually being removed. Direct solvers were first developed for solving Poisson's equation on a rectangle without interior boundaries. A method to treat first-order systems, a direct Cauchy-Riemann solver has also been developed. Numerical treatment of part of a system of nonlinear equations by a Poisson solver has been reported. Also Poisson solvers in semidirect methods were used for nonseparable elliptic equations. The semidirect method was extended to the solution of a problem of mixed type, where the improved Murman-Cole transonic small-disturbance difference equations were solved. A slightly supercritical flow over a biconvex airfoil was treated successfully, but the iterations did not converge for more strongly supercritical conditions In another work the addition of terms ot both sides of the difference equations stabilized the iteration for supercritical conditions with large supersonic zones. For this, the Cauchy-Riemann solver was revised to incl,ude the needed terms. Most recently, the evaluation of parameters for rapid convergence and comparisons, with Murman's line-relaxation method was described. The method was extended to full second order accuracy in a fully conservative formulation in another work.

Martin, E. Dale↗
NASA NTRS2000

On Fast Post-Processing of Global Positioning System Simulator Truth Data and Receiver Measurements and Solutions Data

Post-Processing of data related to a Global Positioning System (GPS) simulation is an important activity in qualification of a GPS receiver for space flight. Because a GPS simulator is a critical resource it is desirable to move off the pertinent simulation data from the simulator as soon as a test is completed. The simulator data files are usually moved to a Personal Computer (PC), where the post-processing of the receiver logged measurements and solutions data and simulated data is performed. Typically post-processing is accomplished using PC-based commercial software languages and tools. Because of commercial software systems generality their general-purpose functions are notoriously slow and more than often are the bottleneck problem even for short duration experiments. For example, it may take 8 hours to post-process data from a 6-hour simulation. There is a need to do post-processing faster, especially in order to use the previous test results as feedback for a next simulation setup. This paper demonstrates that a fast software linear interpolation algorithm is applicable to a large class of engineering problems, like GPS simulation data post-processing, where computational time is a critical resource and is one of the most important considerations. An approach is developed that allows to speed-up post-processing by an order of magnitude. It is based on improving the post-processing bottleneck interpolation algorithm using apriori information that is specific to the GPS simulation application. The presented post-processing scheme was used in support of a few successful space flight missions carrying GPS receivers. A future approach to solving the post-processing performance problem using Field Programmable Gate Array (FPGA) technology is described.

Kizhner, Semion↗
NASA NTRS2000

A New Fast Algorithm to Completely Account for Non-Lambertian Surface Reflection of The Earth

Surface bidirectional reflectance distribution function (BRDF) influences not only radiance just about the surface, but that emerging from the top of the atmosphere (TOA). In this study we propose a new, fast and accurate, algorithm CASBIR (correction for anisotropic surface bidirectional reflection) to account for such influences on radiance measured above TOA. This new algorithm is based on a 4-stream theory that separates the radiation field into direct and diffuse components in both upwelling and downwelling directions. This is important because the direct component accounts for a substantial portion of incident radiation under a clear sky, and the BRDF effect is strongest in the reflection of the direct radiation reaching the surface. The model is validated by comparison with a full-scale, vector radiation transfer model for the atmosphere-surface system. The result demonstrates that CASBIR performs very well (with overall relative difference of less than one percent) for all solar and viewing zenith and azimuth angles considered in wavelengths from ultraviolet to near-infrared over three typical, but very different surface types. Application of this algorithm includes both accounting for non-Lambertian surface scattering on the emergent radiation above TOA and a potential approach for surface BRDF retrieval from satellite measured radiance.

Qin, Wen-Han↗
NASA NTRS1997

Fast Fuzzy Arithmetic Operations

In engineering applications of fuzzy logic, the main goal is not to simulate the way the experts really think, but to come up with a good engineering solution that would (ideally) be better than the expert's control, In such applications, it makes perfect sense to restrict ourselves to simplified approximate expressions for membership functions. If we need to perform arithmetic operations with the resulting fuzzy numbers, then we can use simple and fast algorithms that are known for operations with simple membership functions. In other applications, especially the ones that are related to humanities, simulating experts is one of the main goals. In such applications, we must use membership functions that capture every nuance of the expert's opinion; these functions are therefore complicated, and fuzzy arithmetic operations with the corresponding fuzzy numbers become a computational problem. In this paper, we design a new algorithm for performing such operations. This algorithm is applicable in the case when negative logarithms - log(u(x)) of membership functions u(x) are convex, and reduces computation time from O(n(exp 2))to O(n log(n)) (where n is the number of points x at which we know the membership functions u(x)).

Hampton, Michael↗
NASA NTRS2001

Fast Quaternion Attitude Estimation from Two Vector Measurements

Many spacecraft attitude determination methods use exactly two vector measurements. The two vectors are typically the unit vector to the Sun and the Earth's magnetic field vector for coarse "sun-mag" attitude determination or unit vectors to two stars tracked by two star trackers for fine attitude determination. Existing closed-form attitude estimates based on Wahba's optimality criterion for two arbitrarily weighted observations are somewhat slow to evaluate. This paper presents two new fast quaternion attitude estimation algorithms using two vector observations, one optimal and one suboptimal. The suboptimal method gives the same estimate as the TRIAD algorithm, at reduced computational cost. Simulations show that the TRIAD estimate is almost as accurate as the optimal estimate in representative test scenarios.

Markley, F. Landis↗
NASA NTRS2001

Fast Computation of the Inverse CMH Model

A fast computational method based on differential equation approach for inverse DOK model has been extended for the inverse CMH model. Also, a cobweb technique for calculating the inverse CMH model is also presented. The two techniques are differed from the point of view of flexibility and computation time.

Patel, Umesh D.↗
NASA NTRS2001

Fast Computation of CMH Model

A fast differential equation approach for the DOK model has been extented to the CMH model. Also, a cobweb technique for calculating the CMH model is also presented. The two techniques are contrasted from the point of view of flexibility and computation time.

Patel, Umesh D.↗
NASA NTRS1997

Fast Context Switching in Real-Time Propositional Reasoning

The trend to increasingly capable and affordable control processors has generated an explosion of embedded real-time gadgets that serve almost every function imaginable. The daunting task of programming these gadgets is greatly alleviated with real-time deductive engines that perform all execution and monitoring functions from a single core model, Fast response times are achieved using an incremental propositional deductive database (an LTMS). Ideally the cost of an LTMS's incremental update should be linear in the number of labels that change between successive contexts. Unfortunately an LTMS can expend a significant percentage of its time working on labels that remain constant between contexts. This is caused by the LTMS's conservative approach: a context switch first removes all consequences of deleted clauses, whether or not those consequences hold in the new context. This paper presents a more aggressive incremental TMS, called the ITMS, that avoids processing a significant number of these consequences that are unchanged. Our empirical evaluation for spacecraft control shows that the overhead of processing unchanged consequences can be reduced by a factor of seven.

Nayak, P. Pandurang↗
NASA NTRS2002

Fast Three-Dimensional Method of Modeling Atomic Oxygen Undercutting of Protected Polymers

A method is presented to model atomic oxygen erosion of protected polymers in low Earth orbit (LEO). Undercutting of protected polymers by atomic oxygen occurs in LEO due to the presence of scratch, crack or pin-window defects in the protective coatings. As a means of providing a better understanding of undercutting processes, a fast method of modeling atomic-oxygen undercutting of protected polymers has been developed. Current simulation methods often rely on computationally expensive ray-tracing procedures to track the surface-to-surface movement of individual "atoms." The method introduced in this paper replaces slow individual particle approaches by substituting a model that utilizes both a geometric configuration-factor technique, which governs the diffuse transport of atoms between surfaces, and an efficient telescoping series algorithm, which rapidly integrates the cumulative effects stemming from the numerous atomic oxygen events occurring at the surfaces of an undercut cavity. This new method facilitates the systematic study of three-dimensional undercutting by allowing rapid simulations to be made over a wide range of erosion parameters.

Snyder, Aaron↗
NASA NTRS2000

Gravitational Waves from Rotating Neutron Stars and Evaluation of fast Chirp Transform Techniques

X-ray observations suggest that neutron stars in low mass X-ray binaries (LMXB) are rotating with frequencies from 300 - 600 Hz. These spin rates are significantly less than the break-up rates for essentially all realistic neutron star equations of state, suggesting that some process may limit the spin frequencies of accreting neutron stars to this range. If the accretion induced spin up torque is in equilibrium with gravitational radiation losses, these objects could be interesting sources of gravitational waves. I present a brief summary of current measurements of neutron star spins in LMXBs based on the observations of high-Q oscillations during thermonuclear bursts (so called 'burst oscillations'). Further measurements of neutron star spins will be important in exploring the gravitational radiation hypothesis in more detail. To this end I also present a study of fast chirp transform (FCT) techniques as described by Jenet and Prince in the context of searching for the chirping signals observed during X-ray bursts.

Strohmayer, Tod E.↗
NASA NTRS2002

Radioisotope Electric Propulsion for Fast Outer Planetary Orbiters

Recent interest in outer planetary targets by the Office of Space Science has spurred the search for technology options to enable relatively quick missions to outer planetary targets. Several options are being explored including solar electric propelled stages combined with aerocapture at the target and nuclear electric propulsion. Another option uses radioisotope powered electric thrusters to reach the outer planets. Past work looked at using this technology to provide faster flybys. A better use for this technology is for outer planet orbiters. Combined with medium class launch vehicles and a new direct trajectory these small, sub-kilowatt ion thrusters and Stirling radioisotope generators were found to allow missions as fast as 5 to 12 years for objects from Saturn to Pluto, respectively. Key to the development is light spacecraft and science payload technologies.

Oleson, Steven↗
NASA NTRS2003

A Fast Implementation of the ISOCLUS Algorithm

Unsupervised clustering is a fundamental building block in numerous image processing applications. One of the most popular and widely used clustering schemes for remote sensing applications is the ISOCLUS algorithm, which is based on the ISODATA method. The algorithm is given a set of n data points in d-dimensional space, an integer k indicating the initial number of clusters, and a number of additional parameters. The general goal is to compute the coordinates of a set of cluster centers in d-space, such that those centers minimize the mean squared distance from each data point to its nearest center. This clustering algorithm is similar to another well-known clustering method, called k-means. One significant feature of ISOCLUS over k-means is that the actual number of clusters reported might be fewer or more than the number supplied as part of the input. The algorithm uses different heuristics to determine whether to merge lor split clusters. As ISOCLUS can run very slowly, particularly on large data sets, there has been a growing .interest in the remote sensing community in computing it efficiently. We have developed a faster implementation of the ISOCLUS algorithm. Our improvement is based on a recent acceleration to the k-means algorithm of Kanungo, et al. They showed that, by using a kd-tree data structure for storing the data, it is possible to reduce the running time of k-means. We have adapted this method for the ISOCLUS algorithm, and we show that it is possible to achieve essentially the same results as ISOCLUS on large data sets, but with significantly lower running times. This adaptation involves computing a number of cluster statistics that are needed for ISOCLUS but not for k-means. Both the k-means and ISOCLUS algorithms are based on iterative schemes, in which nearest neighbors are calculated until some convergence criterion is satisfied. Each iteration requires that the nearest center for each data point be computed. Naively, this requires O(kn) time, where k denotes the current number of centers. Traditional techniques for accelerating nearest neighbor searching involve storing the k centers in a data structure. However, because of the iterative nature of the algorithm, this data structure would need to be rebuilt with each new iteration. Our approach is to store the data points in a kd-tree data structure. The assignment of points to nearest neighbors is carried out by a filtering process, which successively eliminates centers that can not possibly be the nearest neighbor for a given region of space. This algorithm is significantly faster, because large groups of data points can be assigned to their nearest center in a single operation. Preliminary results on a number of real Landsat datasets show that our revised ISOCLUS-like scheme runs about twice as fast.

Memarsadeghi, Nargess↗
NASA NTRS2003

A Fast Implementation of the ISOCLUS Algorithm

Unsupervised clustering is a fundamental tool in numerous image processing and remote sensing applications. For example, unsupervised clustering is often used to obtain vegetation maps of an area of interest. This approach is useful when reliable training data are either scarce or expensive, and when relatively little a priori information about the data is available. Unsupervised clustering methods play a significant role in the pursuit of unsupervised classification. One of the most popular and widely used clustering schemes for remote sensing applications is the ISOCLUS algorithm, which is based on the ISODATA method. The algorithm is given a set of n data points (or samples) in d-dimensional space, an integer k indicating the initial number of clusters, and a number of additional parameters. The general goal is to compute a set of cluster centers in d-space. Although there is no specific optimization criterion, the algorithm is similar in spirit to the well known k-means clustering method in which the objective is to minimize the average squared distance of each point to its nearest center, called the average distortion. One significant feature of ISOCLUS over k-means is that clusters may be merged or split, and so the final number of clusters may be different from the number k supplied as part of the input. This algorithm will be described in later in this paper. The ISOCLUS algorithm can run very slowly, particularly on large data sets. Given its wide use in remote sensing, its efficient computation is an important goal. We have developed a fast implementation of the ISOCLUS algorithm. Our improvement is based on a recent acceleration to the k-means algorithm, the filtering algorithm, by Kanungo et al.. They showed that, by storing the data in a kd-tree, it was possible to significantly reduce the running time of k-means. We have adapted this method for the ISOCLUS algorithm. For technical reasons, which are explained later, it is necessary to make a minor modification to the ISOCLUS specification. We provide empirical evidence, on both synthetic and Landsat image data sets, that our algorithm's performance is essentially the same as that of ISOCLUS, but with significantly lower running times. We show that our algorithm runs from 3 to 30 times faster than a straightforward implementation of ISOCLUS. Our adaptation of the filtering algorithm involves the efficient computation of a number of cluster statistics that are needed for ISOCLUS, but not for k-means.

Memarsadeghi, Nargess↗