Search NASA⌕ Search

SEARCH · Search NASA

Results for “grid steps”

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

Atmospheric Chemistry Modeling and Air Quality Forecasting Using Machine Learning

Atmospheric chemistry models are a central tool to study the impact of chemical constituents on the environment, vegetation and human health. These models split the atmosphere in a large number of grid-boxes and consider the emission of compounds into these boxes and their subsequent transport, deposition, and chemical processing. The chemistry is represented through a series of simultaneous ordinary differential equations, one for each compound. Given the difference in life-times between the chemical compounds (milli-seconds for O1D to years for CH4) these equations are numerically stiff and solving them consists of a significant fraction of the computational burden of a chemistry model.We have investigated a machine learning approach to emulate the chemistry instead of solving the differential equations numerically. From a one-month simulation of the GEOS-Chem model we have produced a training dataset consisting of the concentration of compounds before and after the differential equations are solved, together with some key physical parameters for every grid-box and time-step. From this dataset we have trained a machine learning algorithm (regression forest) to be able to predict the concentration of the compounds after the integration step based on the concentrations and physical state at the beginning of the time step. We have then included this algorithm back into the GEOS-Chem model, bypassing the need to integrate the chemistry.This machine learning approach shows many of the characteristics of the full simulation and has the potential to be substantially faster. There are a wide range of application for such an approach - generating boundary conditions, for use in air quality forecasts, chemical data assimilation systems, etc. We discuss speed and accuracy of our approach, and highlight some potential future directions for improving it.

Keller, Christoph A.↗

Multigrid, Fractional-Step Computation Of Flow

Speed of computer code solving three-dimensional Navier-Stokes equations of flow of incompressible fluid by fractional-step method increased significantly by use of multigrid procedures. In method, equations solved on general nonorthogonal curvilinear coordinate grid, using volume fluxes. At each time step, computations performed in two fractional steps. In first step, equations of conservation of momentum solved by use of gradient of pressure from previous time step via explicit approximate-factorization method, yielding approximate flow field that does not satisfy equation of conservation of mass. In second step, discrete Poisson-like equation with Neumann-type boundary conditions, formed by combining equations of conservation of momentum and mass, solved iteratively.

Kwak, Dochan↗

Large time-step stability of explicit one-dimensional advection schemes

There is a wide-spread belief that most explicit one-dimensional advection schemes need to satisfy the so-called 'CFL condition' - that the Courant number, c = udelta(t)/delta(x), must be less than or equal to one, for stability in the von Neumann sense. This puts severe limitations on the time-step in high-speed, fine-grid calculations and is an impetus for the development of implicit schemes, which often require less restrictive time-step conditions for stability, but are more expensive per time-step. However, it turns out that, at least in one dimension, if explicit schemes are formulated in a consistent flux-based conservative finite-volume form, von Neumann stability analysis does not place any restriction on the allowable Courant number. Any explicit scheme that is stable for c is less than 1, with a complex amplitude ratio, G(c), can be easily extended to arbitrarily large c. The complex amplitude ratio is then given by exp(- (Iota)(Nu)(Theta)) G(delta(c)), where N is the integer part of c, and delta(c) = c - N (less than 1); this is clearly stable. The CFL condition is, in fact, not a stability condition at all, but, rather, a 'range restriction' on the 'pieces' in a piece-wise polynomial interpolation. When a global view is taken of the interpolation, the need for a CFL condition evaporates. A number of well-known explicit advection schemes are considered and thus extended to large delta(t). The analysis also includes a simple interpretation of (large delta(t)) total-variation-diminishing (TVD) constraints.

Leonard, B. P.↗

Knowledge-based zonal grid generation for computational fluid dynamics

Automation of flow field zoning in two dimensions is an important step towards reducing the difficulty of three-dimensional grid generation in computational fluid dynamics. Using a knowledge-based approach makes sense, but problems arise which are caused by aspects of zoning involving perception, lack of expert consensus, and design processes. These obstacles are overcome by means of a simple shape and configuration language, a tunable zoning archetype, and a method of assembling plans from selected, predefined subplans. A demonstration system for knowledge-based two-dimensional flow field zoning has been successfully implemented and tested on representative aerodynamic configurations. The results show that this approach can produce flow field zonings that are acceptable to experts with differing evaluation criteria.

Andrews, Alison E.↗

Propulsion-related flowfields using the preconditioned Navier-Stokes equations

A previous time-derivative preconditioning procedure for solving the Navier-Stokes is extended to the chemical species equations. The scheme is implemented using both the implicit ADI and the explicit Runge-Kutta algorithms. A new definition for time-step is proposed to enable grid-independent convergence. Several examples of both reacting and non-reacting propulsion-related flowfields are considered. In all cases, convergence that is superior to conventional methods is demonstrated. Accuracy is verified using the example of a backward facing step. These results demonstrate that preconditioning can enhance the capability of density-based methods over a wide range of Mach and Reynolds numbers.

Venkateswaran, S.↗

Application of FUN3D and CFL3D to the Third Workshop on CFD Uncertainty Analysis

Two Reynolds-averaged Navier-Stokes computer codes - one unstructured and one structured - are applied to two workshop cases (for the 3rd Workshop on CFD Uncertainty Analysis, held at Instituto Superior Tecnico, Lisbon, in October 2008) for the purpose of uncertainty analysis. The Spalart-Allmaras turbulence model is employed. The first case uses the method of manufactured solution and is intended as a verification case. In other words, the CFD solution is expected to approach the exact solution as the grid is refined. The second case is a validation case (comparison against experiment), for which modeling errors inherent in the turbulence model and errors/uncertainty in the experiment may prevent close agreement. The results from the two computer codes are also compared. This exercise verifies that the codes are consistent both with the exact manufactured solution and with each other. In terms of order property, both codes behave as expected for the manufactured solution. For the backward facing step, CFD uncertainty on the finest grid is computed and is generally very low for both codes (whose results are nearly identical). Agreement with experiment is good at some locations for particular variables, but there are also many areas where the CFD and experimental uncertainties do not overlap.

Rumsey, C. L.↗

A Navier-Strokes Chimera Code on the Connection Machine CM-5: Design and Performance

We have implemented a three-dimensional compressible Navier-Stokes code on the Connection Machine CM-5. The code is set up for implicit time-stepping on single or multiple structured grids. For multiple grids and geometrically complex problems, we follow the 'chimera' approach, where flow data on one zone is interpolated onto another in the region of overlap. We will describe our design philosophy and give some timing results for the current code. A parallel machine like the CM-5 is well-suited for finite-difference methods on structured grids. The regular pattern of connections of a structured mesh maps well onto the architecture of the machine. So the first design choice, finite differences on a structured mesh, is natural. We use centered differences in space, with added artificial dissipation terms. When numerically solving the Navier-Stokes equations, there are liable to be some mesh cells near a solid body that are small in at least one direction. This mesh cell geometry can impose a very severe CFL (Courant-Friedrichs-Lewy) condition on the time step for explicit time-stepping methods. Thus, though explicit time-stepping is well-suited to the architecture of the machine, we have adopted implicit time-stepping. We have further taken the approximate factorization approach. This creates the need to solve large banded linear systems and creates the first possible barrier to an efficient algorithm. To overcome this first possible barrier we have considered two options. The first is just to solve the banded linear systems with data spread over the whole machine, using whatever fast method is available. This option is adequate for solving scalar tridiagonal systems, but for scalar pentadiagonal or block tridiagonal systems it is somewhat slower than desired. The second option is to 'transpose' the flow and geometry variables as part of the time-stepping process: Start with x-lines of data in-processor. Form explicit terms in x, then transpose so y-lines of data are in-processor. Form explicit terms in y, then transpose so z-lines are in processor. Form explicit terms in z, then solve linear systems in the z-direction. Transpose to the y-direction, then solve linear systems in the y-direction. Finally transpose to the x direction and solve linear systems in the x-direction. This strategy avoids inter-processor communication when differencing and solving linear systems, but requires a large amount of communication when doing the transposes. The transpose method is more efficient than the non-transpose strategy when dealing with scalar pentadiagonal or block tridiagonal systems. For handling geometrically complex problems the chimera strategy was adopted. For multiple zone cases we compute on each zone sequentially (using the whole parallel machine), then send the chimera interpolation data to a distributed data structure (array) laid out over the whole machine. This information transfer implies an irregular communication pattern, and is the second possible barrier to an efficient algorithm. We have implemented these ideas on the CM-5 using CMF (Connection Machine Fortran), a data parallel language which combines elements of Fortran 90 and certain extensions, and which bears a strong similarity to High Performance Fortran. We make use of the Connection Machine Scientific Software Library (CMSSL) for the linear solver and array transpose operations.

Jespersen, Dennis C.↗

Agglomeration multigrid for the three-dimensional Euler equations

A multigrid procedure that makes use of coarse grids generated by the agglomeration of control volumes is advocated as a practical approach for solving the three dimensional Euler equations on unstructured grids about complex configurations. It is shown that the agglomeration procedure can be tailored to achieve certain coarse grid properties such as the sizes of the coarse grids and aspect ratios of the coarse grid cells. The agglomeration is done as a preprocessing step and runs in linear time. The implications for multigrid of using arbitrary polyhedral coarse grids are discussed. The agglomeration multigrid technique compares very favorably with existing multigrid procedures both in terms of convergence rates and elapsed times. The main advantage of the present approach is the ease with which coarse grids of any desired degree of coarseness may be generated in three dimensions, without being constrained by considerations of geometry. Inviscid flows over a variety of complex configurations are computed using the agglomeration multigrid strategy.

Venkatakrishnan, V.↗

Planning paths through a spatial hierarchy - Eliminating stair-stepping effects

Stair-stepping effects are a result of the loss of spatial continuity resulting from the decomposition of space into a grid. This paper presents a path planning algorithm which eliminates stair-stepping effects induced by the grid-based spatial representation. The algorithm exploits a hierarchical spatial model to efficiently plan paths for a mobile robot operating in dynamic domains. The spatial model and path planning algorithm map to a parallel machine, allowing the system to operate incrementally, thereby accounting for unexpected events in the operating space.

Slack, Marc G.↗

Complexity Computational Environment: Data Assimilation SERVOGrid

We are using Web (Grid) service technology to demonstrate the assimilation of multiple distributed data sources (a typical data grid problem) into a major parallel high-performance computing earthquake forecasting code. Such a linkage of Geoinformatics with Geocomplexity demonstrates the value of the Solid Earth Research Virtual Observatory (SERVO) Grid concept, and advance Grid technology by building the first real-time large-scale data assimilation grid Here we develop the next steps for both the SERVO concept and the identified need for a Solid Earth problem-solving environment. We use a challenging motivating problem of importance to NASA namely integrating NASA space geodetic observations with numerical simulations of a changing earth.

data assimiliation↗

A time-accurate multiple-grid algorithm

A time-accurate multiple-grid algorithm is described. The algorithm allows one to take much larger time steps with an explicit time-marching scheme than would otherwise be the case. Sample calculations of a scalar advection equation and the Euler equations for an oscillating airfoil are shown. For the oscillating airfoil, time steps an order of magnitude larger than the single-grid algorithm are possible.

Jespersen, D. C.↗

Monitoring Thermal Status of Ecosystems with MODIS Land-Surface Temperature and Vegetation Index Products

The global land-surface temperature (LST) and normalized difference vegetation index (NDVI) products retrieved from Moderate Resolution Imaging Spectroradiometer (MODIS) data in 2001 were used in this study. The yearly peak values of NDVI data at 5km grids were used to define six NDVI peak zones from -0.2 to 1 in steps of 0.2, and the monthly NDVI values at each grid were sorted in decreasing order, resulting in 12 layers of NDVI images for each of the NDVI peak zones. The mean and standard deviation of daytime LSTs and day-night LST differences at the grids corresponding to the first layer of NDVI images characterize the thermal status of terrestrial ecosystems in the NDVI peak zones. For the ecosystems in the 0.8-1 NDVI peak zone, daytime LSTs distribute from 0-35 C and day-night LST differences distribute from -2 to 22 C. The daytime LSTs and day-night LST differences corresponding to the remaining layers of NDVI images show that the growth of vegetation is limited at low and high LSTs. LSTs and NDVI may be used to monitor photosynthetic activity and drought, as shown in their applications to a flood-irrigated grassland in California and an unirrigated grassland in Nevada.

Wan, Zhengming↗

Modeling and Grid Generation of Iced Airfoils

SmaggIce Version 2.0 is a software toolkit for geometric modeling and grid generation for two-dimensional, singleand multi-element, clean and iced airfoils. A previous version of SmaggIce was described in Preparing and Analyzing Iced Airfoils, NASA Tech Briefs, Vol. 28, No. 8 (August 2004), page 32. To recapitulate: Ice shapes make it difficult to generate quality grids around airfoils, yet these grids are essential for predicting ice-induced complex flow. This software efficiently creates high-quality structured grids with tools that are uniquely tailored for various ice shapes. SmaggIce Version 2.0 significantly enhances the previous version primarily by adding the capability to generate grids for multi-element airfoils. This version of the software is an important step in streamlining the aeronautical analysis of ice airfoils using computational fluid dynamics (CFD) tools. The user may prepare the ice shape, define the flow domain, decompose it into blocks, generate grids, modify/divide/merge blocks, and control grid density and smoothness. All these steps may be performed efficiently even for the difficult glaze and rime ice shapes. Providing the means to generate highly controlled grids near rough ice, the software includes the creation of a wrap-around block (called the "viscous sublayer block"), which is a thin, C-type block around the wake line and iced airfoil. For multi-element airfoils, the software makes use of grids that wrap around and fill in the areas between the viscous sub-layer blocks for all elements that make up the airfoil. A scripting feature records the history of interactive steps, which can be edited and replayed later to produce other grids. Using this version of SmaggIce, ice shape handling and grid generation can become a practical engineering process, rather than a laborious research effort.

Vickerman, Mary B.↗

Time-dependent aerodynamic analysis of ducted and unducted propfans at angle of attack

A three-dimensional unsteady aerodynamic analysis is described for predicting the time-dependent flow about ducted and unducted propfans operating at angle of attack. Although the freestream is assumed to be uniform, the flow relative to the rotating blades varies with circumferential position, resulting in an inherent unsteadiness due to the nonaxial inflow. The time-dependent Euler equations are solved utilizing a Runge-Kutta time-stepping scheme. The analysis is based on a finite-volume discretization employing a multiple-block grid network. To permit the use of large calculation time steps, an implicit residual smoothing scheme previously tested for unsteady flow calculations in two dimensions is extended to three spatial dimensions. For unducted propfans, a single H-type grid block is used for each blade passage to determine the time-periodic flowfield. For ducted propfans (ultra-high bypass fans) a body-centered C-type grid is wrapped about the cowl to improve the accuracy of the analysis in the high gradient flow region near the cowl leading edge. Numerical results are compared with available data for both ducted and unducted propfans operating at angle of attack.

Hall, Edward J.↗

Divergence preserving discrete surface integral methods for Maxwell's curl equations using non-orthogonal unstructured grids

Several new discrete surface integral (DSI) methods for solving Maxwell's equations in the time-domain are presented. These methods, which allow the use of general nonorthogonal mixed-polyhedral unstructured grids, are direct generalizations of the canonical staggered-grid finite difference method. These methods are conservative in that they locally preserve divergence or charge. Employing mixed polyhedral cells, (hexahedral, tetrahedral, etc.) these methods allow more accurate modeling of non-rectangular structures and objects because the traditional stair-stepped boundary approximations associated with the orthogonal grid based finite difference methods can be avoided. Numerical results demonstrating the accuracy of these new methods are presented.

Madsen, Niel K.↗

A numerical method for integrating the kinetic equations of droplet spectra evolution by condensation/evaporation and by coalescence/breakup processes

An extension of the method of moments is developed for the numerical integration of the kinetic equations of droplet spectra evolution by condensation/evaporation and by coalescence/breakup processes. The number density function n sub k (x,t) in each separate droplet packet between droplet mass grid points (x sub k, x sub k+1) is represented by an expansion in orthogonal polynomials with a given weighting function. In this way droplet number concentrations, liquid water contents and other moments in each droplet packet are conserved and the problem of solving the kinetic equations is replaced by one of solving a set of coupled differential equations for the number density function moments. The method is tested against analytic solutions of the corresponding kinetic equations. Numerical results are obtained for different coalescence/breakup and condensation/evaporation kernels and for different initial droplet spectra. Also droplet mass grid intervals, weighting functions, and time steps are varied.

Emukashvily, I. M.↗

An enhanced version of an implicit code for the Euler equations

A two-dimensional implicit finite-difference code is applied to the inviscid Euler equations to compute transonic flow past airfoils in order to provide well-documented standard test cases for the general user community. The code is an improved version of Steger's 1976 implicit code. Enhancements include the use of up-wind differencing in supersonic regions before shocks and a variable time step to accelerate convergence. An airfoil grid generation routine based on algebraic techniques is employed. The grids are clustered near shocks to improve resolution. Computed results are compared with other numerical results from the literature.

Pulliam, T. H.↗

Numerical simulation of the Weddell Sea pack ice

In order to determine the degree to which a coupled dynamic thermodynamic model can reproduce the seasonal cycle of the Antarctic Sea ice in the Weddell Sea, a series of two-year simulations of the Weddell Sea ice pack were carried out. The simulations employed Hibler's (1979) model and used a one-day time step on an 18 x 15 grid with a resolution of 222 km. Daily atmospheric data from 1979 were used to drive the simulations. The simulations yielded a seasonal cycle of ice with maximum and minimum extents close to that observed. Except for portions of the western Weddell, the advance of the ice is found to be primarily thermodynamic in nature, while the rapid decay depends critically on the presence of both leads and lateral ice advection. In early summer the ice motion causes a residual tongue of ice to extend eastward from the Antarctic Peninsula in agreement with observations. Mean ice thicknesses are consistent with observations, as are the mean drift rates of about 5 km/day.

Hibler, W. D., III↗