Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “fast algorithm”

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 685 records · Page 38
All sourcesNASA NTRSDOE OSTI
NASA NTRS1985

Graphics and flow visualization in computational fluid dynamics

Techniques for displaying two- and three-dimensional flowfield solutions are described. Several methods of illustrating flow structure are addressed including particle tracing, simulated oil flow, and shock finding. These are incorporated into an interactive graphics program for CFD flowfields, called PLOT3D. Emphasis is made on the difficulty in visualizing three-dimensional flow features, and the importance of color, fast 3D image manipulation, and dynamic movie play-back in displaying such flows. The need for advanced algorithms to identify shock waves, vortices, and separation lines is pointed out. It is likely that the supercomputer will be needed for this process because of the size of 3D and/or unsteady CFD databases.

Buning, P. G.↗
NASA NTRS1988

Near-optimal output feedback regulation of ill-conditioned linear systems

A two-time scale approximation for the linear quadratic optimal output feedback regulator program is examined. Necessary conditions for optimality, as well as an algorithm for computing locally near-optimal gains are derived. If it is assumed that the slow and fast subsystem initial conditions are uniformly distributed, optimal gains for the two-time-scale problem provide a second-order approximation to optimal closed-loop performance in the unperturbed system. This is verified with a numerical example.

Moerder, Daniel D.↗
NASA NTRS1989

Quotient-difference type generalizations of the power method and their analysis

The recursion relations that were proposed by W. F. Ford and A. Sidi (Appl. Numer. Math, 4 (1988), pp. 477-489) for implementing vector extrapolation methods are used for devising generalizations of the power method for linear operators. These generalizations are shown to produce approximations to largest eigenvalues of a linear operator under certain conditions. They are similar in form to the quotient-difference algorithm and share similar convergence properties with the latter. These convergence properties also resemble those obtained for the basic LR and QR algorithms. Finally, it is shown that the convergence rate produced by one fo these generalizations is twice as fast for normal operators as it is for nonnormal operators.

Sidi, Avram↗
NASA NTRS1991

COBE experience with filter QUEST

A gyro based filter variation on the standard QUEST attitude determination algorithm is applied to the Cosmic Background Explorer (COBE). Filter QUEST is found to be three times as fast as the batch estimator and slightly more accurate than regular QUEST. Perhaps more important than its speed or accuracy is the fact that Filter QUEST can provide real time attitude solutions when regular QUEST cannot, due to lack of observability. Filter QUEST is also easy to use and adjust for the proper memory length. Suitable applications for Filter QUEST include coarse and real time attitude determination.

Filla, O.↗
NASA NTRS1993

Multiphase complete exchange: A theoretical analysis

Complete Exchange requires each of N processors to send a unique message to each of the remaining N-1 processors. For a circuit switched hypercube with N = 2(sub d) processors, the Direct and Standard algorithms for Complete Exchange are optimal for very large and very small message sizes, respectively. For intermediate sizes, a hybrid Multiphase algorithm is better. This carries out Direct exchanges on a set of subcubes whose dimensions are a partition of the integer d. The best such algorithm for a given message size m could hitherto only be found by enumerating all partitions of d. The Multiphase algorithm is analyzed assuming a high performance communication network. It is proved that only algorithms corresponding to equipartitions of d (partitions in which the maximum and minimum elements differ by at most 1) can possibly be optimal. The run times of these algorithms plotted against m form a hull of optimality. It is proved that, although there is an exponential number of partitions, (1) the number of faces on this hull is Theta(square root of d), (2) the hull can be found in theta(square root of d) time, and (3) once it has been found, the optimal algorithm for any given m can be found in Theta(log d) time. These results provide a very fast technique for minimizing communication overhead in many important applications, such as matrix transpose, Fast Fourier transform, and ADI.

Bokhari, Shahid H.↗
NASA NTRS1996

Spectral imaging applications: Remote sensing, environmental monitoring, medicine, military operations, factory automation and manufacturing

This paper reviews the activities at OKSI related to imaging spectroscopy presenting current and future applications of the technology. The authors discuss the development of several systems including hardware, signal processing, data classification algorithms and benchmarking techniques to determine algorithm performance. Signal processing for each application is tailored by incorporating the phenomenology appropriate to the process, into the algorithms. Pixel signatures are classified using techniques such as principal component analyses, generalized eigenvalue analysis and novel very fast neural network methods. The major hyperspectral imaging systems developed at OKSI include the Intelligent Missile Seeker (IMS) demonstration project for real-time target/decoy discrimination, and the Thermal InfraRed Imaging Spectrometer (TIRIS) for detection and tracking of toxic plumes and gases. In addition, systems for applications in medical photodiagnosis, manufacturing technology, and for crop monitoring are also under development.

National Defense↗
NASA NTRS2005

Thermodynamic and cloud parameter retrieval using infrared spectral data

High-resolution infrared radiance spectra obtained from near nadir observations provide atmospheric, surface, and cloud property information. A fast radiative transfer model, including cloud effects, is used for atmospheric profile and cloud parameter retrieval. The retrieval algorithm is presented along with its application to recent field experiment data from the NPOESS Airborne Sounding Testbed - Interferometer (NAST-I). The retrieval accuracy dependence on cloud properties is discussed. It is shown that relatively accurate temperature and moisture retrievals can be achieved below optically thin clouds. For optically thick clouds, accurate temperature and moisture profiles down to cloud top level are obtained. For both optically thin and thick cloud situations, the cloud top height can be retrieved with an accuracy of approximately 1.0 km. Preliminary NAST-I retrieval results from the recent Atlantic-THORPEX Regional Campaign (ATReC) are presented and compared with coincident observations obtained from dropsondes and the nadir-pointing Cloud Physics Lidar (CPL).

Zhou, Daniel K.↗
NASA NTRS2001

Passive imaging based hazard avoidance for spacecraft safe landing

In this paper, a new and fast passive sensing based hazard avoidance approach for spacecraft safe landing is suggested. This approach contains two important algorithms: a texture based landing site selection algorithm and a landing site slope estimation algorithm.

spacecraft safe landing passive imaging homography↗
NASA NTRS2008

Magnetotail Current Sheet Thinning and Magnetic Reconnection Dynamics in Global Modeling of Substorms

Magnetotail current sheet thinning and magnetic reconnection are key elements of magnetospheric substorms. We utilized the global MHD model BATS-R-US with Adaptive Mesh Refinement developed at the University of Michigan to investigate the formation and dynamic evolution of the magnetotail thin current sheet. The BATSRUS adaptive grid structure allows resolving magnetotail regions with increased current density up to ion kinetic scales. We investigated dynamics of magnetotail current sheet thinning in response to southwards IMF turning. Gradual slow current sheet thinning during the early growth phase become exponentially fast during the last few minutes prior to nightside reconnection onset. The later stage of current sheet thinning is accompanied by earthward flows and rapid suppression of normal magnetic field component $B-z$. Current sheet thinning set the stage for near-earth magnetic reconnection. In collisionless magnetospheric plasma, the primary mechanism controlling the dissipation in the vicinity of the reconnection site is non-gyrotropic effects with spatial scales comparable with the particle Larmor radius. One of the major challenges in global MHD modeling of the magnetotail magnetic reconnection is to reproduce fast reconnection rates typically observed in smallscale kinetic simulations. Bursts of fast reconnection cause fast magnetic field reconfiguration typical for magnetospheric substorms. To incorporate nongyritropic effects in diffusion regions we developed an algorithm to search for magnetotail reconnection sites, specifically where the magnetic field components perpendicular to the local current direction approaches zero and form an X-type configuration. Spatial scales of the diffusion region and magnitude of the reconnection electric field are calculated self-consistently using MHD plasma and field parameters in the vicinity of the reconnection site. The location of the reconnection sites and spatial scales of the diffusion region are updated during the simulations. Such an approach allows quantifying the interaction between large-scale global magnetospheric dynamics and microphysical processes in diffusion regions localized near reconnection sites. To clarify the role of smallscale non-MHD effects in diffusion region on the global magnetospheric dynamic and to test different models of dissipation we perform simulations with steady southward IMF driving of the magnetosphere.

Kuznetsova, M. M.↗
NASA NTRS2018

Solar Sail Transfers from Invariant Objects to L5 Periodic Orbits

The rising interest in a mission to the Sun-Earth L5 point for heliophysics or Trojan asteroid search and the development of solar sails has opened the question of using solar radiation pressure for such a mission. Different solar sail trajectories to the Sun-Earth L5 point are constructed. Different invariant objects in the neighbourhood of Earth are considered for departure: equilibrium points, families of periodic orbits and their associated invariant manifold. Using a multi-objective genetic algorithm, differential correction and the optimal control solver PSOPT the transfers are obtained. The approach followed results in fast solar sail transfers which can be used for the preliminary design of a mission to the Sun-Earth L5 point.

Fernandez, Alvaro↗
NASA NTRS1983

A parallel-pipeline architecture of the fast polynomial transform for computing a two-dimensional cyclic convolution

It is pointed out that the two-dimensional cyclic convolution is a useful tool for many two-dimensional digital signal processing applications. Two important applications are related to spaceborne high-resolution synthetic aperture radar (SAR) processing and image processing. Nussbaumer and Quandalle (1978) showed that a radix-2 polynomial transform analogous to the conventional radix-2 FFT algorithm can be used to compute a two-dimensional cyclic convolution. On the basis of results reported by Arambepola and Rayner (1979), a radix-2 polynomial transform can be defined to compute a multidimensional cyclic convolution. Truong et al. (1981) used the considered ideas together with the Chinese Theorem to further reduce the complexity of the radix-2 fast polynomial transform (FPT). Reed et al. (1981) demonstrated that such a new FPT algorithm is significantly faster than the FFT algorithm for computing a two-dimensional convolution. In the present investigation, a parallel-pipeline architecture is considered for implementing the FPT developed by Truong et al.

Truong, T. K.↗
NASA NTRS1989

Some fast elliptic solvers on parallel architectures and their complexities

The discretization of separable elliptic partial differential equations leads to linear systems with special block triangular matrices. Several methods are known to solve these systems, the most general of which is the Block Cyclic Reduction (BCR) algorithm which handles equations with nonconsistant coefficients. A method was recently proposed to parallelize and vectorize BCR. Here, the mapping of BCR on distributed memory architectures is discussed, and its complexity is compared with that of other approaches, including the Alternating-Direction method. A fast parallel solver is also described, based on an explicit formula for the solution, which has parallel computational complexity lower than that of parallel BCR.

Gallopoulos, E.↗
NASA NTRS1993

A multi-level solution algorithm for steady-state Markov chains

A new iterative algorithm, the multi-level algorithm, for the numerical solution of steady state Markov chains is presented. The method utilizes a set of recursively coarsened representations of the original system to achieve accelerated convergence. It is motivated by multigrid methods, which are widely used for fast solution of partial differential equations. Initial results of numerical experiments are reported, showing significant reductions in computation time, often an order of magnitude or more, relative to the Gauss-Seidel and optimal SOR algorithms for a variety of test problems. The multi-level method is compared and contrasted with the iterative aggregation-disaggregation algorithm of Takahashi.

Horton, Graham↗
NASA NTRS1992

An efficient and robust grid optimization algorithm

The development of an efficient and robust grid optimization is presented. This algorithm is developed by combining the best characteristics of algebraic, elliptic, and hyperbolic grid generation techniques. This development is based on the following observations and evaluations: (1) algebraic systems are fast and economical; (2) precise spacing control is always achieved; (3) grid generation by elliptic systems is always smooth; and (4) the hyperbolic system preserves the orthogonality at the solid boundary and the point distribution in the field. Computational examples representing practical internal flow configurations are presented to demonstrate the algorithm.

Soni, Bharat K.↗
NASA NTRS1989

Some fast elliptic solvers on parallel architectures and their complexities

The discretization of separable elliptic partial differential equations leads to linear systems with special block tridiagonal matrices. Several methods are known to solve these systems, the most general of which is the Block Cyclic Reduction (BCR) algorithm which handles equations with nonconstant coefficients. A method was recently proposed to parallelize and vectorize BCR. In this paper, the mapping of BCR on distributed memory architectures is discussed, and its complexity is compared with that of other approaches including the Alternating-Direction method. A fast parallel solver is also described, based on an explicit formula for the solution, which has parallel computational compelxity lower than that of parallel BCR.

Gallopoulos, E.↗
NASA NTRS1990

Trajectory optimization for real-time guidance. I - Time-varying LQR on a parallel processor

A key algorithmic element of a real-time trajectory optimization hardware/software implementation, the quadratic program (QP) solver element, is presented. The purpose of the effort is to make nonlinear trajectory optimization fast enough to provide real-time commands during guidance of a vehicle such as an aeromaneuvering orbiter. Many methods of nonlinear programming require the solution of a QP at each iteration. In the trajectory optimization case the QP has a special dynamic programming structure, a LQR-like structure. QP algorithm speed is increased by taking advantage of this special structure and by parallel implementation.

Psiaki, Mark L.↗
NASA NTRS1978

Feasibility of a special-purpose computer to solve the Navier-Stokes equations

Orders-of-magnitude improvements in computer performance can be realized with a parallel array of thousands of fast microprocessors. In this architecture, wiring congestion is minimized by limiting processor communication to nearest neighbors. When certain standard algorithms are applied to a viscous flow problem and existing LSI technology is used, performance estimates of this conceptual design show a dramatic decrease in computational time when compared to the CDC 7600.

Gritton, E. C.↗
NASA NTRS1980

Application of fully stressed design procedures to redundant and non-isotropic structures

An evaluation is presented of fully stressed design procedures for sizing highly redundant structures including structures made of composite materials. The evaluation is carried out by sizing three structures: a simple box beam of either composite or metal construction; a low aspect ratio titanium wing; and a titanium arrow wing for a conceptual supersonic cruise aircraft. All three structures are sized by ordinary fully-stressed design (FSD) and thermal fully stressed design (TFSD) for combined mechanical and thermal loads. Where possible, designs are checked by applying rigorous mathematical programming techniques to the structures. It is found that FSD and TFSD produce optimum designs for the metal box beam, but produce highly non-optimum designs for the composite box beam. Results from the delta wing and arrow wing indicate that FSD and TFSD exhibits slow convergence for highly redundant metal structures. Further, TFSD exhibits slow oscillatory convergence behavior for the arrow wing for very high temperatures. In all cases where FSD and TFSD perform poorly either in obtaining nonoptimum designs or in converging slowly, the assumptions on which the algorithms are based are grossly violated. The use of scaling, however, is found to be very effective in obtaining fast convergence and efficiently produces safe designs even for those cases when FSD and TFSD alone are ineffective.

Adelman, H. M.↗