Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “computing methods”

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 1,639 records · Page 91

Numerical simulation of the flow about the F-18 HARV at high angle of attack

This report summarizes research done over the past two years as part of NASA Grant NCC 2-729. This research has been aimed at validating numerical methods for computing the flow about the complete F-18 HARV at alpha = 30 deg and alpha = 45 deg. At 30 deg angle of attack, the flow about the F-18 is dominated by the formation, and subsequent breakdown, of strong vortices over the wing leading-edge extensions (LEX). As the angle of attack is increased to alpha = 45 deg, the fuselage forebody of the F-18 contains significant laminar and transitional regions which are not present at alpha = 30 deg. Further, the flow over the LEX at alpha = 45 deg is dominated by an unsteady shedding in time, rather than strong coherent vortices. This complex physics, combined with the complex geometry of a full aircraft configuration, provides a challenge for current computational fluid dynamics (CFD) techniques. The following sections present the numerical method and grid generation scheme that was used, a review of prior research done to numerically model the F-18 HARV, and a discussion of the current research. The current research is broken into two main topics: the effect of engine-inlet mass-flow rate on the F-18 vortex breakdown position, and the results using a refined F-18 computational model to compute the flow at alpha = 30 deg and alpha = 45 deg.

Murman, Scott M.↗

Dynamic analysis of astronaut motions in microgravity: Applications for Extravehicular Activity (EVA)

Simulations of astronaut motions during extravehicular activity (EVA) tasks were performed using computational multibody dynamics methods. The application of computational dynamic simulation to EVA was prompted by the realization that physical microgravity simulators have inherent limitations: viscosity in neutral buoyancy tanks; friction in air bearing floors; short duration for parabolic aircraft; and inertia and friction in suspension mechanisms. These limitations can mask critical dynamic effects that later cause problems during actual EVA's performed in space. Methods of formulating dynamic equations of motion for multibody systems are discussed with emphasis on Kane's method, which forms the basis of the simulations presented herein. Formulation of the equations of motion for a two degree of freedom arm is presented as an explicit example. The four basic steps in creating the computational simulations were: system description, in which the geometry, mass properties, and interconnection of system bodies are input to the computer; equation formulation based on the system description; inverse kinematics, in which the angles, velocities, and accelerations of joints are calculated for prescribed motion of the endpoint (hand) of the arm; and inverse dynamics, in which joint torques are calculated for a prescribed motion. A graphical animation and data plotting program, EVADS (EVA Dynamics Simulation), was developed and used to analyze the results of the simulations that were performed on a Silicon Graphics Indigo2 computer. EVA tasks involving manipulation of the Spartan 204 free flying astronomy payload, as performed during Space Shuttle mission STS-63 (February 1995), served as the subject for two dynamic simulations. An EVA crewmember was modeled as a seven segment system with an eighth segment representing the massive payload attached to the hand. For both simulations, the initial configuration of the lower body (trunk, upper leg, and lower leg) was a neutral microgravity posture. In the first simulation, the payload was manipulated around a circular trajectory of 0.15 m radius in 10 seconds. It was found that the wrist joint theoretically exceeded its ulnal deviation limit by as much as 49. 8 deg and was required to exert torques as high as 26 N-m to accomplish the task, well in excess of the wrist physiological limit of 12 N-m. The largest torque in the first simulation, 52 N-m, occurred in the ankle joint. To avoid these problems, the second simulation placed the arm in a more comfortable initial position and the radius and speed of the circular trajectory were reduced by half. As a result, the joint angles and torques were reduced to values well within their physiological limits. In particular, the maximum wrist torque for the second simulation was only 3 N-m and the maximum ankle torque was only 6 N-m.

Newman, Dava J.↗

Efficient Optimization of Low-Thrust Spacecraft Trajectories

A paper describes a computationally efficient method of optimizing trajectories of spacecraft driven by propulsion systems that generate low thrusts and, hence, must be operated for long times. A common goal in trajectory-optimization problems is to find minimum-time, minimum-fuel, or Pareto-optimal trajectories (here, Pareto-optimality signifies that no other solutions are superior with respect to both flight time and fuel consumption). The present method utilizes genetic and simulated-annealing algorithms to search for globally Pareto-optimal solutions. These algorithms are implemented in parallel form to reduce computation time. These algorithms are coupled with either of two traditional trajectory- design approaches called "direct" and "indirect." In the direct approach, thrust control is discretized in either arc time or arc length, and the resulting discrete thrust vectors are optimized. The indirect approach involves the primer-vector theory (introduced in 1963), in which the thrust control problem is transformed into a co-state control problem and the initial values of the co-state vector are optimized. In application to two example orbit-transfer problems, this method was found to generate solutions comparable to those of other state-of-the-art trajectory-optimization methods while requiring much less computation time.

Lee, Seungwon↗

Computation of Symmetric Discrete Cosine Transform Using Bakhvalov's Algorithm

A number of algorithms for recursive computation of the discrete cosine transform (DCT) have been developed recently. This paper presents a new method for computing the discrete cosine transform and its inverse using Bakhvalov's algorithm, a method developed for evaluation of a polynomial at a point. In this paper, we will focus on both the application of the algorithm to the computation of the DCT-I and its complexity. In addition, Bakhvalov s algorithm is compared with Clenshaw s algorithm for the computation of the DCT.

Aburdene, Maurice F.↗

Numerical solution of Euler's equation by perturbed functionals

A perturbed functional iteration has been developed to solve nonlinear systems. It adds at each iteration level, unique perturbation parameters to nonlinear Gauss-Seidel iterates which enhances its convergence properties. As convergence is approached these parameters are damped out. Local linearization along the diagonal has been used to compute these parameters. The method requires no computation of Jacobian or factorization of matrices. Analysis of convergence depends on properties of certain contraction-type mappings, known as D-mappings. In this article, application of this method to solve an implicit finite difference approximation of Euler's equation is studied. Some representative results for the well known shock tube problem and compressible flows in a nozzle are given.

Dey, S. K.↗

Euler solutions for the flow around a hovering helicopter rotor

A method for computing the flow around a hovering helicopter rotor is presented. The solution procedure is divided into two parts. The first part is a finite volume solution of the Euler equations for the near field flow around a rotor blade. The second part is a free wake approach for determining the wake geometry and induced velocities. These two parts are solved in a coupled fashion. The rolled-up vortex wake of the rotor is included in the Euler computational domain through a nonlinear perturbation technique. This eliminates the numerical diffusion of the wake vorticity due to truncation error and artificial viscosity without the need for excessive grid resolution near the vortex core. The method is used to compute both hovering rotor and wing/vortex interaction flows, and the results are compared to experiment.

Roberts, T. W.↗

Automatic design of optical systems by digital computer

Computer program uses geometrical optical techniques and a least squares optimization method employing computing equipment for the automatic design of optical systems. It evaluates changes in various optical parameters, provides comprehensive ray-tracing, and generally determines the acceptability of the optical system characteristics.

Casad, T. A.↗

Shock-fitted Euler solutions to shock vortex interactions

The interaction of a planar shock wave with one or more vortexes is computed using a pseudospectral method and a finite difference method. The development of the spectral method is emphasized. In both methods the shock wave is fitted as a boundary of the computational domain. The results show good agreement between both computational methods. The spectral method is, however, restricted to smaller time steps and requires use of filtering techniques.

Salas, M. D.↗

An efficient coordinate transformation technique for unsteady, transonic aerodynamic analysis of low aspect-ratio wings

An efficient coordinate transformation technique is presented for constructing grids for unsteady, transonic aerodynamic computations for delta-type wings. The original shearing transformation yielded computations that were numerically unstable and this paper discusses the sources of those instabilities. The new shearing transformation yields computations that are stable, fast, and accurate. Comparisons of those two methods are shown for the flow over the F5 wing that demonstrate the new stability. Also, comparisons are made with experimental data that demonstrate the accuracy of the new method. The computations were made by using a time-accurate, finite-difference, alternating-direction-implicit (ADI) algorithm for the transonic small-disturbance potential equation.

Guruswamy, G. P.↗

Shock-fitted Euler solutions to shock-vortex interactions

The interaction of a planar shock wave with one or more vortexes is computed using a pseudospectral method and a finite difference method. The development of the spectral method is emphasized. In both methods the shock wave is fitted as a boundary of the computational domain. The results show good agreement between both computational methods. The spectral method is, however, restricted to smaller time steps and requires use of filtering techniques. Previously announced in STAR as N82-28061

Salas, M. D.↗

The configuration of slow-mode shocks

A simple method for computing blunt-body flows containing slow shocks is presented. The method is based on the solution of a free-boundary problem for the shock configuration that matches a postshock potential flow to a uniform preshock flow. The method is applied to shocks arising from flow about spherical and paraboloidal obstacles. The results of a parametric study of shock formation as a function of sonic and Alfven Mach numbers showed that when either Mach number decreased, the standoff distance increased. The results should give estimates of the location and the configuration of slow shocks, provided that two as yet unverified assumptions are correct: (1) that the standoff distance and the slow-shock configuration along the stagnation streamline are not affected significantly by portions of the shock still forming far upstream of the shock nose, and (2) that fast-mode waves propagating at small angles to the magnetic field do not significantly affect the formation of the slow shock.

Wolfson, Richard↗

Neural Network Based Sensory Fusion for Landmark Detection

NASA is planning to send numerous unmanned planetary missions to explore the space. This requires autonomous robotic vehicles which can navigate in an unstructured, unknown, and uncertain environment. Landmark based navigation is a new area of research which differs from the traditional goal-oriented navigation, where a mobile robot starts from an initial point and reaches a destination in accordance with a pre-planned path. The landmark based navigation has the advantage of allowing the robot to find its way without communication with the mission control station and without exact knowledge of its coordinates. Current algorithms based on landmark navigation however pose several constraints. First, they require large memories to store the images. Second, the task of comparing the images using traditional methods is computationally intensive and consequently real-time implementation is difficult. The method proposed here consists of three stages, First stage utilizes a heuristic-based algorithm to identify significant objects. The second stage utilizes a neural network (NN) to efficiently classify images of the identified objects. The third stage combines distance information with the classification results of neural networks for efficient and intelligent navigation.

Kumbla, Kishan -K.↗

Normalized Temperature Contrast Processing in Infrared Flash Thermography

The paper presents further development in normalized contrast processing used in flash infrared thermography method. Method of computing normalized image or pixel intensity contrast, and normalized temperature contrast are provided. Methods of converting image contrast to temperature contrast and vice versa are provided. Normalized contrast processing in flash thermography is useful in quantitative analysis of flash thermography data including flaw characterization and comparison of experimental results with simulation. Computation of normalized temperature contrast involves use of flash thermography data acquisition set-up with high reflectivity foil and high emissivity tape such that the foil, tape and test object are imaged simultaneously. Methods of assessing other quantitative parameters such as emissivity of object, afterglow heat flux, reflection temperature change and surface temperature during flash thermography are also provided. Temperature imaging and normalized temperature contrast processing provide certain advantages over normalized image contrast processing by reducing effect of reflected energy in images and measurements, therefore providing better quantitative data. Examples of incorporating afterglow heat-flux and reflection temperature evolution in flash thermography simulation are also discussed.

Koshti, Ajay M.↗

A Method to Measure and Estimate Normalized Contrast in Infrared Flash Thermography

The paper presents further development in normalized contrast processing used in flash infrared thermography method. Method of computing normalized image or pixel intensity contrast, and normalized temperature contrast are provided. Methods of converting image contrast to temperature contrast and vice versa are provided. Normalized contrast processing in flash thermography is useful in quantitative analysis of flash thermography data including flaw characterization and comparison of experimental results with simulation. Computation of normalized temperature contrast involves use of flash thermography data acquisition set-up with high reflectivity foil and high emissivity tape such that the foil, tape and test object are imaged simultaneously. Methods of assessing other quantitative parameters such as emissivity of object, afterglow heat flux, reflection temperature change and surface temperature during flash thermography are also provided. Temperature imaging and normalized temperature contrast processing provide certain advantages over normalized image contrast processing by reducing effect of reflected energy in images and measurements, therefore providing better quantitative data. Examples of incorporating afterglow heat-flux and reflection temperature evolution in flash thermography simulation are also discussed.

Koshti, Ajay M.↗

GRACE Fast Mascons from Spherical Harmonics and a Regularization Design Trade Study

Mass concentration (mascon) solutions have become a prominent medium for investigating time-variable gravity recovered by GRACE and GRACE Follow-On. While GRACE Level-2 spherical harmonic products require various post-processing techniques to eliminate correlated noise, mascon formulations employ spatial regularization strategies during the estimation step to improve signal recovery. However, mascon estimation has traditionally required large computing resources and GRACE Level-1B processing capabilities. In this study, we show that a typical mascon estimation system can be reformulated to allow for the estimation of regularized mascons from Level-2 spherical harmonics. Provided that spherical harmonic solution covariances are available, the computed mascons will be mathematically equivalent to similar mascons estimated from Level-1B observations. This method is computationally efficient, better leverages GRACE spherical harmonics than past methods, and matches the performance of typical mascon solutions without locking scientists into pre-determined regularization designs. We develop a proof-of-concept solution using ITSG-Grace2018 and compare results with traditional mascons from JPL and NASA GSFC. We then assess the effects of spherical harmonic truncation and use of regularization correlations on basin signal recovery. We find that spherical expansions to degree and order 60 provide the minimum expansion necessary to study most basins, while larger expansions help further localize signals. We also find that diagonal regularizations (i.e., regularizations that do not contain inter-mascon correlations) are adversely affected by leakage, especially across boundaries such as coastlines where signals are not highly correlated, whereas including inter-mascon correlations and regional boundaries in the regularization greatly improves signal recovery.

M. J. Croteau↗

Computed lateral power spectral density response of conventional and STOL airplanes to random atmospheric turbulence

A method of computing the power spectral densities of the lateral response of airplanes to random atmospheric turbulence was adapted to an electronic digital computer. By use of this program, the power spectral densities of the lateral roll, yaw, and sideslip angular displacement of several conventional and STOL airplanes were computed. The results show that for the conventional airplanes, the roll response is more prominent than that for yaw or sideslip response. For the STOL airplanes, on the other hand, the yaw and sideslip responses were larger than the roll response. The response frequency of the STOL airplanes generally is higher than that for the conventional airplanes. This combination of greater sensitivity of the STOL airplanes in yaw and sideslip and the frequency at which they occur could be a factor causing the poor riding qualities of this class of airplanes.

Lichtenstein, J. H.↗

Computationally efficient control allocation

A computationally efficient method for calculating near-optimal solutions to the three-objective, linear control allocation problem is disclosed. The control allocation problem is that of distributing the effort of redundant control effectors to achieve some desired set of objectives. The problem is deemed linear if control effectiveness is affine with respect to the individual control effectors. The optimal solution is that which exploits the collective maximum capability of the effectors within their individual physical limits. Computational efficiency is measured by the number of floating-point operations required for solution. The method presented returned optimal solutions in more than 90% of the cases examined; non-optimal solutions returned by the method were typically much less than 1% different from optimal and the errors tended to become smaller than 0.01% as the number of controls was increased. The magnitude of the errors returned by the present method was much smaller than those that resulted from either pseudo inverse or cascaded generalized inverse solutions. The computational complexity of the method presented varied linearly with increasing numbers of controls; the number of required floating point operations increased from 5.5 i, to seven times faster than did the minimum-norm solution (the pseudoinverse), and at about the same rate as did the cascaded generalized inverse solution. The computational requirements of the method presented were much better than that of previously described facet-searching methods which increase in proportion to the square of the number of controls.

Durham, Wayne↗

Developments in the computation of turbulent boundary layers

Two methods of turbulence computation are discussed in terms of their basic simularities. It is shown that the two methods are interrelated and that each can gain from advances in the other. The degree of success of a pair of increasingly complex Reynolds stress models to broaden their range of applicability is examined through comparison with experimental data for a variety of flow conditions. An example of a large eddy simulation is presented, compared with experimental results, and used to evaluate the models for pressure rate of strain correlation and dissipation in the Reynolds averaged equations.

Rubesin, M. W.↗