Search NASA⌕ Search

SEARCH · Search NASA

Results for “compute intensive problems”

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 163 records · Page 9

Transport aircraft loading and balancing system: Using a CLIPS expert system for military aircraft load planning

The requirement for improving aircraft utilization and responsiveness in airlift operations has been recognized for quite some time by the Canadian Forces. To date, the utilization of scarce airlift resources has been planned mainly through the employment of manpower-intensive manual methods in combination with the expertise of highly qualified personnel. In this paper, we address the problem of facilitating the load planning process for military aircraft cargo planes through the development of a computer-based system. We introduce TALBAS (Transport Aircraft Loading and BAlancing System), a knowledge-based system designed to assist personnel involved in preparing valid load plans for the C130 Hercules aircraft. The main features of this system which are accessible through a convivial graphical user interface, consists of the automatic generation of valid cargo arrangements given a list of items to be transported, the user-definition of load plans and the automatic validation of such load plans.

Richardson, J.↗

Linear static structural and vibration analysis on high-performance computers

Parallel computers offer the oppurtunity to significantly reduce the computation time necessary to analyze large-scale aerospace structures. This paper presents algorithms developed for and implemented on massively-parallel computers hereafter referred to as Scalable High-Performance Computers (SHPC), for the most computationally intensive tasks involved in structural analysis, namely, generation and assembly of system matrices, solution of systems of equations and calculation of the eigenvalues and eigenvectors. Results on SHPC are presented for large-scale structural problems (i.e. models for High-Speed Civil Transport). The goal of this research is to develop a new, efficient technique which extends structural analysis to SHPC and makes large-scale structural analyses tractable.

Baddourah, M. A.↗

Linear Static Structural and Vibration Analysis on High-Performance Computers

Parallel computers offer the opportunity to significantly reduce the computation time necessary to analyze large-scale aerospace structures. This paper presents algorithms developed for and implemented on a massively-parallel computers hereafter referred to as Scalable High Performance Computers (SHPC) for the most computationally intensive tasks involved in structural analysis, namely, generation and assembly of system matrices, solution of systems of equations and calculation of the eigenvalues and eigenvectors. Results on SHPC are presented for large-scale structural problems (i.e. Models of high speed civil transport). The goal of this research is to develop new efficient technique which extend structural analysis to SHPC and make large-scale structural analyses tractable.

Baddourah, Majdi↗

Efficient mapping algorithms for scheduling robot inverse dynamics computation on a multiprocessor system

Two efficient mapping algorithms for scheduling the robot inverse dynamics computation consisting of m computational modules with precedence relationship to be executed on a multiprocessor system consisting of p identical homogeneous processors with processor and communication costs to achieve minimum computation time are presented. An objective function is defined in terms of the sum of the processor finishing time and the interprocessor communication time. The minimax optimization is performed on the objective function to obtain the best mapping. This mapping problem can be formulated as a combination of the graph partitioning and the scheduling problems; both have been known to be NP-complete. Thus, to speed up the searching for a solution, two heuristic algorithms were proposed to obtain fast but suboptimal mapping solutions. The first algorithm utilizes the level and the communication intensity of the task modules to construct an ordered priority list of ready modules and the module assignment is performed by a weighted bipartite matching algorithm. For a near-optimal mapping solution, the problem can be solved by the heuristic algorithm with simulated annealing. These proposed optimization algorithms can solve various large-scale problems within a reasonable time. Computer simulations were performed to evaluate and verify the performance and the validity of the proposed mapping algorithms. Finally, experiments for computing the inverse dynamics of a six-jointed PUMA-like manipulator based on the Newton-Euler dynamic equations were implemented on an NCUBE/ten hypercube computer to verify the proposed mapping algorithms. Computer simulation and experimental results are compared and discussed.

Lee, C. S. G.↗

Cascaded VLSI neural network architecture for on-line learning

High-speed, analog, fully-parallel, and asynchronous building blocks are cascaded for larger sizes and enhanced resolution. A hardware compatible algorithm permits hardware-in-the-loop learning despite limited weight resolution. A computation intensive feature classification application was demonstrated with this flexible hardware and new algorithm at high speed. This result indicates that these building block chips can be embedded as an application specific coprocessor for solving real world problems at extremely high data rates.

Thakoor, Anilkumar P.↗

Stress analysis of multilayered plates around circular holes

The elasticity problem for a thick plate consisting of two bonded dissimilar homogeneous layers is considered. It is assumed that the plate is infinite, contains a circular hole, and is subjected to axisymmetric external loads. A technique suitable to the formulation of three-dimensional boundary value problems is introduced and applied to the three-dimensional elasticity solution of an infinite plate with a hole. The effect of Poisson's ratio is studied in some detail, and the axisymmetric problem of a laminated plate is solved. The stresses at the interface are calculated and are observed to become unbounded at the hole boundary. An approximate treatment of the singularity is presented and the stress intensity factors are computed. Some of the results are compared with those found from the finite element method. The agreement between the two sets with regard to trend and magnitude is found to be very satisfactory.

Delale, F.↗

Optimization methods and silicon solar cell numerical models

An optimization algorithm for use with numerical silicon solar cell models was developed. By coupling an optimization algorithm with a solar cell model, it is possible to simultaneously vary design variables such as impurity concentrations, front junction depth, back junction depth, and cell thickness to maximize the predicted cell efficiency. An optimization algorithm was developed and interfaced with the Solar Cell Analysis Program in 1 Dimension (SCAP1D). SCAP1D uses finite difference methods to solve the differential equations which, along with several relations from the physics of semiconductors, describe mathematically the performance of a solar cell. A major obstacle is that the numerical methods used in SCAP1D require a significant amount of computer time, and during an optimization the model is called iteratively until the design variables converge to the values associated with the maximum efficiency. This problem was alleviated by designing an optimization code specifically for use with numerically intensive simulations, to reduce the number of times the efficiency has to be calculated to achieve convergence to the optimal solution.

Girardini, K.↗

Calculation of stress intensity factors in an isotropic multicracked plate: Part 2: Symbolic/numeric implementation

Analytical derivations of stress intensity factors (SIF's) of a multicracked plate can be complex and tedious. Recent advances, however, in intelligent application of symbolic computation can overcome these difficulties and provide the means to rigorously and efficiently analyze this class of problems. Here, the symbolic algorithm required to implement the methodology described in Part 1 is presented. The special problem-oriented symbolic functions to derive the fundamental kernels are described, and the associated automatically generated FORTRAN subroutines are given. As a result, a symbolic/FORTRAN package named SYMFRAC, capable of providing accurate SIF's at each crack tip, was developed and validated. Simple illustrative examples using SYMFRAC show the potential of the present approach for predicting the macrocrack propagation path due to existing microcracks in the vicinity of a macrocrack tip, when the influence of the microcrack's location, orientation, size, and interaction are taken into account.

Arnold, S. M.↗

Parallel execution of a three-dimensional, chemically reacting, Navier-Stokes code on distributed-memory machines

This paper describes the parallel version of the three-dimensional, chemically reacting, computational fluid dynamics (CFD) code, SPARK. This work was performed on the Intel iPSC/860-based parallel computers. The SPARK code utilizes relatively simple explicit numerical algorithms, but models complex chemical reactions. The code solves the equations over a regular structured mesh so a simple dam decomposition is used to assign work to the individual processors. The explicit nature of the algorithm, combined with the computational intensity of the chemistry calculations, results in a very low communication-to-computation ratio when compared to typical CFD codes. The efficiency of the parallel code is examined and shown to be about 65 percent when the problem size is scaled with the number of processors. Two low-angle wall-jet injection cases are solved to demonstrate the capability of the parallel code for solving large problems efficiently.

Otto, John C.↗

A comparative study of computational solutions to flow over a backward-facing step

A comparative study was conducted for computational fluid dynamic solutions to flow over a backward-facing step. This flow is a benchmark problem, with a simple geometry, but involves complicated flow physics such as free shear layers, reattaching flow, recirculation, and high turbulence intensities. Three Reynolds-averaged Navier-Stokes flow solvers with k-epsilon turbulence models were used, each using a different solution algorithm: finite difference, finite element, and hybrid finite element - finite difference. Comparisons were made with existing experimental data. Results showed that velocity profiles and reattachment lengths were predicted reasonably well by all three methods, while the skin friction coefficients were more difficult to predict accurately. It was noted that, in general, selecting an appropriate solver for each problem to be considered is important.

Mizukami, M.↗

DSMC simulations of the Shuttle Plume Impingement Flight EXperiment(SPIFEX)

During orbital maneuvers and proximity operations, a spacecraft fires its thrusters inducing plume impingement loads, heating and contamination to itself and to any other nearby spacecraft. These thruster firings are generally modeled using a combination of Computational Fluid Dynamics (CFD) and DSMC simulations. The Shuttle Plume Impingement Flight EXperiment(SPIFEX) produced data that can be compared to a high fidelity simulation. Due to the size of the Shuttle thrusters this problem was too resource intensive to be solved with DSMC when the experiment flew in 1994.

Stewart, Benedicte↗

Optimization methods and silicon solar cell numerical models

The goal of this project is the development of an optimization algorithm for use with a solar cell model. It is possible to simultaneously vary design variables such as impurity concentrations, front junction depth, back junctions depth, and cell thickness to maximize the predicted cell efficiency. An optimization algorithm has been developed and interfaced with the Solar Cell Analysis Program in 1 Dimension (SCAPID). SCAPID uses finite difference methods to solve the differential equations which, along with several relations from the physics of semiconductors, describe mathematically the operation of a solar cell. A major obstacle is that the numerical methods used in SCAPID require a significant amount of computer time, and during an optimization the model is called iteratively until the design variables converge to the value associated with the maximum efficiency. This problem has been alleviated by designing an optimization code specifically for use with numerically intensive simulations, to reduce the number of times the efficiency has to be calculated to achieve convergence to the optimal solution. Adapting SCAPID so that it could be called iteratively by the optimization code provided another means of reducing the cpu time required to complete an optimization. Instead of calculating the entire I-V curve, as is usually done in SCAPID, only the efficiency is calculated (maximum power voltage and current) and the solution from previous calculations is used to initiate the next solution.

Girardini, K.↗

Remote sensing data applied to the evaluation of soil erosion caused by land-use. Ribeirao Anhumas Basin Area: A case study

Formerly covered by a tropical forest, the study area was deforested in the early 40's for coffee plantation and cattle raising, which caused intense gully erosion problems. To develop a method to analyze the relationship between land use and soil erosion, visual interpretations of aerial photographs (scale 1:25.000), MSS-LANDSAT imagery (scale 1:250,000), as well as automatic interpretation of computer compatible tapes by IMAGE-100 system were carried out. From visual interpretation the following data were obtained: land use and cover tapes, slope classes, ravine frequency, and a texture sketch map. During field work, soil samples were collected for texture and X-ray analysis. The texture sketch map indicate that the areas with higher slope angles have a higher susceptibilty to the development of gullies. Also, the over carriage of pastureland, together with very friable lithologies (mainly sandstone) occuring in that area, seem to be the main factors influencing the catastrophic extension of ravines in the study site.

Dejesusparada, N.↗

Analytic corrections to CFD heating predictions accounting for changes in surface catalysis

Integral boundary-layer solution techniques applicable to the problem of determining aerodynamic heating rates of hypersonic vehicles in the vicinity of stagnation points and windward centerlines are briefly summarized. A new approach for combining the insight afforded by integral boundary-layer analysis with comprehensive (but time intensive) computational fluid dynamic (CFD) flowfield solutions of the thin-layer Navier-Stokes equations is described. The approach extracts CFD derived quantities at the wall and at the boundary layer edge for inclusion in a post-processing boundary-layer analysis. It allows a designer at a workstation to address two questions, given a single CFD solution. (1) How much does the heating change for a thermal protection system with different catalytic properties than was used in the original CFD solution? (2) How does the heating change at the interface of two different TPS materials with an abrupt change in catalytic efficiency? The answer to the second question is particularly important, because abrupt changes from low to high catalytic efficiency can lead to localized increase in heating which exceeds the usually conservative estimate provided by a fully catalytic wall assumption.

Gnoffo, Peter A.↗

A half plane and a strip with an arbitrarily located crack

A technique is presented for dealing with the problem of an elastic domain containing an arbitrarily oriented internal crack. The problem is formulated as a system of integral equations for a fictitious layer of body forces imbedded in the plane along a closed smooth curve encircling the original domain. The problems of a half plane with a crack in the neighborhood of its free boundary and of an infinite strip containing a symmetrically located internal crack with an arbitrary orientation are considered as examples. In each case the stress intensity factors are computed and are given as functions of the crack angle.

Erdogan, F.↗

A half plane and a strip with an arbitrarily located crack

The paper introduces a technique to deal with the problem of an elastic domain containing an arbitrarily oriented internal crack. The problem is formulated as a system of integral equations for a fictitious layer of body forces imbedded in the plane along a closed smooth curve encircling the original domain. The problems of a half plane with a crack in the neighborhood of its free boundary and of an infinite strip containing a symmetrically located internal crack with an arbitrary orientation are considered as examples. In each case the stress intensity factors are computed and are given as functions of the crack angle.

Erdogan, F.↗

Finite Element Analysis of Reverberation Chambers

The primary motivating factor behind the initiation of this work was to provide a deterministic means of establishing the validity of the statistical methods that are recommended for the determination of fields that interact in -an avionics system. The application of finite element analysis to reverberation chambers is the initial step required to establish a reasonable course of inquiry in this particularly data-intensive study. The use of computational electromagnetics provides a high degree of control of the "experimental" parameters that can be utilized in a simulation of reverberating structures. As the work evolved there were four primary focus areas they are: 1. The eigenvalue problem for the source free problem. 2. The development of a complex efficient eigensolver. 3. The application of a source for the TE and TM fields for statistical characterization. 4. The examination of shielding effectiveness in a reverberating environment. One early purpose of this work was to establish the utility of finite element techniques in the development of an extended low frequency statistical model for reverberation phenomena. By employing finite element techniques, structures of arbitrary complexity can be analyzed due to the use of triangular shape functions in the spatial discretization. The effects of both frequency stirring and mechanical stirring are presented. It is suggested that for the low frequency operation the typical tuner size is inadequate to provide a sufficiently random field and that frequency stirring should be used. The results of the finite element analysis of the reverberation chamber illustrate io-W the potential utility of a 2D representation for enhancing the basic statistical characteristics of the chamber when operating in a low frequency regime. The basic field statistics are verified for frequency stirring over a wide range of frequencies. Mechanical stirring is shown to provide an effective frequency deviation.

Bunting, Charles F.↗

Iterative pass optimization of sequence data

The problem of determining the minimum-cost hypothetical ancestral sequences for a given cladogram is known to be NP-complete. This "tree alignment" problem has motivated the considerable effort placed in multiple sequence alignment procedures. Wheeler in 1996 proposed a heuristic method, direct optimization, to calculate cladogram costs without the intervention of multiple sequence alignment. This method, though more efficient in time and more effective in cladogram length than many alignment-based procedures, greedily optimizes nodes based on descendent information only. In their proposal of an exact multiple alignment solution, Sankoff et al. in 1976 described a heuristic procedure--the iterative improvement method--to create alignments at internal nodes by solving a series of median problems. The combination of a three-sequence direct optimization with iterative improvement and a branch-length-based cladogram cost procedure, provides an algorithm that frequently results in superior (i.e., lower) cladogram costs. This iterative pass optimization is both computation and memory intensive, but economies can be made to reduce this burden. An example in arthropod systematics is discussed. c2003 The Willi Hennig Society. Published by Elsevier Science (USA). All rights reserved.

NASA Discipline Evolutionary Biology↗