EN FR
EN FR


Section: New Results

Hierarchical grids: applications with quadtrees/octrees

A first application with a specific method is the resolution of the incompressible Navier-Stokes equations. A Navier-Stokes solver dealing with quadtrees has been implemented in parallel this year. The overall aim will be to model in 3D the flow over a wind turbine using an Octree grid. On the figure 18 can be seen an example of QuadTree mesh. A Finite Volume Semi-Lagrangian scheme is used.

Figure 18.
IMG/octree_cmesh.png IMG/Norms_vortex_u.png
(a) Example of QuadTree mesh for circular cylinder (b) Norms as a function of number of points on grid

First, the order of convergence of the Laplacian Solver discretization on QuadTrees has been computed and compared with those obtained with other schemes as explained previously. The method for solving the Laplacian Solver is named Diamond method and consists in using a dual mesh and considering that the Gradients are constants inside. The order of convergence of 2 has been obtained. The order of convergence of the overall Navier-Stokes resolution on QuadTree meshes has been computed and the order of 2 is get as can be seen on figures 18. For the L norm, the order of 2 can't be reach caused by the loss of accuracy when a gap in refinement level occurs.

For now the grid is fixed, so the next step will be to refine and coarsen the grid following the position of the obstacle and the "interesting" areas. The work will then go on with the implementation of this Navier-Stokes solver with adaptive QuadTree meshes in 3D.

A second application is phase changing material. We consider problems governed by linear elliptic equations with discontinuity interfaces across the domain. The equation coefficients, the solution and its normal derivative can undergo a jump across these internal boundaries. We present a compact second-order finite-difference scheme on a tree-based adaptive grid that can be efficiently solved in parallel. The main idea is to optimize the truncation error of the discretization as a function of the local grid configuration.

The variable coefficient heat diffusion problem we consider is modeled by:

- div ( κ ( x ) u ( x ) ) = g ( x ) , in D , (2)
R ( κ n u ( x ) ) S = [ u ] , on γ (3)
[ κ ( x ) n u ( x ) ] = 0 , on γ (4)

Where x=(x,y,z) are the spatial coordinates and κ(x) is piecewise continuous on each subdomain but it may be discontinuous across γ (the boundary of the D subdomain that contains the discontinuities through). A cell-centered investigation often leads to a symmetric linear system, since the relation between two neighbors is reflective. Considering the configuration in Fig. 19 it is natural to define the discretization at c4 in terms of the others.

Figure 19. A test configuration centerd in c4.
IMG/testConf.png

Let h be the side length of the cell c4. To obtain the existence of a linear consistent scheme we must be able to find the coefficients ai such that:

u x x + u y y = a 1 u 1 + a 2 u 2 + a 3 u 3 + a 4 u 4 + a 5 u 5 + a 6 u 6 + a 7 u 7 + O ( h )

A complete Taylor's analysis on all the involved neighbors, applying them relative linear combinations of the expansions, implies that the coefficients ai must satisfy the following linear system:

1 1 1 1 1 1 1 0 - h 0 - h 3 h 2 - h 2 3 h 2 0 h h 0 h 2 - 3 h 2 - 3 h 2 0 h 2 2 0 h 2 2 9 h 2 8 h 2 8 9 h 2 8 0 - h 2 0 0 3 h 2 4 3 h 2 4 - 9 h 2 4 0 h 2 2 h 2 2 0 h 2 8 9 h 2 8 9 h 2 8 a 4 a 1 a 2 a 3 a 5 a 6 a 7 = 0 0 0 1 0 1

In the example above there are seven concerned points, so, we can determine infinite solutions of the complete system but we search a unique one. Let M be the constraints matrix, a the weights vector, f the right hand side vector for consistency and F(a) a weights function. The problem to minimize has the Lagrangian form:

= F ( a ) - λ ( M a - f ) (5)

We write the minimization problem (5) in matrix form like:

A x = b F ( a ) a - M T λ = 0 M a = f

This choice allows us to implement a scheme always consistent case by case.

Following a consistence proof several tests have been produced to strenghten our method like penalization and different kinds of model until a modeling of the problem (7.7) step by step. We built a new cell centered finite difference method able to:

  • be consistent and locally convergent to second order on balanced grids;

  • simplify and promote an AMR approach along discontinuity;

  • solve the coupled problems (2)-(3) and (2)-(4);

  • a first consistent result on the complete model (2)-(3)-(4).

The finite different method presented here has been compared with two other methods finite volume scheme (Fig. 20). The first one has been implemented by Marco Cisternino and the diamonds one by Claire Taymans (see previous sections). All the three methods stick on the same grid and they use PABLO's data structure with its parallel balance.

Figure 20. Comparison between several numerical approaches.
IMG/norm2comparison.jpg IMG/normInfComparison.jpg
(a) L2 norm comparison (b) L norm comparison