# Overset grids

### From CFD-Wiki

(→Grid generation) |
|||

(5 intermediate revisions not shown) | |||

Line 10: | Line 10: | ||

== Grid generation == | == Grid generation == | ||

- | Grids for an overset simulation are generally simple and structured, and are often generated hyperbolic or marching techniques. (''Add more here'') | + | Grids for an overset simulation are generally simple and structured, and are often generated hyperbolic or marching techniques. The key element is in arbitrary overlap of the computational grids that define and surround the geometry to be simulated. The grids may be structured, unstructured, Cartesian or a combination of these. One intuitive combination occurs when structured-curvilinear grids and Cartesian grids are used. A high quality body-fitting curvilinear grid is built independently for each geometric component and embedded within a coarser Cartesian grid. Because each curvilinear grid is paired with a component from the geometry, overset grids can be used to track relative motion with computational efficiency, but domain connectivity must be performed so that adjacent grids share information. |

+ | |||

+ | (''Add more here'') | ||

== Hole Cutting == | == Hole Cutting == | ||

Line 37: | Line 39: | ||

where <math>dj</math>, <math>dk</math>, and <math>dl</math> are the interpolation weights and are in | where <math>dj</math>, <math>dk</math>, and <math>dl</math> are the interpolation weights and are in | ||

- | the interval <math>[0,1]</math>. For any boundary point <math>\vec{x}_b</math> and any cell base point <math>\vec{x}_1</math> we can solve the interpolation for for the weights. If the cell does not contain <math>\vec{x}_b</math>, then one or more of the weights will not be in the proper range. This can be used to construct a Newton-like gradient search technique. For more details, the reader is referred to the chapter by Meakin (1999) and the references contained therein. In practice, the initial condition for this solution procedure is quite important. It is usually best to perform some spatial partitioning to narrow the search range. | + | the interval <math>[0,1]</math>. For any boundary point <math>\vec{x}_b</math> and any cell base point <math>\vec{x}_1</math> we can solve the interpolation for for the weights. If the cell does not contain <math>\vec{x}_b</math>, then one or more of the weights will not be in the proper range. This can be used to construct a Newton-like gradient search technique. For more details, the reader is referred to the chapter by [[#References|Meakin (1999)]] and the references contained therein. In practice, the initial condition for this solution procedure is quite important. It is usually best to perform some spatial partitioning to narrow the search range. |

== Software == | == Software == | ||

Line 43: | Line 45: | ||

=== Preprocessors === | === Preprocessors === | ||

- | A number of preprocessing packages have been developed, with varying levels of complexity. NASA's PEGASUS [Suhs et al 2002], which is primarily a grid joining code, takes an existing grids and prepares it for use in an overset simulation. The grid is generated separately. Another program is [http://www.na.chalmers.se/~andersp/chalmesh/chalmesh.html Chalmesh] [Petersson 1999], which generates grids and the interpolation data simultaneously. A comprehensive package, called [http://people.nas.nasa.gov/~rogers/cgt/doc/man.html Chimera Grid Tools (CGT)], has been developed (primarily by NASA employees) that is intended cover all aspects of the preprocessing , including grid generation. The CGT package includes many utilities, including PEGASUS, that automate most of the process of going from CAD model to simulation. Of these three packages, only Chalmesh is freely available. Unfortuately, the other two are subject to U.S. goverment export controls, and are thus not generally available (see [http://people.nas.nasa.gov/~rogers/cgt/doc/RESTRICTIONS.html here] for more on this). However, since most of the algorithms and techniques used are described in the literature, it is possible to do this sort of simulation without access to these packages. (''Commercial Packages?'') | + | A number of preprocessing packages have been developed, with varying levels of complexity. NASA's PEGASUS [Suhs et al 2002], which is primarily a grid joining code, takes an existing grids and prepares it for use in an overset simulation. The grid is generated separately. Another program is [http://www.na.chalmers.se/~andersp/chalmesh/chalmesh.html Chalmesh] [[#References|[Petersson (1999)]]], which generates grids and the interpolation data simultaneously. A comprehensive package, called [http://people.nas.nasa.gov/~rogers/cgt/doc/man.html Chimera Grid Tools (CGT)], has been developed (primarily by NASA employees) that is intended cover all aspects of the preprocessing , including grid generation. The CGT package includes many utilities, including PEGASUS [[#References|[Suhs et al (2002)]]], that automate most of the process of going from CAD model to simulation. Of these three packages, only Chalmesh is freely available. Unfortuately, the other two are subject to U.S. goverment export controls, and are thus not generally available (see [http://people.nas.nasa.gov/~rogers/cgt/doc/RESTRICTIONS.html here] for more on this). However, since most of the algorithms and techniques used are described in the literature, it is possible to do this sort of simulation without access to these packages. (''Commercial Packages?'') |

=== Solvers === | === Solvers === | ||

Line 50: | Line 52: | ||

* OVERTURE/OVERBLOWN | * OVERTURE/OVERBLOWN | ||

* CFDSHIP-IOWA | * CFDSHIP-IOWA | ||

+ | * TAU-Code (DLR) | ||

== References == | == References == | ||

- | + | {{reference-paper|author=Meakin, Robert L.|year=1999|title=Composite Overset Structured Grids|rest=Chapter 11, Handbook of Grid Generation, CRC Press}} | |

+ | |||

+ | {{reference-paper|author=Petersson, N. Anders|year=1999|title=Hole-Cutting for Three-Dimensional Overlapping Grids|rest=SIAM Journal on Scientific Computing, Vol. 21, No. 2, pp 646-665}} | ||

+ | |||

+ | {{reference-paper|author = Suhs, Norman E. and Rogers, Stuart E. and Dietz, W. E.|year=2002|title = PEGASUS 5: An Automatic Pre-Processor for Overset-Grid CFD|rest = AIAA Paper 2002-3186, AIAA 32nd Fluid Dynamics Conference, St. Louis}} | ||

== External links == | == External links == |

## Latest revision as of 00:02, 20 April 2013

## Contents |

## Introduction

A common difficulty in simulating complex fluid flow problems is that not every geometry can be well represented using a single, contiguous (structured or unstructured) grid. In many cases, different geometrical features are best represented by different grid types. One approach these difficulties is the construction of a grid system made up of blocks of overlapping structured grids. This technique is referred to as the *Chimera* or *overset* grid approach. In a full Chimera grid system, a complex geometry is decomposed into a system of geometrically simple overlapping grids. Boundary information is
exchanged between these grids via interpolation of the flow variables, and many gridpoints may not be used in the solution (these points are sometimes called *hole points*). Each block has boundary or *fringe points*, which lie in the interior of a neighboring block (or blocks) and will require information from that containing block. The data that must be generated to successfully complete a Chimera-type calculation is not insignificant, and thus has been automated to a high degree. In very general terms, there are three steps to setting up an overset simulation:

- Grid generation
- Hole cutting
- Determination of interpolation weights

Note that in some systems, one or more (or all) of these steps may be combined. Finally, while the Chimera technique is most often associated with traditional finite volume/difference CFD codes, it can in principle be applied with other discretization schemes.

## Grid generation

Grids for an overset simulation are generally simple and structured, and are often generated hyperbolic or marching techniques. The key element is in arbitrary overlap of the computational grids that define and surround the geometry to be simulated. The grids may be structured, unstructured, Cartesian or a combination of these. One intuitive combination occurs when structured-curvilinear grids and Cartesian grids are used. A high quality body-fitting curvilinear grid is built independently for each geometric component and embedded within a coarser Cartesian grid. Because each curvilinear grid is paired with a component from the geometry, overset grids can be used to track relative motion with computational efficiency, but domain connectivity must be performed so that adjacent grids share information.

(Add more here)

## Hole Cutting

*Add example here*

## Chimera interpolation

Many of the tools required to compute the data required to do an overset simulation can be built upon the trilinear interpolation formula. The discussion here assumes hexahedral cells with nodal representation of flow variables available. Given a hexahedral cell formed by eight points (see figure, which needs to be redrawn), the coordinates of any point in the interior of this cell may be written as

(*This equation is really ugly*)

where , , and are the interpolation weights and are in the interval . For any boundary point and any cell base point we can solve the interpolation for for the weights. If the cell does not contain , then one or more of the weights will not be in the proper range. This can be used to construct a Newton-like gradient search technique. For more details, the reader is referred to the chapter by Meakin (1999) and the references contained therein. In practice, the initial condition for this solution procedure is quite important. It is usually best to perform some spatial partitioning to narrow the search range.

## Software

To use the overset approach, one will generally need two software components: a preprocessing program to generate the overset data (cut holes, interpolation weights, etc.) and a compatible flow solver.

### Preprocessors

A number of preprocessing packages have been developed, with varying levels of complexity. NASA's PEGASUS [Suhs et al 2002], which is primarily a grid joining code, takes an existing grids and prepares it for use in an overset simulation. The grid is generated separately. Another program is Chalmesh [Petersson (1999)], which generates grids and the interpolation data simultaneously. A comprehensive package, called Chimera Grid Tools (CGT), has been developed (primarily by NASA employees) that is intended cover all aspects of the preprocessing , including grid generation. The CGT package includes many utilities, including PEGASUS [Suhs et al (2002)], that automate most of the process of going from CAD model to simulation. Of these three packages, only Chalmesh is freely available. Unfortuately, the other two are subject to U.S. goverment export controls, and are thus not generally available (see here for more on this). However, since most of the algorithms and techniques used are described in the literature, it is possible to do this sort of simulation without access to these packages. (*Commercial Packages?*)

### Solvers

- INS2/3D
- OVERFLOW
- OVERTURE/OVERBLOWN
- CFDSHIP-IOWA
- TAU-Code (DLR)

## References

**Meakin, Robert L. (1999)**, "Composite Overset Structured Grids", Chapter 11, Handbook of Grid Generation, CRC Press.

**Petersson, N. Anders (1999)**, "Hole-Cutting for Three-Dimensional Overlapping Grids", SIAM Journal on Scientific Computing, Vol. 21, No. 2, pp 646-665.

**Suhs, Norman E. and Rogers, Stuart E. and Dietz, W. E. (2002)**, "PEGASUS 5: An Automatic Pre-Processor for Overset-Grid CFD", AIAA Paper 2002-3186, AIAA 32nd Fluid Dynamics Conference, St. Louis.