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.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 1,063 records · Page 59

All sources NASA NTRS DOE OSTI

NASA NTRS1989

A survey of upwind methods for flows with equilibrium and non-equilibrium chemistry and thermodynamics

Several versions of flux-vector split and flux-difference split algorithms were compared with regard to general applicability and complexity. Test computations were performed using curve-fit equilibrium air chemistry for an M = 5 high-temperature inviscid flow over a wedge, and an M = 24.5 inviscid flow over a blunt cylinder for test computations; for these cases, little difference in accuracy was found among the versions of the same flux-split algorithm. For flows with nonequilibrium chemistry, the effects of the thermodynamic model on the development of flux-vector split and flux-difference split algorithms were investigated using an equilibrium model, a general nonequilibrium model, and a simplified model based on vibrational relaxation. Several numerical examples are presented, including nonequilibrium air chemistry in a high-temperature shock tube and nonequilibrium hydrogen-air chemistry in a supersonic diffuser.

Grossman, B.↗

NASA NTRS1990

Random search optimization based on genetic algorithm and discriminant function

The general problem of optimization with arbitrary merit and constraint functions, which could be convex, concave, monotonic, or non-monotonic, is treated using stochastic methods. To improve the efficiency of the random search methods, a genetic algorithm for the search phase and a discriminant function for the constraint-control phase were utilized. The validity of the technique is demonstrated by comparing the results to published test problem results. Numerical experimentation indicated that for cases where a quick near optimum solution is desired, a general, user-friendly optimization code can be developed without serious penalties in both total computer time and accuracy.

Kiciman, M. O.↗

NASA NTRS1993

Use of networked workstations for parallel nonlinear structural dynamic simulations of rotating bladed-disk assemblies

The principal objective of this research is to investigate, develop and demonstrate coarse-grained, parallel-processing strategies for nonlinear dynamic simulations for rotating bladed-disk assemblies. The parallel -processing strategies addressed include numerical algorithms for parallel nonlinear solutions and techniques to effect load balancing among processors. The parallel environment employed is a distributed-memory, coarse-grained one consisting of networked workstations. A parallel explicit time integration method has been implemented for transient nonlinear solutions of rotationg bladed-disk assemblies. Automatic domain partitioning techniques have been investigated for load balancing among processors. Advanced computing environments, data structures and interactive computer graphics all contribute to an integrated parallel finite element analysis system to facilitate more efficient and powerful dynamic simulations.

Hsieh, Shang-Hsien↗

NASA NTRS1999

Parallelizing OVERFLOW: Experiences, Lessons, Results

The computer code OVERFLOW is widely used in the aerodynamic community for the numerical solution of the Navier-Stokes equations. Current trends in computer systems and architectures are toward multiple processors and parallelism, including distributed memory. This report describes work that has been carried out by the author and others at Ames Research Center with the goal of parallelizing OVERFLOW using a variety of parallel architectures and parallelization strategies. This paper begins with a brief description of the OVERFLOW code. This description includes the basic numerical algorithm and some software engineering considerations. Next comes a description of a parallel version of OVERFLOW, OVERFLOW/PVM, using PVM (Parallel Virtual Machine). This parallel version of OVERFLOW uses the manager/worker style and is part of the standard OVERFLOW distribution. Then comes a description of a parallel version of OVERFLOW, OVERFLOW/MPI, using MPI (Message Passing Interface). This parallel version of OVERFLOW uses the SPMD (Single Program Multiple Data) style. Finally comes a discussion of alternatives to explicit message-passing in the context of parallelizing OVERFLOW.

Jespersen, Dennis C.↗

NASA NTRS1994

Scientific Visualization of Large Scale Unsteady Fluid Flow

In a numerical flow simulation. it is common to generate several thousand time steps of unsteady (time-dependent) flow data. Each time step may require tens to hundreds of megabytes for disk storage, and the total disk requirement for storing the unsteady flow data may be hundreds of gigabytes. Interactive visualization of unsteady flow data of this magnitude is presently impossible with the current hardware technology. This chapter describes the current approaches for unsteady flow visualization. An effective particle tracing technique for unsteady flow is also described. First, the life cycle of a typical numerical flow simulation is outlined. Several unsteady flow data sets from real-world problems are then given. The current approaches for visualizing unsteady flow are then described. There are many existing systems for flow visualization, and some of them are discussed. Streaklines depict time-varying phenomena that are sometimes difficult or impossible to see with other visualization techniques. The algorithms for computing streaklines are described. Several unsteady flow data sets have been visualized using streaklines, and the results are presented. Finally, some current issues in unsteady flow visualization are discussed.

Lane, David A.↗

NASA NTRS2003

A Fast Implementation of the ISOCLUS Algorithm

Unsupervised clustering is a fundamental building block in numerous image processing applications. One of the most popular and widely used clustering schemes for remote sensing applications is the ISOCLUS algorithm, which is based on the ISODATA method. The algorithm is given a set of n data points in d-dimensional space, an integer k indicating the initial number of clusters, and a number of additional parameters. The general goal is to compute the coordinates of a set of cluster centers in d-space, such that those centers minimize the mean squared distance from each data point to its nearest center. This clustering algorithm is similar to another well-known clustering method, called k-means. One significant feature of ISOCLUS over k-means is that the actual number of clusters reported might be fewer or more than the number supplied as part of the input. The algorithm uses different heuristics to determine whether to merge lor split clusters. As ISOCLUS can run very slowly, particularly on large data sets, there has been a growing .interest in the remote sensing community in computing it efficiently. We have developed a faster implementation of the ISOCLUS algorithm. Our improvement is based on a recent acceleration to the k-means algorithm of Kanungo, et al. They showed that, by using a kd-tree data structure for storing the data, it is possible to reduce the running time of k-means. We have adapted this method for the ISOCLUS algorithm, and we show that it is possible to achieve essentially the same results as ISOCLUS on large data sets, but with significantly lower running times. This adaptation involves computing a number of cluster statistics that are needed for ISOCLUS but not for k-means. Both the k-means and ISOCLUS algorithms are based on iterative schemes, in which nearest neighbors are calculated until some convergence criterion is satisfied. Each iteration requires that the nearest center for each data point be computed. Naively, this requires O(kn) time, where k denotes the current number of centers. Traditional techniques for accelerating nearest neighbor searching involve storing the k centers in a data structure. However, because of the iterative nature of the algorithm, this data structure would need to be rebuilt with each new iteration. Our approach is to store the data points in a kd-tree data structure. The assignment of points to nearest neighbors is carried out by a filtering process, which successively eliminates centers that can not possibly be the nearest neighbor for a given region of space. This algorithm is significantly faster, because large groups of data points can be assigned to their nearest center in a single operation. Preliminary results on a number of real Landsat datasets show that our revised ISOCLUS-like scheme runs about twice as fast.

Memarsadeghi, Nargess↗

NASA NTRS2001

In-Flight Edge Response Measurements for High Spatial Resolution Remote Sensing Systems

In-flight measurement of spatial resolution were conducted as part of the ASA Scientific Data Purchase (SDP) Validation and Verification (V&V) process. Characterization included remote sensing systems with ground sample distance (GSD) of 1 meter or less, such as the panchromatic imager on-board the ICONOS satellite and the airborne ADAR System 5500 multispectral instrument. Final image products were used to evaluate the effect of both the image acquisition system (e.g., optics, electronics, motion, jitter, atmosphere) and image post-processing (e.g., resampling, modulation trasfer function (MTF) compensator). Spatial resolution was characterized by full width at half maximum (FWHM) of an edge response-derived line spread function. This was found to be a more robust measure of spatial resolution than the value of NTF at Nyquist frequency The edge responses were analysed using the tilted-edge technique that ovecomes the spatial sampling limitations of the digital imaging systems. As an enhancement to existing algorithms, the slope of the edge response and the orientation of the edge target were determined by a single computational process. Adjacent black and white square panels, either painted on a flat surface or deployed as traps, formed the ground-based edge targets used in the tests. Orientation of the deployable tarps was optimized beforehand, based on simulations of the imaging system. Numerous edge target images were analyzed for each of the tested sensors. The effect of such factors as acquisition geometry, temporal variability, MTF compensation, and GSD on spatial resolution were investigated.

Blonski, Slawomir↗

NASA NTRS1973

Survey of computational methods for three-dimensional supersonic inviscid flows with shocks

Hyperbolic systems of partial differential equations governing supersonic inviscid flows are discussed and analyzed. Finite-difference analogues for integrating these systems in the interior of fluid domains are described from two points of view: a differential form approach and an integral form approach. The algorithms presented are analyzed for stability and accuracy. The concept of time splitting is discussed and supplied to these methods to achieve increased numerical efficiency. Techniques for treating conditions at the boundaries of the fluid domain and shock-wave discontinuities at surfaces within the domain are described.

Maccormack, R. W.↗

NASA NTRS1990

Navier-Stokes computation of compressible turbulent flows with a second order closure, part 1

A second order closure turbulence model for compressible flows is developed and implemented in a 2D Reynolds-averaged Navier-Stokes solver. From the beginning where a kappa-epsilon turbulence model was implemented in the bidiagonal implicit method of MACCORMACK (referred to as the MAC3 code) to the final stage of implementing a full second order closure in the efficient line Gauss-Seidel algorithm, numerous work was done, individually and collectively. Besides the collaboration itself, the final product of this work is a second order closure derived from the Launder, Reece, and Rodi model to account for near wall effects, which has been called FRAME model, which stands for FRench-AMerican-Effort. During the reporting period, two different problems were worked out. The first was to provide Ames researchers with a reliable compressible boundary layer code including a wide collection of turbulence models for quick testing of new terms, both in two equations and in second order closure (LRR and FRAME). The second topic was to complete the implementation of the FRAME model in the MAC5 code. The work related to these two different contributions is reported. dilatation in presence of stron shocks. This work, which has been conducted during a work at the Center for Turbulence Research with Zeman aimed also to cros-check earlier assumptions by Rubesin and Vandromme.

Haminh, Hieu↗

NASA NTRS1990

An approach to rescheduling activities based on determination of priority and disruptivity

A constraint-based scheduling system called SPIKE is being used to create long term schedules for the Hubble Space Telescope. Feedback for the spacecraft or from other ground support systems may invalidate some scheduling decisions and those activities concerned must be reconsidered. A function rescheduling priority is defined which for a given activity performs a heuristic analysis and produces a relative numerical value which is used to rank all such entities in the order that they should be rescheduled. A function disruptivity is also defined that is used to place a relative numeric value on how much a pre-existing schedule would be changed in order to reschedule an activity. Using these functions, two algorithms (a stochastic neural network approach and an exhaustive search approach) are proposed to find the best place to reschedule an activity. Prototypes were implemented and preliminary testing reveals that the exhaustive technique produces only marginally better results at much greater computational cost.

Sponsler, Jeffrey L.↗

NASA NTRS1992

A generalized gamma(s)-family of self-starting algorithms for computational structural dynamics

A generalized gamma(s)-family of self-starting single-step formulations are presented in order to provide simplified yet effective dynamic attributes to include features towards eliminating the need to involve accelerations in the computational process for structural dynamic problems. By appropriately selecting the parameters pertaining to gamma(s)(s = 1, 2, 3), both explicit and implicit formulations are obtained. The stability and accuracy characteristics of the gamma(s)-family of representations are presented to validate the robustness of the formulations for structural dynamic problems. Numerous illustrative examples are described and the results are in excellent agreement and validate the applicability of these formulations for structural dynamic computations.

Namburu, Raju R.↗

NASA NTRS1993

Efficient simulation of incompressible viscous flow over multi-element airfoils

The incompressible, viscous, turbulent flow over single and multi-element airfoils is numerically simulated in an efficient manner by solving the incompressible Navier-Stokes equations. The solution algorithm employs the method of pseudo compressibility and utilizes an upwind differencing scheme for the convective fluxes, and an implicit line-relaxation scheme. The motivation for this work includes interest in studying high-lift take-off and landing configurations of various aircraft. In particular, accurate computation of lift and drag at various angles of attack up to stall is desired. Two different turbulence models are tested in computing the flow over an NACA 4412 airfoil; an accurate prediction of stall is obtained. The approach used for multi-element airfoils involves the use of multiple zones of structured grids fitted to each element. Two different approaches are compared; a patched system of grids, and an overlaid Chimera system of grids. Computational results are presented for two-element, three-element, and four-element airfoil configurations. Excellent agreement with experimental surface pressure coefficients is seen. The code converges in less than 200 iterations, requiring on the order of one minute of CPU time on a CRAY YMP per element in the airfoil configuration.

Rogers, Stuart E.↗

NASA NTRS2005

Assessment of an Explicit Algebraic Reynolds Stress Model

This study assesses an explicit algebraic Reynolds stress turbulence model in the in the three-dimensional Reynolds averaged Navier-Stokes (RANS) solver, ISAAC (Integrated Solution Algorithm for Arbitrary Con gurations). Additionally, it compares solutions for two select configurations between ISAAC and the RANS solver PAB3D. This study compares with either direct numerical simulation data, experimental data, or empirical models for several different geometries with compressible, separated, and high Reynolds number flows. In general, the turbulence model matched data or followed experimental trends well, and for the selected configurations, the computational results of ISAAC closely matched those of PAB3D using the same turbulence model.

Carlson, Jan-Renee↗

NASA NTRS2006

Development of Comprehensive Reduced Kinetic Models for Supersonic Reacting Shear Layer Simulations

Large-scale simulations of multi-dimensional unsteady turbulent reacting flows with detailed chemistry and transport can be computationally extremely intensive even on distributed computing architectures. With the development of suitable reduced chemical kinetic models, the number of scalar variables to be integrated can be decreased, leading to a significant reduction in the computational time required for the simulation with limited loss of accuracy in the results. A general MATLAB-based automated mechanism reduction procedure is presented to reduce any complex starting mechanism (detailed or skeletal) with minimal human intervention. Based on the application of the quasi steady-state (QSS) approximation for certain chemical species and on the elimination of the fast reaction rates in the mechanism, several comprehensive reduced models, capable of handling different fuels such as C2H4, CH4 and H2, have been developed and thoroughly tested for several combustion problems (ignition, propagation and extinction) and physical conditions (reactant compositions, temperatures, and pressures). A key feature of the present reduction procedure is the explicit solution of the concentrations of the QSS species, needed for the evaluation of the elementary reaction rates. In contrast, previous approaches relied on an implicit solution due to the strong coupling between QSS species, requiring computationally expensive inner iterations. A novel algorithm, based on the definition of a QSS species coupling matrix, is presented to (i) introduce appropriate truncations to the QSS algebraic relations and (ii) identify the optimal sequence for the explicit solution of the concentration of the QSS species. With the automatic generation of the relevant source code, the resulting reduced models can be readily implemented into numerical codes.

Zambon, A. C.↗

NASA NTRSDate not supplied

Derivation of Effective Properties Based on Porous Scale Simulations Using Filtering Techniques

This study presents a method for derivation of effective properties at the interface and in-depth of porous materials. The method defines a Representative Elementary Volume (REV) and applies filtering techniques to computer effective properties such as porosity and flow quantities, such as velocity and pressure. The script, developed to process the data was tested on the VTK type files that contain the mesh information and the flow solution. The method allows to choose between two types of filters, such as cellular and top-hat and define the size of the REV and number of samples along the domain. Extraction of the REV from the domain is performed to exact boundaries requested for the user. This is done using a triangulation technique and cutting through the cells to comply to the requested boundaries of the volume. The method can be applied to both structured and unstructured meshes. Filtering the material porosity and flow quantities involves integration of the numerical data. The algorithm provides three integration methods, such as Riemann sum, Monte Carlo and Quadrature rule to perform the integration. The Monte-Carlo technique permits the use of either uniform or linearly spaced distribution of points. The Quadrature rule is currently applicable to tetrahedral element types. The Monte Carlo and Quadrature rule methods require interpolation of the flow quantities at the sample points. For interpolation, two methods were tested and are readily available, Gaussian interpolation and re-sampling. It has been shown that re-sampling method has better consistency and acceptable accuracy in interpolation of the data. The algorithm was written in Python language and uses a number of modules. The major module besides numpy is PyVista. It is used to process the computational domain, clip the REV and interpolate the data. Quadrature rule integration was performed using a quadpy module. ParaView software was used externally to convert the flow solution to the VTK (or more specifically VTU) format. Integration of ParaView in the same environment with PyVista encountered problems and could not be implemented in this work. The developed algorithm is expected to be applicable to unstructured meshes and more complex porous structures as soon as the data can be passed in VTK type format. With the report is provided Python script for filtering the solution and a Matlab script for simple generation and processing of 2-D and 3-D porous channel geometries. The two scripts don't communicate.

Alexsander Zibitsker↗

NASA NTRS1976

Dynamic analysis of a class of mixed lumped-distributed parameter systems via numerical techniques

The modeling via transfer matrices of mixed lumped-distributed parameter systems with feedback control is discussed and novel methods of obtaining information on the controlled system's dynamic response via numerical methods is presented. These methods utilize numerical searches in the complex plane for the roots of the transcendental characteristic equation to determine the closed loop system eigenvalues. The fast Fourier transform (FFT) algorithm is utilized but in the inverse fashion (from frequency domain to time domain). The information obtained is identical to that contained in a model in modal coordinates, and can be used to construct such a model. An interactive computer program to do the required calculation is described, as well as its application to a manipulator arm design problem.

Book, W. J.↗

NASA NTRS1978

An implicit algorithm for the conservative transonic full potential equation using an arbitrary mesh

A new, implicit approximate factorization (AF) algorithm designed to solve the conservative full-potential equation for the transonic flow past arbitrary airfoils has been developed. The new algorithm uses an upwind bias of the density coefficient to provide stability in supersonic regions. This allows the simple two- and three-banded matrix form of the AF scheme to be retained over the entire flow field, even in regions of supersonic flow. A numerical transformation is used to establish an arbitrary body-fitted finite-difference mesh. Airfoil pressure distributions have been computed and are in good agreement with independent results.

Holst, T. L.↗

NASA NTRS1983

Numerical solution of the problem of flame propagation by the use of the random element method

A numerical, grid-free algorithm is presented for one-dimensional reaction-diffusion model of laminar flame propagation in premixed gases. It is based on the random element method we developed for the analysis of diffusional processes. The effect of combustion is taken into account by applying the principle of fractional steps to separate the process of diffusion, modeled by the random walk of computational elements, from the exothermic effects of chemical reaction, monitoring their strength. The validity of the algorithm is demonstrated by application to flame propagation problems for which exact solutions exist. The flame speed evaluated by its use oscillates around the exact value at a relatively small amplitude, while the temperature and species concentration profiles are self-correcting in their convergence to the exact solution. A satisfactory resolution is obtained by the use of quite a small number of computational elements which automatically adjust their distribution of fit sharp gradients.

Ghoniem, A. F.↗