Search NASA⌕ Search

SEARCH · Search NASA

Results for “computational efficiency”

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 253 records · Page 14

An efficient method for computation of the manipulator inertia matrix

An efficient method of computation of the manipulator inertia matrix is presented. Using spatial notations, the method leads to the definition of the composite rigid-body spatial inertia, which is a spatial representation of the notion of augmented body. The previously proposed methods, the physical interpretations leading to their derivation, and their redundancies are analyzed. The proposed method achieves a greater efficiency by eliminating the redundancy in the intrinsic equations as well as by a better choice of coordinate frame for their projection. In this case, removing the redundancy leads to greater efficiency of the computation in both serial and parallel senses.

Fijany, Amir↗

Efficient algorithms for single-axis attitude estimation

The computationally efficient algorithms determine attitude from the measurement of art lengths and dihedral angles. The dependence of these algorithms on the solution of trigonometric equations was reduced. Both single time and batch estimators are presented along with the covariance analysis of each algorithm.

Shuster, M. D.↗

The use of the FFT for the efficient solution of the problem of electromagnetic scattering by a body of revolution

The enhancement of the computational efficiency of the body of revolution (BOR) scattering problem is discused with a view to making it practical for solving large-body problems. The problem of EM scattering by a perfectly conducting BOR is considered, although the methods can be extended to multilayered dielectric bodies as well. Typically, the generation of the elements of the moment method matrix consumes a major portion of the computational time. It is shown how this time can be significantly reduced by manipulating the expression for the matrix elements to permit efficient FFT computation. A technique for extracting the singularity of the Green function that appears within the integrands of the matrix diagonal is also presented, further enhancing the usefulness of the FFT. The computation time can thus be improved by at least an order of magnitude for large bodies in comparison to that for previous algorithms.

Gedney, Stephen D.↗

Efficient Algorithms for Computing Trim and Small-Disturbance Equations of Motion of Aircraft Coordinated and Uncoordinated, Steady, Steep Turns

The development of computational algorithms that permit efficient calculation of aircraft trim states and of the associated small disturbance equations of motion for a systematic investigation of the statics and dynamics of aircraft in coordinated and uncoordinated, steady, steep turning flight is reported. The efficiency in the trim computation is realized by decoupling the governing equations. The small disturbance equations of motion, which are given in a general body axis system, include aerodynamic acceleration derivatives; they are cast in a familiar first order, vector matrix format of modern system theory. These algorithms were applied to a variety of rotorcraft simulation models. Results pertaining to a simulated hingeless rotor helicopter are also presented

Chen, Robert T. N.↗

Implicit finite-difference computations of unsteady transonic flows about airfoils, including the treatment of irregular shock-wave motions

A computer code, LTRAN2, has been constructed that efficiently computes low-frequency unsteady transonic flows about airfoils in motion. The code solves the two-dimensional, nonlinear, low-frequency, small-disturbance equation by an alternating-direction implicit (ADI) algorithm. First, as a check on the code, LTRAN2 is used to solve the linear, low-frequency, small-disturbance equation. The results are compared with known answers from linear theory. Then nonlinear results are presented. Tijdeman's experimental observations of shock wave motions resulting from airfoil flap oscillations are qualitatively reproduced by LTRAN2. These computations compare favorably with those of Magnus and Yoshihara and are obtained in substantially less computer time. Also the underlying theory of the governing equation and the construction of the algorithm are discussed.

Ballhaus, W. F.↗

Radiation exchange in large space structures and frames

The analysis of radiation heat transfer is determined by the need to determine the geometrical quantity, F(ij), which is commonly called the view factor, and which represents the fraction of energy leaving surface i which strikes surface j. The present investigation shows that the use of a rotating plane to model a one-dimensional radiation element is both computationally efficient and accurate. Because of the reduced computational cost of this element, radiation view factors for complex structures can be calculated directly. Under some conditions, the characteristics of the one-dimensional element may lead to a loss in accuracy when it is used to model obstructing cylinders. In cases in which the element is too close to the radiating surfaces, curved surfaces must be represented by a collection of flat planes. However, it appears that as long as the one-dimensional element is more than 5 diameters from the other surfaces, its use is valid.

Emery, A. F.↗

The Continual Intercomparison of Radiation Codes: Results from Phase I

The computer codes that calculate the energy budget of solar and thermal radiation in Global Climate Models (GCMs), our most advanced tools for predicting climate change, have to be computationally efficient in order to not impose undue computational burden to climate simulations. By using approximations to gain execution speed, these codes sacrifice accuracy compared to more accurate, but also much slower, alternatives. International efforts to evaluate the approximate schemes have taken place in the past, but they have suffered from the drawback that the accurate standards were not validated themselves for performance. The manuscript summarizes the main results of the first phase of an effort called "Continual Intercomparison of Radiation Codes" (CIRC) where the cases chosen to evaluate the approximate models are based on observations and where we have ensured that the accurate models perform well when compared to solar and thermal radiation measurements. The effort is endorsed by international organizations such as the GEWEX Radiation Panel and the International Radiation Commission and has a dedicated website (i.e., http://circ.gsfc.nasa.gov) where interested scientists can freely download data and obtain more information about the effort's modus operandi and objectives. In a paper published in the March 2010 issue of the Bulletin of the American Meteorological Society only a brief overview of CIRC was provided with some sample results. In this paper the analysis of submissions of 11 solar and 13 thermal infrared codes relative to accurate reference calculations obtained by so-called "line-by-line" radiation codes is much more detailed. We demonstrate that, while performance of the approximate codes continues to improve, significant issues still remain to be addressed for satisfactory performance within GCMs. We hope that by identifying and quantifying shortcomings, the paper will help establish performance standards to objectively assess radiation code quality, and will guide the development of future phases of CIRC

Oreopoulos, Lazaros↗

Multi-grid for structures analysis

In structural analysis the amount of computational time necessary for a solution is proportional to the number of degrees of freedom times the bandwidth squared. In implicit time analysis, this must be done at each discrete point in time. If, in addition, the problem is nonlinear, then this solution must be iterated at each point in time. If the bandwidth is large, the size of the problem that can be analyzed is severely limited. The multi-grid method is a possible algorithm which can make this solution much more computationally efficient. This method has been used for years in computational fluid mechanics. It works on the fact that relaxation is very efficient on the high frequency components of the solution (nearest neighbor interactions) and not very good on low frequency components of the solution (far interactions). The multi-grid method is then to relax the solution on a particular model until the residual stops changing. This indicates that the solution contains the higher frequency components. A coarse model is then generated for the lower frequency components to the solution. The model is then relaxed for the lower frequency components of the solution. These lower frequency components are then interpolated to the fine model. In computational fluid mechanics the equations are usually expressed as finite differences.

Kascak, Albert F.↗

Machine Learning for the Prediction of Local Asteroid Damages

Risk assessment studies of local asteroid hazards traditionally simulate the physics of meteors with engineering models tailored to analyze tens-of-millions of scenarios. However, these simplified approaches still need to solve time-dependent ODEs to model the entry process and the resulting ground damage. With a computational cost of O(0.01 CPU.s) per scenario, simulating these large numbers of potential entry conditions in risk assessment studies can take several days on local computers. To improve computational efficiency, we propose in this paper an orthogonal approach based on machine learning models to predict the size of damaged areas given a list of entry parameters. We train 5 machine learning methods and compare the predictions to the outputs of the PAIR model, first only with primitive entry condition variables, and then with more advanced features. We find that complex models like neural networks are well-suited to estimate blast hazards, while simpler linear models can accurately assess thermal damage. For both types of hazards, the radii of damaged areas can be predicted with around 10% average errors and a coefficient of determination (R2) of 0.99. The CPU time is decreased by a factor O(10 3 ) compared to the PAIR model, which enables the simulation of millions of scenarios in minutes, on a local computer. We then use the same machine learning approaches for a classification task where the models are trained to predict if an asteroid will produce a given level of damage. Results show that complex models like the gradient boosting classifier and the neural network can perform this task with 98% accuracy. Beyond surrogate models, we finally incorporate the machine learning algorithms to the state-of-the-art Shapley sensitivity analysis and present a ranking of the entry parameters based on their contributions to ground damages.

SMD↗

Spiking Neurons for Analysis of Patterns

Artificial neural networks comprising spiking neurons of a novel type have been conceived as improved pattern-analysis and pattern-recognition computational systems. These neurons are represented by a mathematical model denoted the state-variable model (SVM), which among other things, exploits a computational parallelism inherent in spiking-neuron geometry. Networks of SVM neurons offer advantages of speed and computational efficiency, relative to traditional artificial neural networks. The SVM also overcomes some of the limitations of prior spiking-neuron models. There are numerous potential pattern-recognition, tracking, and data-reduction (data preprocessing) applications for these SVM neural networks on Earth and in exploration of remote planets. Spiking neurons imitate biological neurons more closely than do the neurons of traditional artificial neural networks. A spiking neuron includes a central cell body (soma) surrounded by a tree-like interconnection network (dendrites). Spiking neurons are so named because they generate trains of output pulses (spikes) in response to inputs received from sensors or from other neurons. They gain their speed advantage over traditional neural networks by using the timing of individual spikes for computation, whereas traditional artificial neurons use averages of activity levels over time. Moreover, spiking neurons use the delays inherent in dendritic processing in order to efficiently encode the information content of incoming signals. Because traditional artificial neurons fail to capture this encoding, they have less processing capability, and so it is necessary to use more gates when implementing traditional artificial neurons in electronic circuitry. Such higher-order functions as dynamic tasking are effected by use of pools (collections) of spiking neurons interconnected by spike-transmitting fibers. The SVM includes adaptive thresholds and submodels of transport of ions (in imitation of such transport in biological neurons). These features enable the neurons to adapt their responses to high-rate inputs from sensors, and to adapt their firing thresholds to mitigate noise or effects of potential sensor failure. The mathematical derivation of the SVM starts from a prior model, known in the art as the point soma model, which captures all of the salient properties of neuronal response while keeping the computational cost low. The point-soma latency time is modified to be an exponentially decaying function of the strength of the applied potential. Choosing computational efficiency over biological fidelity, the dendrites surrounding a neuron are represented by simplified compartmental submodels and there are no dendritic spines. Updates to the dendritic potential, calcium-ion concentrations and conductances, and potassium-ion conductances are done by use of equations similar to those of the point soma. Diffusion processes in dendrites are modeled by averaging among nearest-neighbor compartments. Inputs to each of the dendritic compartments come from sensors. Alternatively or in addition, when an affected neuron is part of a pool, inputs can come from other spiking neurons. At present, SVM neural networks are implemented by computational simulation, using algorithms that encode the SVM and its submodels. However, it should be possible to implement these neural networks in hardware: The differential equations for the dendritic and cellular processes in the SVM model of spiking neurons map to equivalent circuits that can be implemented directly in analog very-large-scale integrated (VLSI) circuits.

Huntsberger, Terrance↗

Human motion planning based on recursive dynamics and optimal control techniques

This paper presents an efficient optimal control and recursive dynamics-based computer animation system for simulating and controlling the motion of articulated figures. A quasi-Newton nonlinear programming technique (super-linear convergence) is implemented to solve minimum torque-based human motion-planning problems. The explicit analytical gradients needed in the dynamics are derived using a matrix exponential formulation and Lie algebra. Cubic spline functions are used to make the search space for an optimal solution finite. Based on our formulations, our method is well conditioned and robust, in addition to being computationally efficient. To better illustrate the efficiency of our method, we present results of natural looking and physically correct human motions for a variety of human motion tasks involving open and closed loop kinematic chains.

Non-NASA Center↗

An approach to multivariable control of manipulators

The paper presents simple schemes for multivariable control of multiple-joint robot manipulators in joint and Cartesian coordinates. The joint control scheme consists of two independent multivariable feedforward and feedback controllers. The feedforward controller is the minimal inverse of the linearized model of robot dynamics and contains only proportional-double-derivative (PD2) terms - implying feedforward from the desired position, velocity and acceleration. This controller ensures that the manipulator joint angles track any reference trajectories. The feedback controller is of proportional-integral-derivative (PID) type and is designed to achieve pole placement. This controller reduces any initial tracking error to zero as desired and also ensures that robust steady-state tracking of step-plus-exponential trajectories is achieved by the joint angles. Simple and explicit expressions of computation of the feedforward and feedback gains are obtained based on the linearized model of robot dynamics. This leads to computationally efficient schemes for either on-line gain computation or off-line gain scheduling to account for variations in the linearized robot model due to changes in the operating point. The joint control scheme is extended to direct control of the end-effector motion in Cartesian space. Simulation results are given for illustration.

Seraji, H.↗

Position control of redundant manipulators using an adaptive error-based control scheme

A Cartesian-space control scheme is developed to control the motion of kinematically redundant manipulators with 7 degrees of freedom (DOF). The control scheme consists mainly of proportional derivative (PD) controllers whose gains are adjusted by an adaptation law driven by the errors between the desired and actual trajectories. The adaptation law is derived using the concept of model reference adaptive control (MRAC) and Lyapunov direct method under the assumption that the manipulator performs non-compliant and slowly-varying motions. The developed control scheme is computationally efficient because its implementation does not require the computation of the manipulator dynamics. Computer simulation performed to evaluate the control scheme performance is presented and discussed.

Nguyen, Charles C.↗

A discrete Fourier transform for virtual memory machines

An algebraic theory of the Discrete Fourier Transform is developed in great detail. Examination of the details of the theory leads to a computationally efficient fast Fourier transform for the use on computers with virtual memory. Such an algorithm is of great use on modern desktop machines. A FORTRAN coded version of the algorithm is given for the case when the sequence of numbers to be transformed is a power of two.

Galant, David C.↗

Unsteady three-dimensional thermal field prediction in turbine blades using nonlinear BEM

A time-and-space accurate and computationally efficient fully three dimensional unsteady temperature field analysis computer code has been developed for truly arbitrary configurations. It uses boundary element method (BEM) formulation based on an unsteady Green's function approach, multi-point Gaussian quadrature spatial integration on each panel, and a highly clustered time-step integration. The code accepts either temperatures or heat fluxes as boundary conditions that can vary in time on a point-by-point basis. Comparisons of the BEM numerical results and known analytical unsteady results for simple shapes demonstrate very high accuracy and reliability of the algorithm. An example of computed three dimensional temperature and heat flux fields in a realistically shaped internally cooled turbine blade is also discussed.

Martin, Thomas J.↗

Aeroelasticity of wing and wing-body configurations on parallel computers

The objective of this research is to develop computationally efficient methods for solving aeroelasticity problems on parallel computers. Both uncoupled and coupled methods are studied in this research. For the uncoupled approach, the conventional U-g method is used to determine the flutter boundary. The generalized aerodynamic forces required are obtained by the pulse transfer-function analysis method. For the coupled approach, the fluid-structure interaction is obtained by directly coupling finite difference Euler/Navier-Stokes equations for fluids and finite element dynamics equations for structures. This capability will significantly impact many aerospace projects of national importance such as Advanced Subsonic Civil Transport (ASCT), where the structural stability margin becomes very critical at the transonic region. This research effort will have direct impact on the High Performance Computing and Communication (HPCC) Program of NASA in the area of parallel computing.

Byun, Chansup↗

A Design Tool for Liquid Rocket Engine Injectors

A practical design tool for the analysis of flowfields near the injector face has been developed and used to analyze the Fastrac engine. The objective was to produce a computational design tool which was detailed enough to predict the interactive effects of injector element impingement angles and points and the momenta of the individual orifice flows. To obtain a model which could be used to simulate a significant number of individual orifices, a homogeneous computational fluid dynamics model was developed. To describe liquid and vapor sub- and super-critical flows, the model included thermal and caloric equations of state which were valid over a wide range of pressures and temperatures. A homogeneous model was constructed such that the local state of the flow was determined directly, i.e. the quality of the flow was calculated. Such a model does not identify drops or their distribution, but it does allow the flow along the injector face and into the acoustic cavity to be predicted. It also allows the film coolant flow to be accurately described. The initial evaluation of the injector code was made by simulating cold flow from an unlike injector element and from a like-on-like overlapping fan (LOL) injector element. The predicted mass flux distributions of these injector elements compared well to cold flow test results. These are the same cold flow tests which serve as the data base for the JANNAF performance prediction codes. The flux distributions 1 inch downstream of the injector face are very similar; the differences were somewhat larger at further distances from the faceplate. Since the cold flow testing did not achieve good mass balances when integrations across the entire fan were made, the CFD simulation appears to be reasonable alternative to future cold flow testing. To simulate the Fastrac, an RP-1/LOX combustion model must be chosen. This submodel must be relatively simple to accomplish three-dimensional, multiphase flow simulations. Single RP-1 pyrolysis and partial oxidation steps were chosen and the combustion was completed with the wet CO mechanism. Soot was also formed with a single global reaction. To validate the combustion submodel, global data from gas generator tests and from subscale motor test were used to predict qualitatively correct mean molecular weights, temperature, and soot levels. Because such tests do not provide general kinetics rates, the methodology is not necessarily appropriate for other than rocket type flows conditions. Soot predictions were made so that radiation heating to the motor walls can be made. These initial studies of the Fastrac were for a small region close to the injector face and chamber wall which included a segment of the acoustic cavity. The region analyzed includes 11 individual orifice holes to represent the LOL elements and the H2 film coolant holes. Typical results of this simulation are shown in Figure 1. At this point the only available test data to verify the predictions are temperatures measured in the acoustic cavity. These temperatures are in reasonable agreement at about 2000R (1111 K). Future work is expected to include improving the computational efficiency or the CFD model and/or using more computer capacity than the single Pentium PC with which these simulations were made.

Farmer, Richard C.↗

Development of Reduced-Order Models for Aeroelastic and Flutter Prediction Using the CFL3Dv6.0 Code

A reduced-order model (ROM) is developed for aeroelastic analysis using the CFL3D version 6.0 computational fluid dynamics (CFD) code, recently developed at the NASA Langley Research Center. This latest version of the flow solver includes a deforming mesh capability, a modal structural definition for nonlinear aeroelastic analyses, and a parallelization capability that provides a significant increase in computational efficiency. Flutter results for the AGARD 445.6 Wing computed using CFL3D v6.0 are presented, including discussion of associated computational costs. Modal impulse responses of the unsteady aerodynamic system are then computed using the CFL3Dv6 code and transformed into state-space form. Important numerical issues associated with the computation of the impulse responses are presented. The unsteady aerodynamic state-space ROM is then combined with a state-space model of the structure to create an aeroelastic simulation using the MATLAB/SIMULINK environment. The MATLAB/SIMULINK ROM is used to rapidly compute aeroelastic transients including flutter. The ROM shows excellent agreement with the aeroelastic analyses computed using the CFL3Dv6.0 code directly.

Silva, Walter A.↗