Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “grids”

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 55 records · Page 3

Evaluation of the Monotonic Lagrangian Grid and Lat-Long Grid for Air Traffic Management

The Air Traffic Monotonic Lagrangian Grid (ATMLG) is used to simulate a 24 hour period of air traffic flow in the National Airspace System (NAS). During this time period, there are 41,594 flights over the United States, and the flight plan information (departure and arrival airports and times, and waypoints along the way) are obtained from an Federal Aviation Administration (FAA) Enhanced Traffic Management System (ETMS) dataset. Two simulation procedures are tested and compared: one based on the Monotonic Lagrangian Grid (MLG), and the other based on the stationary Latitude-Longitude (Lat- Long) grid. Simulating one full day of air traffic over the United States required the following amounts of CPU time on a single processor of an SGI Altix: 88 s for the MLG method, and 163 s for the Lat-Long grid method. We present a discussion of the amount of CPU time required for each of the simulation processes (updating aircraft trajectories, sorting, conflict detection and resolution, etc.), and show that the main advantage of the MLG method is that it is a general sorting algorithm that can sort on multiple properties. We discuss how many MLG neighbors must be considered in the separation assurance procedure in order to ensure a five-mile separation buffer between aircraft, and we investigate the effect of removing waypoints from aircraft trajectories. When aircraft choose their own trajectory, there are more flights with shorter duration times and fewer CD&R maneuvers, resulting in significant fuel savings.

Kaplan, Carolyn↗

Evaluating the Information Power Grid using the NAS Grid Benchmarks

The NAS Grid Benchmarks (NGB) are a collection of synthetic distributed applications designed to rate the performance and functionality of computational grids. We compare several implementations of the NGB to determine programmability and efficiency of NASA's Information Power Grid (IPG), whose services are mostly based on the Globus Toolkit. We report on the overheads involved in porting existing NGB reference implementations to the IPG. No changes were made to the component tasks of the NGB can still be improved.

VanderWijngaartm Rob F.↗

The AgMIP GRIDded Crop Modeling Initiative (AgGRID) and the Global Gridded Crop Model Intercomparison (GGCMI)

Climate change is a significant risk for agricultural production. Even under optimistic scenarios for climate mitigation action, present-day agricultural areas are likely to face significant increases in temperatures in the coming decades, in addition to changes in precipitation, cloud cover, and the frequency and duration of extreme heat, drought, and flood events (IPCC, 2013). These factors will affect the agricultural system at the global scale by impacting cultivation regimes, prices, trade, and food security (Nelson et al., 2014a). Global-scale evaluation of crop productivity is a major challenge for climate impact and adaptation assessment. Rigorous global assessments that are able to inform planning and policy will benefit from consistent use of models, input data, and assumptions across regions and time that use mutually agreed protocols designed by the modeling community. To ensure this consistency, large-scale assessments are typically performed on uniform spatial grids, with spatial resolution of typically 10 to 50 km, over specified time-periods. Many distinct crop models and model types have been applied on the global scale to assess productivity and climate impacts, often with very different results (Rosenzweig et al., 2014). These models are based to a large extent on field-scale crop process or ecosystems models and they typically require resolved data on weather, environmental, and farm management conditions that are lacking in many regions (Bondeau et al., 2007; Drewniak et al., 2013; Elliott et al., 2014b; Gueneau et al., 2012; Jones et al., 2003; Liu et al., 2007; M¨uller and Robertson, 2014; Van den Hoof et al., 2011;Waha et al., 2012; Xiong et al., 2014). Due to data limitations, the requirements of consistency, and the computational and practical limitations of running models on a large scale, a variety of simplifying assumptions must generally be made regarding prevailing management strategies on the grid scale in both the baseline and future periods. Implementation differences in these and other modeling choices contribute to significant variation among global-scale crop model assessments in addition to differences in crop model implementations that also cause large differences in site-specific crop modeling (Asseng et al., 2013; Bassu et al., 2014).

climate↗

IGB grid: User's manual (A turbomachinery grid generation code)

A grid generation code called IGB is presented for use in computational investigations of turbomachinery flowfields. It contains a combination of algebraic and elliptic techniques coded for use on an interactive graphics workstation. The instructions for use and a test case are included.

Beach, T. A.↗

Impeller tandem blade study with grid embedding for local grid refinement

Flow non-uniformity at the discharge of high power density impellers can result in significant unsteady interactions between impeller blades and downstream diffuser vanes. These interactions result in degradation of both performance and pump reliability. The MSFC Pump Technology Team has recognized the importance of resolving this problem and has thus initiated the development and testing of a high head coefficient impeller. One of the primary goals of this program is to improve impeller performance and discharge flow uniformity. The objective of the present work is complimentary. Flow uniformity and performance gains were sought through the application of a tandem blade arrangement. The approach adopted was to numerically establish flow characteristics at the impeller discharge for the baseline MSFC impeller and then parametrically evaluate tandem blade configurations. A tandem design was sought that improves both impeller performance and discharge uniformity. The Navier-Stokes solver AEROVISC was used to conduct the study. Grid embedding is used to resolve local gradients while attempting to minimize model size. Initial results indicate that significant gains in flow uniformity can be achieved through the tandem blade concept and that blade clocking rather than slot location is the primary driver for flow uniformity.

Bache, George↗

Automated Unstructured Grid Adaptation on a Strut Fuel Injector at Hypervelocity Flow Conditions

Computational fluid dynamics (CFD) analysis is presented with the use of an automated unstructured grid adaptation tool on a strut fuel injector at hypervelocity flow conditions. The analysis was carried out with the VULCAN-CFD solver using Reynolds-averaged simulations (RAS). The hypervelocity flow conditions match the high Mach number flow of the experiments conducted as part of the Enhanced Injection and Mixing Project (EIMP) at the NASA Langley Research Center (LaRC). The current work uses an automated grid adaptation tool recently implemented in VULCAN-CFD, and explores this tool’s ability to solve highspeed mixing problems. Simulation results obtained using the unstructured adaptive grid approach are compared to those on a user-generated structured grid. These results are evaluated by analyzing how efficiently comparable fidelity results are obtained from both adapted and structured simulations. In addition, two adaptation strategies were used to explore the impact on the final solution. In the current work, the unstructured grid adaptation tool automatically generates unstructured grids and performs adaptation of the grid based on a Hessian error estimate of a specified flowfield parameter. Multiple adaptations were executed using each run strategy with the one-dimensional values of the mixing efficiency used to determine grid convergence and for comparison with the structured grid simulation results. It was found that the unstructured adaptive grid simulations were able to produce results that matched closely with those on structured grids using far fewer grid cells, and thus, requiring far less computational time to reach the solution. It was also discovered that the adaptation run strategy influenced the total number of grid cells and the efficiency with which a final grid-adapted solution was reached. Furthermore, motivated by the grid convergence index (GCI) used for structured grid simulations, a grid convergence estimate (GCE) was developed and demonstrated for the grid adaptation. Overall, the investigation demonstrated that the automated unstructured grid adaptation tool implemented in VULCAN-CFD is capable of accurately and efficiently solving complex high-speed mixing problems with only a fraction of the grid cells required to obtain comparable results on a user-generated structured grid.

hypersonics↗

Automated Unstructured Grid Adaptation on a Strut Fuel Injector at Hypervelocity Flow Conditions

Computational fluid dynamics (CFD) analysis is presented with the use of an automated unstructured grid adaptation tool on a strut fuel injector at hypervelocity flow conditions. The analysis was carried out with the VULCAN-CFD solver using Reynolds-averaged simulations (RAS). The hypervelocity flow conditions match the high Mach number flow of the experiments conducted as part of the Enhanced Injection and Mixing Project (EIMP) at the NASA Langley Research Center (LaRC). The current work uses an automated grid adaptation tool recently implemented in VULCAN-CFD, and explores this tool’s ability to solve highspeed mixing problems. Simulation results obtained using the unstructured adaptive grid approach are compared to those on a user-generated structured grid. These results are evaluated by analyzing how efficiently comparable fidelity results are obtained from both adapted and structured simulations. In addition, two adaptation strategies were used to explore the impact on the final solution. In the current work, the unstructured grid adaptation tool automatically generates unstructured grids and performs adaptation of the grid based on a Hessian error estimate of a specified flowfield parameter. Multiple adaptations were executed using each run strategy with the one-dimensional values of the mixing efficiency used to determine grid convergence and for comparison with the structured grid simulation results. It was found that the unstructured adaptive grid simulations were able to produce results that matched closely with those on structured grids using far fewer grid cells, and thus, requiring far less computational time to reach the solution. It was also discovered that the adaptation run strategy influenced the total number of grid cells and the efficiency with which a final grid-adapted solution was reached. Furthermore, motivated by the grid convergence index (GCI) used for structured grid simulations, a grid convergence estimate (GCE) was developed and demonstrated for the grid adaptation. Overall, the investigation demonstrated that the automated unstructured grid adaptation tool implemented in VULCAN-CFD is capable of accurately and efficiently solving complex high-speed mixing problems with only a fraction of the grid cells required to obtain comparable results on a user-generated structured grid.

hypersonics↗

GRID2D/3D: A computer program for generating grid systems in complex-shaped two- and three-dimensional spatial domains. Part 2: User's manual and program listing

An efficient computer program, called GRID2D/3D, was developed to generate single and composite grid systems within geometrically complex two- and three-dimensional (2- and 3-D) spatial domains that can deform with time. GRID2D/3D generates single grid systems by using algebraic grid generation methods based on transfinite interpolation in which the distribution of grid points within the spatial domain is controlled by stretching functions. All single grid systems generated by GRID2D/3D can have grid lines that are continuous and differentiable everywhere up to the second-order. Also, grid lines can intersect boundaries of the spatial domain orthogonally. GRID2D/3D generates composite grid systems by patching together two or more single grid systems. The patching can be discontinuous or continuous. For continuous composite grid systems, the grid lines are continuous and differentiable everywhere up to the second-order except at interfaces where different single grid systems meet. At interfaces where different single grid systems meet, the grid lines are only differentiable up to the first-order. For 2-D spatial domains, the boundary curves are described by using either cubic or tension spline interpolation. For 3-D spatial domains, the boundary surfaces are described by using either linear Coon's interpolation, bi-hyperbolic spline interpolation, or a new technique referred to as 3-D bi-directional Hermite interpolation. Since grid systems generated by algebraic methods can have grid lines that overlap one another, GRID2D/3D contains a graphics package for evaluating the grid systems generated. With the graphics package, the user can generate grid systems in an interactive manner with the grid generation part of GRID2D/3D. GRID2D/3D is written in FORTRAN 77 and can be run on any IBM PC, XT, or AT compatible computer. In order to use GRID2D/3D on workstations or mainframe computers, some minor modifications must be made in the graphics part of the program; no modifications are needed in the grid generation part of the program. The theory and method used in GRID2D/3D is described.

Bailey, R. T.↗

GRID2D/3D: A computer program for generating grid systems in complex-shaped two- and three-dimensional spatial domains. Part 1: Theory and method

An efficient computer program, called GRID2D/3D was developed to generate single and composite grid systems within geometrically complex two- and three-dimensional (2- and 3-D) spatial domains that can deform with time. GRID2D/3D generates single grid systems by using algebraic grid generation methods based on transfinite interpolation in which the distribution of grid points within the spatial domain is controlled by stretching functions. All single grid systems generated by GRID2D/3D can have grid lines that are continuous and differentiable everywhere up to the second-order. Also, grid lines can intersect boundaries of the spatial domain orthogonally. GRID2D/3D generates composite grid systems by patching together two or more single grid systems. The patching can be discontinuous or continuous. For continuous composite grid systems, the grid lines are continuous and differentiable everywhere up to the second-order except at interfaces where different single grid systems meet. At interfaces where different single grid systems meet, the grid lines are only differentiable up to the first-order. For 2-D spatial domains, the boundary curves are described by using either cubic or tension spline interpolation. For 3-D spatial domains, the boundary surfaces are described by using either linear Coon's interpolation, bi-hyperbolic spline interpolation, or a new technique referred to as 3-D bi-directional Hermite interpolation. Since grid systems generated by algebraic methods can have grid lines that overlap one another, GRID2D/3D contains a graphics package for evaluating the grid systems generated. With the graphics package, the user can generate grid systems in an interactive manner with the grid generation part of GRID2D/3D. GRID2D/3D is written in FORTRAN 77 and can be run on any IBM PC, XT, or AT compatible computer. In order to use GRID2D/3D on workstations or mainframe computers, some minor modifications must be made in the graphics part of the program; no modifications are needed in the grid generation part of the program. This technical memorandum describes the theory and method used in GRID2D/3D.

Shih, T. I.-P.↗

Grid Technology as a Cyberinfrastructure for Delivering High-End Services to the Earth and Space Science Community

Grid technology consists of middleware that permits distributed computations, data and sensors to be seamlessly integrated into a secure, single-sign-on processing environment. In &is environment, a user has to identify and authenticate himself once to the grid middleware, and then can utilize any of the distributed resources to which he has been,panted access. Grid technology allows resources that exist in enterprises that are under different administrative control to be securely integrated into a single processing environment The grid community has adopted commercial web services technology as a means for implementing persistent, re-usable grid services that sit on top of the basic distributed processing environment that grids provide. These grid services can then form building blocks for even more complex grid services. Each grid service is characterized using the Web Service Description Language, which provides a description of the interface and how other applications can access it. The emerging Semantic grid work seeks to associates sufficient semantic information with each grid service such that applications wii1 he able to automatically select, compose and if necessary substitute available equivalent services in order to assemble collections of services that are most appropriate for a particular application. Grid technology has been used to provide limited support to various Earth and space science applications. Looking to the future, this emerging grid service technology can provide a cyberinfrastructures for both the Earth and space science communities. Groups within these communities could transform those applications that have community-wide applicability into persistent grid services that are made widely available to their respective communities. In concert with grid-enabled data archives, users could easily create complex workflows that extract desired data from one or more archives and process it though an appropriate set of widely distributed grid services discovered using semantic grid technology. As required, high-end computational resources could be drawn from available grid resource pools. Using grid technology, this confluence of data, services and computational resources could easily be harnessed to transform data from many different sources into a desired product that is delivered to a user's workstation or to a web portal though which it could be accessed by its intended audience.

Hinke, Thomas H.↗

Application of the FUN3D Unstructured-Grid Navier-Stokes Solver to the 4th AIAA Drag Prediction Workshop Cases

FUN3D Navier-Stokes solutions were computed for the 4th AIAA Drag Prediction Workshop grid convergence study, downwash study, and Reynolds number study on a set of node-based mixed-element grids. All of the baseline tetrahedral grids were generated with the VGRID (developmental) advancing-layer and advancing-front grid generation software package following the gridding guidelines developed for the workshop. With maximum grid sizes exceeding 100 million nodes, the grid convergence study was particularly challenging for the node-based unstructured grid generators and flow solvers. At the time of the workshop, the super-fine grid with 105 million nodes and 600 million elements was the largest grid known to have been generated using VGRID. FUN3D Version 11.0 has a completely new pre- and post-processing paradigm that has been incorporated directly into the solver and functions entirely in a parallel, distributed memory environment. This feature allowed for practical pre-processing and solution times on the largest unstructured-grid size requested for the workshop. For the constant-lift grid convergence case, the convergence of total drag is approximately second-order on the finest three grids. The variation in total drag between the finest two grids is only 2 counts. At the finest grid levels, only small variations in wing and tail pressure distributions are seen with grid refinement. Similarly, a small wing side-of-body separation also shows little variation at the finest grid levels. Overall, the FUN3D results compare well with the structured-grid code CFL3D. The FUN3D downwash study and Reynolds number study results compare well with the range of results shown in the workshop presentations.

Lee-Rausch, Elizabeth M.↗

Automated Unstructured Grid Adaptation on a Strut Fuel Injector at Hypervelocity Flow Conditions

Computational fluid dynamics (CFD) analysis is presented with the use of an automated unstructured grid adaptation tool on a strut fuel injector at hypervelocity flow conditions. The analysis was carried out with the VULCAN-CFD solver using Reynolds-averaged simulations (RAS). The hypervelocity flow conditions match the high Mach number flow of the experiments conducted as part of the Enhanced Injection and Mixing Project (EIMP) at the NASA Langley Research Center (LaRC). The current work utilizes an automated grid adaptation tool recently implemented into VULCAN-CFD, and explores this tool’s ability to solve high-speed mixing problems. Simulation results obtained using the unstructured adaptive grid approach are compared to those on a user generated structured grid. These results are evaluated by analyzing how efficiently comparable fidelity results are obtained from both adapted and structured simulations. In addition, two adaptation strategies were used to explore the impact on the final solution. In the current work, the unstructured grid adaptation tool automatically generates unstructured grids and performs adaptation of the grid based on a Hessian error estimate of a specified flow field parameter. Multiple adaptations were executed using each run strategy with the one-dimensional values of the mixing efficiency used to determine grid convergence and for comparison with the structured grid simulation results. It was found that the unstructured adaptive grid simulations were able to produce results that matched closely with those on structured grids using far fewer grid cells, and thus, requiring far less computational time to reach the solution. It was also discovered that the adaptation run strategy influenced the total number of grid cells and the efficiency with which a final grid-adapted solution was reached. Overall, the investigation demonstrated that the automated unstructured grid adaptation tool implemented in VULCAN-CFD is capable of accurately and efficiently solving complex highspeed mixing problems using only a fraction of the grid cells required to obtain comparable results using a user-generated structured grid.

grid adaptation↗

Structured adaptive grid generation using algebraic methods

The accuracy of the numerical algorithm depends not only on the formal order of approximation but also on the distribution of grid points in the computational domain. Grid adaptation is a procedure which allows optimal grid redistribution as the solution progresses. It offers the prospect of accurate flow field simulations without the use of an excessively timely, computationally expensive, grid. Grid adaptive schemes are divided into two basic categories: differential and algebraic. The differential method is based on a variational approach where a function which contains a measure of grid smoothness, orthogonality and volume variation is minimized by using a variational principle. This approach provided a solid mathematical basis for the adaptive method, but the Euler-Lagrange equations must be solved in addition to the original governing equations. On the other hand, the algebraic method requires much less computational effort, but the grid may not be smooth. The algebraic techniques are based on devising an algorithm where the grid movement is governed by estimates of the local error in the numerical solution. This is achieved by requiring the points in the large error regions to attract other points and points in the low error region to repel other points. The development of a fast, efficient, and robust algebraic adaptive algorithm for structured flow simulation applications is presented. This development is accomplished in a three step process. The first step is to define an adaptive weighting mesh (distribution mesh) on the basis of the equidistribution law applied to the flow field solution. The second, and probably the most crucial step, is to redistribute grid points in the computational domain according to the aforementioned weighting mesh. The third and the last step is to reevaluate the flow property by an appropriate search/interpolate scheme at the new grid locations. The adaptive weighting mesh provides the information on the desired concentration of points to the grid redistribution scheme. The evaluation of the weighting mesh is accomplished by utilizing the weight function representing the solution variation and the equidistribution law. The selection of the weight function plays a key role in grid adaptation. A new weight function utilizing a properly weighted boolean sum of various flowfield characteristics is defined. The redistribution scheme is developed utilizing Non-Uniform Rational B-Splines (NURBS) representation. The application of NURBS representation results in a well distributed smooth grid by maintaining the fidelity of the geometry associated with boundary curves. Several algebraic methods are applied to smooth and/or nearly orthogonalize the grid lines. An elliptic solver is utilized to smooth the grid lines if there are grid crossings. Various computational examples of practical interest are presented to demonstrate the success of these methods.

Yang, Jiann-Cherng↗

Enhanced Elliptic Grid Generation

An enhanced method of elliptic grid generation has been invented. Whereas prior methods require user input of certain grid parameters, this method provides for these parameters to be determined automatically. "Elliptic grid generation" signifies generation of generalized curvilinear coordinate grids through solution of elliptic partial differential equations (PDEs). Usually, such grids are fitted to bounding bodies and used in numerical solution of other PDEs like those of fluid flow, heat flow, and electromagnetics. Such a grid is smooth and has continuous first and second derivatives (and possibly also continuous higher-order derivatives), grid lines are appropriately stretched or clustered, and grid lines are orthogonal or nearly so over most of the grid domain. The source terms in the grid-generating PDEs (hereafter called "defining" PDEs) make it possible for the grid to satisfy requirements for clustering and orthogonality properties in the vicinity of specific surfaces in three dimensions or in the vicinity of specific lines in two dimensions. The grid parameters in question are decay parameters that appear in the source terms of the inhomogeneous defining PDEs. The decay parameters are characteristic lengths in exponential- decay factors that express how the influences of the boundaries decrease with distance from the boundaries. These terms govern the rates at which distance between adjacent grid lines change with distance from nearby boundaries. Heretofore, users have arbitrarily specified decay parameters. However, the characteristic lengths are coupled with the strengths of the source terms, such that arbitrary specification could lead to conflicts among parameter values. Moreover, the manual insertion of decay parameters is cumbersome for static grids and infeasible for dynamically changing grids. In the present method, manual insertion and user specification of decay parameters are neither required nor allowed. Instead, the decay parameters are determined automatically as part of the solution of the defining PDEs. Depending on the shape of the boundary segments and the physical nature of the problem to be solved on the grid, the solution of the defining PDEs may provide for rates of decay to vary along and among the boundary segments and may lend itself to interpretation in terms of one or more physical quantities associated with the problem.

Kaul, Upender K.↗