Grid generation and adaptive refinement


Published on

Summer Academy 2008, Numerical Methods in Engineering, Herceg Novi, Montenegro

Published in: Technology
1 Like
  • Be the first to comment

No Downloads
Total views
On SlideShare
From Embeds
Number of Embeds
Embeds 0
No embeds

No notes for slide

Grid generation and adaptive refinement

  1. 1. Talk 2.08 Grid generation and adaptive refinementWednesday, 09/03/2008Summer Academy 2008Numerical Methods in Engineering Goran Rakić, studentHerceg Novi, Montenegro Faculty of Mathematics, Belgrade
  2. 2. ● The solution of PDE can be simplified by a well-constructed grid. ● Grid which is not well suited to the problem can lead to instability or lack of convergence
  3. 3. Logical and physical domain
  4. 4. Requirements for transformation● Jacobian of the transformation should be non-zero to preserve properties of hosted equations (one to one mapping) where Jacobian matrix is:● Smooth, orthogonal grids (or grids without small angles) usually result in the smallest error.
  5. 5. Additional requirements● Grid spacing in physical domain should correlate with expected numerical error
  6. 6. Continuum and discrete grids● Evaluating continumm boundary conforming transformation in discrete points of logical space gives discrete grid in physical space
  7. 7. Quick overview● Structured grids● Unstructured grids● Special grids (multiblock, adaptive,...)
  8. 8. Algebraic methods● Known functions are used in one, two, or three dimensions for transformation● Interpolation between pair of boundaries● If boundaries are given as data points, approximation must be used to fit function to data points first.
  9. 9. Bilinear maps● Combining normalization and translation for transforming any quadralateral physical domain to rectangle to create bilinear maps● One dimension:
  10. 10. Bilinear maps in two dimensions● Two dimensions (vector form):
  11. 11. Special coordinate systems● Polar, Spherical and Cylindrical● Parabolic Cylinder coordinates● Elliptic Cylinder coordinates● ...● And not to forgot, Cartesian grids ...where we all start from
  12. 12. Transfinite interpolation (TFI)● Rapid computation (compare to PDE methods)● Easy to control point locations● Using Lagrange polynomials for blending: ξ, ξ-1, η, η-1
  13. 13. Boundary parametrization... done
  14. 14. Lets fix ξ and let η go from 0..1:Now add ξ direction: Left boundaryHmm, something is wrong when moving both ξ and η: ξ = 1, right boundary
  15. 15. Ta da!
  16. 16. TFI examples (1/2)
  17. 17. TFI examples (2/2)10 1
  18. 18. Topology of a hole● Transformation preserves holes● But with little magic...
  19. 19. PDE methods for grid generation● Algebraic methods (affine trans., bilinear, TFI) defining a grid geometrically● PDE methods defining requirements for grid mathematically
  20. 20. PDE methods for grid generation● We have to construct system of PDEs whose solutions are boundary conforming grid coordinate lines with specified line spacing● Solving the system gives grid● For large grids the computing time is considerable
  21. 21. Thompsons Elliptic PDE grid● ξ = F(x,y) and η = G(x,y) are unknowns in Poisson eq with condition so x,y boundaries are mapped to boundaries of computational domain where P and Q defines grid point spacing● Then instead solving ξ and η we change independent and dependent variables
  22. 22. Thompsons Elliptic PDE grid● The system is solved on uniform grid in computational domain which gives coordinate lines in physical domain
  23. 23. Example copied from the book
  24. 24. Example copied from the book Boundary:
  25. 25. PDE methods for grid generation● Hyperbolic – when wall boundaries are well defined, but far field boundary is left● Can be used to smooth out metric discontinuities in the TFI
  26. 26. This slide is intentionally left blank.
  27. 27. Unstructured grids● Field is in rapid expansion● Faster to generate on complex domains● Easy local refinement● Complex data structure (link matrix or else)● Can be generated more automatically even on complex domains, compared to structured grids
  28. 28. Delaunay triangulation● Simple criteria to connect points to form conforming, non intersecting unstructured grid
  29. 29. Delaunay triangulation algorithm● Nice incremental algorithm● Introduce new point, locally break triangulation and then retriangulate affected part● Flipping algorithm:
  30. 30. Point generation?
  31. 31. Advancing front generation● Construct a grid from boundary informations● Connect boundary points to create edges (called “front”)● Select any edge in front and create its perpendicular bisector. On a bisector pick a point at the distance d inside the domain● In that point, create a circle of radius r, order any points inside circle by distance from center and for each create triangles with edge vertices● Pick up the first triangle that is not intersecting edges, and update front (connect, remove edges)
  32. 32. Overlapping (Chimera-) grids● Built using partially overlapping blocks● Boundary conditions are exchanged between domains using interpolation● Can combine structured and unstructured sub-grids
  33. 33. Adaptive grid refinement● We want to reduce error without unnecessary computational costs● Regions of rapid variations of solution needs better resolution● Using AGR we can discretize huge domains (astrophysics) and/or domains with non-uniform variations across regions of interest● Save both memory and CPU time● Trivial to implement for unstructured grids
  34. 34. Moving grids● Solution adaptive methods for time-depended PDEs where regions of “rapid variations” moves in time (like Burgers flow equation)● Let grid points move with “whatever fronts are present” keeping number of grid points constant
  35. 35. Moving grids math● Transform PDEs to include time changing grid transformation● When discretized, time depending grid points are also unknowns so one has to find both so more equations must be added.
  36. 36. Moving grids math (cont.)● New equations should connect grid points changing position with equidistribution principle of error in computed PDE solution● Having an error-monitor function we want it to be equal over average on all grid sections● They also must prevent rapid grid movement
  37. 37. Moving grid example without any real number-crunching shown
  38. 38. Cheating the “Summary” question● No method that fits all● In structured domains, algebraic methods are preferred for speed and simplicity● Usually implemented in multi disciplinary software packages that goes with CAD interface, surface editing and visualization tools● Multi-block