Search NASA⌕ Search

SEARCH · Search NASA

Results for “numerical algorithm computing”

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,207 records · Page 67

Evolutionary Optimization of a Geometrically Refined Truss

Structural optimization is a field of research that has experienced noteworthy growth for many years. Researchers in this area have developed optimization tools to successfully design and model structures, typically minimizing mass while maintaining certain deflection and stress constraints. Numerous optimization studies have been performed to minimize mass, deflection, and stress on a benchmark cantilever truss problem. Predominantly traditional optimization theory is applied to this problem. The cross-sectional area of each member is optimized to minimize the aforementioned objectives. This Technical Publication (TP) presents a structural optimization technique that has been previously applied to compliant mechanism design. This technique demonstrates a method that combines topology optimization, geometric refinement, finite element analysis, and two forms of evolutionary computation: genetic algorithms and differential evolution to successfully optimize a benchmark structural optimization problem. A nontraditional solution to the benchmark problem is presented in this TP, specifically a geometrically refined topological solution. The design process begins with an alternate control mesh formulation, multilevel geometric smoothing operation, and an elastostatic structural analysis. The design process is wrapped in an evolutionary computing optimization toolset.

Hull, P. V.↗

Numerical studies of convective heat transfer in an inclined semi-annular enclosure

Natural convection heat transfer in a two-dimensional differentially heated semiannular enclosure is studied. The enclosure is isothermally heated and cooled at the inner and outer walls, respectively. A commercial software based on the SIMPLER algorithm was used to simulate the velocity and temperature profiles. Various parameters that affect the momentum and heat transfer processes were examined. These parameters include the Rayleigh number, Prandtl number, radius ratio, and the angle of inclination. A flow regime extending from conduction-dominated to convection-dominated flow was examined. The computed results of heat transfer are presented as a function of flow parameter and geometric factors. It is found that the heat transfer rate attains a minimum when the enclosure is tilted about +50 deg with respect to the gravitational direction.

Wang, L.-W.↗

Round-off errors in cutting plane algorithms based on the revised simplex procedure

This report statistically analyzes computational round-off errors associated with the cutting plane approach to solving linear integer programming problems. Cutting plane methods require that the inverse of a sequence of matrices be computed. The problem basically reduces to one of minimizing round-off errors in the sequence of inverses. Two procedures for minimizing this problem are presented, and their influence on error accumulation is statistically analyzed. One procedure employs a very small tolerance factor to round computed values to zero. The other procedure is a numerical analysis technique for reinverting or improving the approximate inverse of a matrix. The results indicated that round-off accumulation can be effectively minimized by employing a tolerance factor which reflects the number of significant digits carried for each calculation and by applying the reinversion procedure once to each computed inverse. If 18 significant digits plus an exponent are carried for each variable during computations, then a tolerance value of 0.1 x 10 to the minus 12th power is reasonable.

Moore, J. E.↗

A comparison of the efficiency of numerical methods for integrating chemical kinetic rate equations

The efficiency of several algorithms used for numerical integration of stiff ordinary differential equations was compared. The methods examined included two general purpose codes EPISODE and LSODE and three codes (CHEMEQ, CREK1D and GCKP84) developed specifically to integrate chemical kinetic rate equations. The codes were applied to two test problems drawn from combustion kinetics. The comparisons show that LSODE is the fastest code available for the integration of combustion kinetic rate equations. It is shown that an iterative solution of the algebraic energy conservation equation to compute the temperature can be more efficient then evaluating the temperature by integrating its time-derivative.

Radhakrishnan, K.↗

Advanced electromagnetic methods for aerospace vehicles

High- and low-frequency methods to analyze various radiation elements located on aerospace vehicles with combinations of conducting, nonconducting, and energy absorbing surfaces and interfaces. The focus was on developing fundamental concepts, techniques, and algorithms which would remove some of the present limitations in predicting radiation characteristics of antennas on complex aerospace vehicles. In order to accomplish this, the following subjects were examined: (1) the development of techniques for rigorous analysis of surface discontinuities of metallic and nonmetallic surfaces using the equivalent surface impedance concept and Green's function; (2) the effects of anisotropic material on antenna radiation patterns through the use of an equivalent surface impedance concept which is incorporated into the existing numerical electromagnetics computer codes; and (3) the fundamental concepts of precipitation static (P-Static), such as formulations and analytical models. A computer code was used to model the P-Static process on a simple structure. Measurement techniques were also developed to characterized the electrical properties at microwave frequencies. Samples of typical materials used in airframes were tested and the results are included.

Balanis, Constantine A.↗

Inference in fuzzy rule bases with conflicting evidence

Inference based on fuzzy 'If ... then' rules has played a very important role since when Zadeh proposed the Compositional Rule of Inference and, especially, since the first successful application presented by Mamdani. From the mid-1980's when the 'fuzzy boom' started in Japan, numerous industrial applications appeared, all using simplified techniques because of the high levels of computational complexity. Another feature is that antecedents in the rules are distributed densely in the input space, so the conclusion can be calculated by some weighted combination of the consequents of the matching (fired) rules. The CRI works in the following way: If R is a rule and A* is an observation, the conclusion is computed by B* = R o A* (o stands for the max-min composition). Algorithms implementing this idea directly have an exponential time complexity (maybe the problem is NP-hard) as the rules are relations in X x Y, a k1 x k2 dimensional space, if X is k1, Y is k2 dimensional. The simplified techniques usually decompose the relation into k1 projections in X(sub i) and measure in some way the degree of similarity between observation and antecedent by some parameter of the overlapping. These parameters are aggregated to a single value in (0,1) which is applied as a resulting weight for the given rule. The projections of rules in dimensions Y(sub i) are weighted by these aggregated values and then they are combined in order to obtain a resulting conclusion separately in every dimension. This method is unapplicable with sparse bases as there is no guarantee that an arbitrary observation matches with any of the antecedents. Then, the degree of similarity is 0 and all consequents are weighted by 0. Some considerations for such a situation are summarized in the next sections.

Koczy, Laszlo T.↗

Numerical study of supersonic combustion using a finite rate chemistry model

The governing equations of two-dimensional chemically reacting flows are presented together with a global two-step chemistry model for H2-air combustion. The explicit unsplit MacCormack finite difference algorithm is used to advance the discrete system of the governing equations in time until convergence is attained. The source terms in the species equations are evaluated implicitly to alleviate stiffness associated with fast reactions. With implicit source terms, the species equations give rise to a block-diagonal system which can be solved very efficiently on vector-processing computers. A supersonic reacting flow in an inlet-combustor configuration is calculated for the case where H2 is injected into the flow from the side walls and the strut. Results of the calculation are compared against the results obtained by using a complete reaction model.

Chitsomboon, T.↗

Numerical Simulation For Supersonic Inlets

Flows calculated for realistic engine-inlet conditions. Computer code LAPIN, large-perturbation inlet, developed to analyze large-perturbation, transient-flow fields in supersonic inlets. Robust, quick-running code capable of solving unsteady quasi-one-dimensional, inviscid-flow problems in mixed subsonic and supersonic regimes for inlets. Approach based upon quasi-one-dimensional, inviscid, unsteady formulation including engineering models of unstart/restart, bleed, bypass, and geometrical effects. Numerical solution of governing time-dependent equations of motion accomplished through shock-capturing, finite-difference algorithm. Program written in FORTRAN IV.

Varner, M. O.↗

Fast Particle Methods for Multiscale Phenomena Simulations

We are developing particle methods oriented at improving computational modeling capabilities of multiscale physical phenomena in : (i) high Reynolds number unsteady vortical flows, (ii) particle laden and interfacial flows, (iii)molecular dynamics studies of nanoscale droplets and studies of the structure, functions, and evolution of the earliest living cell. The unifying computational approach involves particle methods implemented in parallel computer architectures. The inherent adaptivity, robustness and efficiency of particle methods makes them a multidisciplinary computational tool capable of bridging the gap of micro-scale and continuum flow simulations. Using efficient tree data structures, multipole expansion algorithms, and improved particle-grid interpolation, particle methods allow for simulations using millions of computational elements, making possible the resolution of a wide range of length and time scales of these important physical phenomena.The current challenges in these simulations are in : [i] the proper formulation of particle methods in the molecular and continuous level for the discretization of the governing equations [ii] the resolution of the wide range of time and length scales governing the phenomena under investigation. [iii] the minimization of numerical artifacts that may interfere with the physics of the systems under consideration. [iv] the parallelization of processes such as tree traversal and grid-particle interpolations We are conducting simulations using vortex methods, molecular dynamics and smooth particle hydrodynamics, exploiting their unifying concepts such as : the solution of the N-body problem in parallel computers, highly accurate particle-particle and grid-particle interpolations, parallel FFT's and the formulation of processes such as diffusion in the context of particle methods. This approach enables us to transcend among seemingly unrelated areas of research.

Koumoutsakos, P.↗

A Viscoelastic Hybrid Shell Finite Element

An elastic large displacement thick-shell hybrid finite element is modified to allow for the calculation of viscoelastic stresses. Internal strain variables are introduced at he element's stress nodes and are employed to construct a viscous material model. First order ordinary differential equations relate the internal strain variables to the corresponding elastic strains at the stress nodes. The viscous stresses are computed from the internal strain variables using viscous moduli which are a fraction of the elastic moduli. The energy dissipated by the action of the viscous stresses in included in the mixed variational functional. Nonlinear quasi-static viscous equilibrium equations are then obtained. Previously developed Taylor expansions of the equilibrium equations are modified to include the viscous terms. A predictor-corrector time marching solution algorithm is employed to solve the algebraic-differential equations. The viscous shell element is employed to numerically simulate a stair-step loading and unloading of an aircraft tire in contact with a frictionless surface.

Johnson, Arthur↗

Numerical solution of large nonsymmetric eigenvalue problems

Several methods are discribed for combinations of Krylov subspace techniques, deflation procedures and preconditionings, for computing a small number of eigenvalues and eigenvectors or Schur vectors of large sparse matrices. The most effective techniques for solving realistic problems from applications are those methods based on some form of preconditioning and one of several Krylov subspace techniques, such as Arnoldi's method or Lanczos procedure. Two forms of preconditioning are considered: shift-and-invert and polynomial acceleration. The latter presents some advantages for parallel/vector processing but may be ineffective if eigenvalues inside the spectrum are sought. Some algorithmic details are provided that improve the reliability and effectiveness of these techniques.

Saad, Youcef↗

Communication-Aware Orbit Design for Small Spacecraft Swarms around Small Bodies

Exploration of small Solar System bodies has traditionally been performed by single monolithic spacecraft carrying a number of science instruments. However, science instruments typically cannot be operated simultaneously due to the instrument requirements including optimal viewing angle, surface illumination, altitude and ground resolution, power, and data constraints. This observation has motivated interest in multi-spacecraft architectures where a swarm of small spacecraft, each carrying a single science instrument, studies a small body after being deployed by a carrier spacecraft, which then collects data from the vehicles and relays it to Earth. Such architectures hold promise to yield significant improvements in mission efficiency, increases in data quality, and shorter mission duration. A key difficulty in the design of such missions is the selection of orbits for the small spacecraft, which must satisfy not only instrument requirements, but also strict inter-spacecraft communication and on-board storage constraints. To address this, in this paper, we present a novel computationally-efficient optimization algorithm for \emph{communication-aware design} of the orbits of a small spacecraft swarm orbiting a small body. The proposed approach captures constraints including instrument requirements, inter-spacecraft communication bandwidths, and on-board memory usage, and it can accommodate highly irregular gravity field models and surface geometries. We propose an efficient algorithm for optimization of instrument observations and inter-spacecraft communications; we then leverage the differentiable nature of the proposed algorithm to accelerate a gradient-based global search algorithm. Numerical simulations of a six-spacecraft swarm studying 433 Eros show that the proposed approach successfully identifies high-quality orbits, and significantly outperform communication-agnostic optimization techniques, resulting in a 10% increase in scientific returns and a 30% increase in the quality of the collected data.

Rahmani, Amir↗

Computational fluid dynamics research in three-dimensional zonal techniques

Patched-grid algorithms for the analysis of complex configurations with an implicit, upwind-biased Navier-Stokes solver were investigated. Conservative and non-conservative approaches for performing zonal interpolations were implemented. The latter approach yields the most flexible technique in that it can handle both patched and overlaid grids. Results for a two-dimensional blunt body problem show that either approach yield accurate steady-state shock locations and jump conditions. In addition, calculations of the turbulent flow through a hypersonic inlet on a three-zone grid show that the numerical prediction is in good agreement with the experimental results. Through the use of a generalized coordinate transformation at the zonal interface between two or more blocks, the algorithm can be applied to highly stretched viscous grids and to arbitrarily-shaped zonal boundaries. Applications were made to the F-18 aircraft at subsonic, high-alpha conditions, in support of the NASA High-Alpha Research Program. The calculations were compared to ground-based and flight test experiments and were used as a guide to understanding the ground-based tests, which are laminar and transitional, and their relationship to flight. Calculations about a complete reconnaissance aircraft were also performed in order to further demonstrate the capability of the patched-grid algorithm.

Walters, Robert W.↗

Application of improved numerical schemes

Two approaches which accelerate the solution of the steady state Navier-Stokes equations are discussed. The SIMPLER algorithm, a revised version of SIMPLE, provides a more accurate pressure field for each iteration through the momentum equations, thereby speeding convergence. PISO (Pressure Implicit Split Operator), performs a secondary correction of the velocity and pressure fields (after the typical pressure correction) which enhances convergence. Both schemes account for terms neglected in the SIMPLE approach, but do so in slightly different ways. Two dimensional driven cavity flow and flow over a step were calculated to examine the effect of geometry on the performance of these schemes. Computations were carried out on a series of progressively finer grids. The effect of relaxation number on convergence rate was analyzed, using results from SIMPLE as criteria for performance correlation. Results show: (1) the improved schemes promoted convergence by up to 60% for the driven cavity and 40% for flow over a step; (2) for the driven cavity problem, the efficiency of PISO and SIMPLER increased as the number of nodes increased; and (3) to ensure faster convergence, higher relaxation numbers must be applied.

Neely, G. H.↗

Three dimensional CSCM method for the compressible Navier-Stokes equations with application to a multi-nozzle exhaust flowfield

The effective design of three-dimensional flow systems such as a clustered multinozzle shrouded exhaust system requires detailed analysis of the internal flowfield. It is pointed out that new numerical techniques on the most modern vector computers are making these analyses practicable. In this paper, the upwind differenced implicit conservative supracharacteristics method (CSCM) for three-dimensional viscous flow is presented. The new method is an implicit 'method of planes' symmetric Gauss-Seidel relaxation scheme. The data is conveniently stored on successive planes along the streamwise coordinate, and the system of equations is solved twice in each successive plane of the streamwise coordinate. The developed new three-dimensional compressible Navier-Stokes algorithm combines the best features of the storage and computationally efficient space marching procedures with the generality of time dependent techniques to solve flows with elliptic and streamwise separated flows.

Bardina, J.↗

Modelling short channel mosfets for use in VLSI

In an investigation of metal oxide semiconductor field effect transistor (MOFSET) devices, a one-dimensional mathematical model of device dynamics was prepared, from which an accurate and computationally efficient drain current expression could be derived for subsequent parameter extraction. While a critical review revealed weaknesses in existing 1-D models (Pao-Sah, Pierret-Shields, Brews, and Van de Wiele), this new model in contrast was found to allow all the charge distributions to be continuous, to retain the inversion layer structure, and to include the contribution of current from the pinched-off part of the device. The model allows the source and drain to operate in different regimes. Numerical algorithms used for the evaluation of surface potentials in the various models are presented.

Klafter, Alex↗

Numerical study of the vortex burst phenomenon for delta wings

A flux-difference splitting scheme is employed to compute low-speed flows over a delta wing for angles of attack from 0 to 40 deg as steady-state solutions to the three-dimensional, Reynolds-averaged Navier-Stokes equations in their thin-layer approximation. The finite-difference scheme is made spatially second-order accurate by applying a total variation diminishing-like discretization to the inviscid fluxes and central differencing to the viscous shear fluxes. Using first-order accurate Euler backward-time differencing, an efficient implicit algorithm is constructed, which combines approximate factorization in cross planes with a symmetric planar Gauss-Seidel relaxation in the remaining third spatial direction. The geometry of the thin (maximum thickness is 0.021), slender (aspect ratio is unity), sharp-edged delta wing is taken from Hummel's (1967, 1978) wind tunnel model. Over the entire angle-of-attack range, the computed values of lift and pitching moment are in good agreement with the experimental data. Also details of the flow-fieldlike spanwise surface pressure distributions compare well with the experiment. Computed flow-field results with a bubble-type vortex burst are analyzed in detail.

Hartwich, PETER-M.↗

Flexible language constructs for large parallel programs

The goal of the research described is to develop flexible language constructs for writing large data parallel numerical programs for distributed memory (MIMD) multiprocessors. Previously, several models have been developed to support synchronization and communication. Models for global synchronization include SIMD (Single Instruction Multiple Data), SPMD (Single Program Multiple Data), and sequential programs annotated with data distribution statements. The two primary models for communication include implicit communication based on shared memory and explicit communication based on messages. None of these models by themselves seem sufficient to permit the natural and efficient expression of the variety of algorithms that occur in large scientific computations. An overview of a new language that combines many of these programming models in a clean manner is given. This is done in a modular fashion such that different models can be combined to support large programs. Within a module, the selection of a model depends on the algorithm and its efficiency requirements. An overview of the language and discussion of some of the critical implementation details is given.

Rosing, Matthew↗