Grid Generation Flashcards

1
Q

Explain the Finite Difference Method

A
  • Approximates the differential terms of a governing equation with finite difference equivalents. These finite differences are applied to discrete points in the domain.
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

What is the process of representation of the domain by a series of discrete points called?

A

Grid Generation.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

What two factors influence the accuracy of approximation in the Finite Difference Method?

A
  • the number of points (the distance between the points)
  • choice of finite difference representation or scheme also influences the approximation error (order of approximation).
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

What are the 3 methods of discretization of the first derivative?

A

Method 1: Heuristic
Method 2: Comparison of Polynomials
Method 3: Combination of Taylor Series

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

Define Mesh Generation (FVM and FEM)
What about the special case of finite element based control volumes?

A
  • The discretization of the domain in nodes where solutions is to be obtained.
  • In FEM: the nodes are connected to form elements.
  • In FVM: the nodes are centroids of control volumes.
  • In CFX, it is a finite element based control volumes. control volumes are formed from an initial discretization with elements.
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

What are the three main types of grids? Explain each of them.

A
  1. Orthogonal (cartesian) grids AKA structured
    - simplest to program
    - very limited use
    - codes that use this grid: Cart3D - NASA, AMR
  2. Non-orthogonal (boundary fitted) grids
    - When grid lines are aligned with the flow, numerical diffusion caused by UDS is minimized.
    - structured grids are harder to generate when the geometry is not very regular, but they are usually suited best for flow calcs with high Re.
  3. Unstructured grids:
    - has larger artificial diffusion than a structured mesh
    - it is typically less efficient to solve
    - HOWEVER, the time it takes to prepare an adequate grid is much less.
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

What is the purpose of using mesh inflation?

A
  • It is a resource that permits some alignment with the flow in an unstructured grid.
  • the grid surfaces parallel to the wall will tend to be aligned with the boundary layer of the flow.
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

How to check the quality of an unstructured grid?

A

After generating a grid, verify the quality of your grid discretization in CFX-Post and calling the Mesh Calculator panel.
- The Mesh Calculator evaluates several grid quality parameters (edge length ratio, max face angle, min face angle, element volume ratio, connectivity number) and creating a corresponding variable that can be plotted in order to identify problem regions which may require re-meshing.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

What are some qualities to look at with meshing?

A
  1. Aspect Ratio (longest side)/(shortest side), ideally <10
  2. Max/Min face angle: as close to 90 degrees as possible (or 60 degrees).
  3. Element Volume Ratio: size ration of one CV to the next. (ideally: 1.1 - 1.5)
  4. Skewness: as small as possible (<0.8)
  5. Orthogonal Quality: as close to 1 as possible (>0.2).
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

Explain Mesh Refinement

A
  • Truncation error in the domain discretization is proportional to the grid spacing.
  • It is possible to increase the accuracy of a solution by reducing the grid spacing.
  • This can be accomplished in a global sense by setting the maximum edge to a smaller value.
  • Often, the error is only larger in smaller regions, where there is steep gradients of the dependent variables (velocity gradient).
  • An overall refinement would require a lot of computational power and would mean that large regions of the domain, with solutions not changing rapidly, are being “overly” accurately solved.
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

What does an ideal mesh provided (in terms of truncation error)

A

An ideal mesh provides evenly distributed truncation errors.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

What is local mesh refinement?

A
  • Used when only part of the total flow domain requires a finer mesh.
  • If a uniform discretization scheme were used, regions of slow changes in the dependent variables would be wastefully refined, increasing unnecessarily the memory and computing time requirements.
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

Structured grids and local refinement

A
  • Harder to implement local refinement in structured grids BECAUSE there are implicit connectivities required by the grid structure.
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

Unstructured grids and local refinement

A

Unstructured grid generators lead themselves to natural local refinement by the simple addition of nodes in the refinement region:
1. define which regions are to be locally refined
2. set an expansion factor or growth rate so that the element edge can gradually grow to meet the size of the larger length scale.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

What happens if the Expansion Factor is too large? (>1.3)

A

The second order convergence of CDS type of discretization schemes will be lost.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

What happens if the Expansion Factor is too small?

A

The expansion will take up too much space and be carried deeper into the domain than necessary, thereby wasting computational resources.

15
Q

What expansion rate value is ideal?

A

Between 1.0 and 1.3.

16
Q

What are hex-dominant meshes?

A

They are hybrid meshes with unstructured meshes close to the complex geometries, then transitioning into regions of structured mesh away from the complex geometry.

17
Q

What is adaptive Meshing?

A

It is the automatic refinement of the grid based on preliminary solutions, which indicate the code where the regions of higher truncation error are.

18
Q

Explain the steps of Adaptive Meshing

A
  1. Calculation of a preliminary solution on a coarse grid.
  2. Calculation of error estimates (adaption criteria) throughout the domain and identification of regions with higher error than a certain threshold.
  3. Remeshing with addition of the appropriate number of nodes in the selected regions, according to the level of error estimator (error indicator).
  4. Interpolation of solution from coarser grid onto the refinement grid to serve as initial condition.
  5. New calculation of the solution with the refined grid.
  6. Repeat from step 2 until overall error estimates satisfy convergence criteria.