Mesh Refine 内部调整网格

Mesh Quality and conservative projection in Lagrangian compressible hydrodynamic
Mesh Quality and conservative projection in

Lagrangian compressible hydrodynamic
Philippe Hoch
CEA-DAM IDF
email: Philippe.Hoch@cea.fr
Roma, December 2007
OUTLINE
1 A good alternative method to Lagrangian code: non direct ALE

(Arbitrary Lagrangian Eulerian)
ALE (1) : Rezone = Smoothing mesh process
Escobar Optimization process extended to arbitrary connectivity

Control Of Quality: Nodal quality denition & consequences
ALE (2) : Remapping = Conservative interpolation
Approximations of the Exact problem

Maximum principle and second order
2 Cemracs Project 2007: Adding Adaptation between Lagrangian and

ALE
Dynamic polygonal adaptation with "Welding" lines
A strategy

A good alternative method to Lagrangian code: non direct ALE (Arbitrary Lagrangian Eulerian)
Lagrangian step 1
Conservations Laws :
Dt
+ .u = 0,
Dt u + P = 0,
Dt E + .(Pu ) = 0.
mesh is moving with speed ow
density, u speed, E total energy,
(1)
internal energy.
PROS: Pure Lagrangian formulation permits:

1
cell mass conservation.
if multi-materials then it keeps non diused interfaces between each.
CONS: The counter parts, the mesh quality can become very bad
very quickly (non convex quads, tangled mesh ... ). The mesh quality
may become very bad very quickly (non convex quads, tangled mesh ... )

Lagrangian Step 2
Mainly 3 dierent Lagrangian schemes:

1
Staggered (Wilkins type: 1964, and new ones Shashkov and al.)
1
2
3
4
Mixed Q1/P0 (Speed/Thermo).

Internal energy formulation Dt + PDt 1. = 0.
hourglass correction (non physical oscillation of quad. mesh).
Pseudo viscosity (for shocks in speed/pressure).
Centered (Despres/Mazeran 2002 and Maire/Breil 2003)

1
2
All variables are centered (nite volumes type).

Nodal uxes (compatiblity of mesh movement and continuity
equation).
Centered version are very simple to implement... still in

improvement...
We principally use Lagrangian schemes for quadrangular types of meshes,
but VERY interesting for problems involving layers, symetries ..

Gains with non direct ALE (Rezone+Remapping)
Lagrangian Computation of an half ball with external pressure (Initial/nal Time)
ALE Computation without and with special care to non convex cells

Generality on numerical simulations

Lagrange scheme
go far . . . BUT generic diculties :
Interacting shocks can destroy mesh quality.
High curvature of interfaces and boundaries (with fast variations),

especially for rarefaction waves from a solid into a light material
(vaccum).
Consequences
1
problem 1 thermal conduction (if coupling), diusion scheme are

very sensitive wrt mesh.
problem 2 hydrodynamic (time step very small)

Mesh
Smoothing : keep same mesh connectivity
Need
to dene the unkonwn on this new mesh

Rezoning process
Here, we want to use smoothing methods that keep the
same
connectivity of the Lagrangian mesh.
Two main ways:

1
Approximate regularizing PDE problem.
Approximate an optimization problem: min Fi (x )

Mesh
(cost function).
M1
0.4454
0.4
YAxis
0.3
0.2
0.1
0.01336
1.2
1.3
1.4
1.5
1.56
Figure: typical arbitrary mesh : node with 3,4 ou 5 connexion

XAxis
We use an extension of Escobar smoothing (untangled tetrahedral mesh

and smooth), the cost function is dened
everywhere!!
Our modication is in the adaptation to arbitrary connectivity.

Escobar : Detail in a simplex

K2
K3
i
Triangle ideal
(v)
Linear application from Ideal to real space : x
= AW 1 .
xi = Sv
, with
Objectif function associated to the m

fm
|Sm ||m |
BUT
2m
m > 0
eme
simplex fm
. . . modication:
dened on the whole space!
Escobar :
avec
= |S ||S2 1 | , Frobenius Norm: |S | =

= det (S ), ideal := equilateral.
Cell quality: q (S )
= S
2
K4
Triangle de reference
(u)
Triangle espace reel

(x)
local Functionnal :Fi (x )
fm =
tr (t SS ),
= 1/q (S ),
|Sm ||m |
, is
m +
PNbSimplexe
fm .
m=1
2 +
m

Extension by adaptation w.r.t connectivity

For arbitrary meshes, we do not know about the ideal triangle : W ? ..
For each simplex, we will introduce a parameter (W ), and we will adapt
this to the non homogeneous local connectivity arround each node:

W
cos ()
sin()

S
= AW1
S8
S9
S 10
S7
S2
S3
S1
S6
S4
S 11
S5
S 12
Adapatation of the parameter
2
degree(i)
For internal simplices :
For external simplices belonging to the m'th cell:
2
degree(i)(number_of _nodes(m) 2)

ESCOBAR_MULTI_CONNEXION : Analytic test case

Bad initial aspect ratio, Classical Escobar (red,
(blue,
= 0),
and new Escobar (green,
Iter no 1
Iter no 2
iter no 4
iter no 5
= /3),
Escobar ortho
connectivity adaptation) .
iter no 3
iter no 6

ESCOBAR_MULTI_CONNEXION : TEST CASE 1

Untangling of static simplicial mesh.
Mesh
M1
2.0100
1.0100
7.1109
1.8109
1.0100
2.0100

ESCOBAR_MULTI_CONNEXION : TEST CASE 2

Untangling quadr. mesh, 2 iterations
Mesh M1
Mesh
2.0100
M1
1.67
1.0100
1
4.4109
2.1109
1.0100
2.0100
0.5078
0.4578
1.653

After 20 global iterations.
Mesh
M1
2.010
1.0100
0.0100
0.0100
1.0100
2.0100

What to remind
Escobar with adaptation W
Extension of Escobar functionnal with arbitrary connectivity.
Speed to convergence is faster than original Escobar.
Warning : No preservation of aspect ratios.
Remarque
1
Practically (coupling with hydrodynamic), we
convergence.
2
The smoothed mesh need to be
Lagrangian grid.
never go until
as close as possible to the
The optimization algorithms are much more time consuming than

elliptic ones (Tipton/Jun).
We need to control very closely the quality of the ALE mesh...

Control Of Quality: Nodal quality denition,

consequences
v8
K3
K2
v7
v10
v3
v4
K4
v12
v2
v1
v6
K1
v5
Denition
Qi Nodal Quality of i, 3 ex.:
1
2
3
sin =min sin(v )
Qi
(to keep symmetries/and or keep local orthogonality).
min sin(v )
sin,rel =
Qi
max(max sin(v ),| min sin(v )|)
aire ,rel =
min Aire v
Qi
max(max Aire (v ),| min Aire (v )|)
1 Q i 1
' 1: locally optimal
Qi 0 : local degeneracy
(to keep good aspect-ratio).
Properties:
Qi
(non convex cell, tangling, ...)

Deniton of the Quality of a mesh

QM
i
: Nodal Quality for node i in mesh M.
Denition
Q
M
.
.
: Quality of M,
2 choices:
M
M
Q = mini Qi
1 PNv M
M
Q1 =
Nv i Qi
(Nv : Number of vertices)
Qref : global reference quality.

Nb
M (Qref )
: Number of nodes such that
QM
i < Qref .
Q is for the vertex having the lesser nodal quality.
M >= Qmin,
If Q
arrival times).
then stay automatically Lagrangian (good for shocks

Consequence 1: We can compare 2 meshes

If we want to hunt the non convex cells (Qi
et
< 0),
Denition
M1 is better than M2 i:
1
M
If Q1
.
.
.
M
and Q2 > 0
M2 and Nb M1 (Q
Q
M1 >
M1 Q M2 and
M1
M2 and
Q = Q
Q
Q
M
Q1
M
If Q1
.
.
>0
>0
M
and Q2
<0
<0
M
and Q2 < 0
M2 and Nb M1 (Q
Q
M1 >
M1 Q1M2 and
1
Q1
Q1
M
OR
ref ) Nb 2 (Qref ),
M1 (Q ) < Nb M2 (Q ),
OR
ref
ref
M1 (Q ) = Nb M2 (Q ) and Q M1 > Q M2
Nb
ref
ref
1
1
Nb
Nb
M1 (Q
M
ref ) Nb 2 (Qref )
M2 (Q )
)
<
Nb
ref
ref

Consequence 2 : Non-linear nodal mesh Relaxation

Denition
Let M
1 and M 2 (close
enough) with the same connectivity, and QiM
nodal quality function, we dene a third M
i , i th vertex
M1 , Q M2 )
i
w (Qi
of
Mi
3 by :
1
2
= Mi1 + w (QiM , QiM )(Mi2 Mi1 )
is a weight function with values in [0,1].
Exemples
1
M 1 , Q M 2 ) = 1+Q1 iM 2
i
2+QiM +QiM
w (Qi
Heaviside kind process:
M1 , Q M2 ) =
i
w (Qi
0,
1,
M1
( Qi
M1 > Q M2 ,
i
sinon.
si Qi
M 2 6= 1)
and Qi
The last (the bounds
are always reached for every node) is called the
mesh.
"intersected "

Properties
Properties
1
Independent of the numbering, the build is very fast (only positions

diers)
3 is close to M 1 and M 2 .
CONS: No order preservation of the qualities : Qi

M 3 Q M 1 > Q M 2 !!!!
implies Qi
i
i
M1 > Q M2
i
do not
Practically, we need to test the quality of the third mesh (see. Oxford
2005).

Consequence 3 : Nodal Priority order for Mixing between

algorithms
Let a nodal quality mesh function be given, we can dene a priority order
of the nodes.
Exemple:
1
M Q ):
(Qi
then elliptic algorithm with Jacobi update (Titpon or
Jun).
M Q )
(Qi
: then optimization algorithm with Gauss-Seidel update
(Escobar type).
Remarque
1
Speed Gain is between 5 and 10 (wrt to full optimization).
We can conserve symmetries, orthogonality and aspect ratio with

the two rst nodal quality function (sin based).

In practice : How to deal with all this new features

1
Independent of the smoothing algorithm.
Compatibility with any kind of nodal statute (depending on criteria

such as angles, area, etc) denition of degrees of freedom set.
sin
Adaptative (in time) nodal quality function between Qi
with some sensor for symmetries and orthogonality.

4
area
and Qi
Choice of the best mesh among all of global iteration, stop if

satisfactory, if not we use non linear relaxation (sometimes you may
need to remove the proximity of the smoothed mesh).
Candidates for meshes M1 and M2 in the choice of better mesh

are: Lagrangian, Euler, Smoothed, or any intermediate
(Lagrange/Smoothed or Euler/Smoothed) etc ...
In summary, this approach can be viewed as an
over layer with previous

M
versions of ALE smoothing, and at the end, we can check Q ,Q1

M
Nb (Qref ) for both Lagrangian and nal smoothed mesh.
and

Exact problem of Conservative interpolation

Discrete balance
N = KA
N
A
A
N
i
j V (KiA ) Ki Kj / j V (KiA ) Ki Kj
[Margolin,Shashkov]:Ki
KiN
Z
QdV
KiA
QdV
j V (K
A)
i
hR
i
R
Q def
= K N K A QdV K A K N QdV
i
j
i
j
Quantity Fij
Fij
(2)
is the exact ux (but
we have to compute intersection between 2 meshes).
Q = F Q ,
ji
Fij
(3)
First order scheme:
iN = |KiA |Q
iA +
|KiN |Q
Positivity condition :

jA |KiA KjN |Q
iA
|KiN KjA |Q
j V (KiA )
P
|KiA | > j V (K A ) |KiA KjN |,
i
gives a local
maximum principle (wrt Edge and Corner neighborood).
(4)

Approximation 1: No intersection computing

Approximated ux are computed by swept
regions Fik .:
Algebraic
volumes swept by the edges displacement.

n2 (eA)
eA
eN
mg
md
n 2 (e A)

A
e
e N
mg

md

n1 (eA)
n (e )
1
First order Flux Fik : donor cell interpretation

First Order [Margolin,Shashkov]
sda,1 = max (0, V ( F ))Q

A
iA
ik mv (i ,k ) + min(0, V ( Fik ))Q
Fik
Positive scheme:
P
|KiA | > | V (Fik )<0 V ( Fik )|,
principle (wrt Edge neighborood).
gives a local maximum

Approximation 2: self-intersection scheme (more accurate)

Denition
Self-intersection ux, is a ux that eventually compute a self-tangled

patch created by edge displacement : e
A e N = {S }
and S
6= {}
A
n 2

(e

)

A

e

e
N

mg

z

2

s

md

z
1

a
(e
Self-intersection ux
The rst order self intersection ux:
nblmt
X(e )
a e
Q=
sign(m, e , k )V (Zk )Qk
k =1
P
A
|Ki | > | V (Z A )<0 V (Zka )| gives a local maximum
Ge
Positivity:
principle

Specic energie, and speed

Projection
A N
and
(e )A (e )N
and e
N :=
(e )N
.
N
For second order, two approach:

1
Linear representation (e ):
(e )1,h = (e )j + (e )j (x xj )
BUT no maximum principle in e even if true for

2
(5)
AND
e .
Indeed (5) rewrite cf ([W.B. VanderHeyden, B.A. Kashiwa])
(e )1,h = j ej + ej j (x xj ) + j ej (x xj )
e
1,h
= ej +
and then:
j (x xj )
ej
j + j (x xj )
(6)
Non-linear representation of e, Dukowicz/Kodis limitor (maximum

principle).
We do the same with the speed (on the dual mesh if staggered hydro).

Numerical study of the projection for specic energy and speed
We consider 3 options:
I Volumes Fluxing computation (2 options) :
(0) Without self-intersection.

(1) With self-intersection.
II The gradient are computed by Green formula and the limitation is
based on a maximum principle (Dukowicz-Kodis).
1
The limitation for specic quantities : sj (projection of sj )

(0) Non linear limitation (rst and on sj )
(1) Linear limitation (on sj )
and the speed
(-1) First Order
(0) Non linear limitation (idem specic quantity)
(1) Linear limitation (idem specic quantity)

Initial Data
Initial conditions (density/temperature) and speed:
r
=0.001
=0
0.4
1./3.
=1
=1
4./15.
u=0
v=0
0.4
1./3.
=0.125
=0
u=3
v=4
4./15.
0.2
0.2
0.2
0.3
0.4
0.2
Densite ini
0.3
0.4
Norme vitesse ini
0.9
4.5
0.9
4
4
0.8
0.7
0.6
0.7
0.5
0.6
0.4
0.3
0.5
0.2
0.4
0.1
3
2
1.5
0.5
xi
xi
0.1
0
1
0.2
2.5
0.3
0.001
0
3.5
ZAxis
ZAxis
0.8

Inuence on specic quantity : I

Test Case : Advection (diagonale direction (.005,0.005))
Recall : density min/max initial :0.001/1, temperature min/max initial : 0/1.
nx
50
50
Flux
0/1
0/1
Limit. maille
0
1
density min/max
0.001/0.953157874
0.001/0.953157874
Temperature min/max
0/0.999775443
0/1.023732158
Non respect of global maximum principle on temperature for linear limiteur.

Temperature finale, ap flux 1, limit maille 0, limit noeud 0

0.769
0.7643
0.9
0.7
0.7
0.9
0.8
0.8
0.7
0.6
0.6
0.7
0.5
0.5
0.4
YAxis
YAxis
0.6
0.6
0.5
0.5
0.4
0.3
0.4
0.4
0.3
0.2
0.2
0.1
0.3
0.1
0.3
0.2214
0.2048
0.3
0.4
0.5
XAxis
0.6
0.7
0.2167
0.2167
0.3
0.4
0.5
XAxis
0.6
0.7
0.781

Inuence on specic quantities : II

Test Case : Random Cyclique Rezoning
Recall : density min/max initial : 0.001/1, temperature min/max initial : 0/1.
nx
50
50
50
50
Flux
1
1
0
0
Limit. cell
0
1
0
1
density min/max
0.001/0.999994937
0.001/0.999994937
0.000999984/0.999997086
0.000999984/0.999997086
Temperature min/max
0/0.999999724
0/1.000276494
-0.000008013/0.999999854
-0.000015653/1.000144011
Non respect of global maximum principle on density and temperature if no

self-intersection.
ature finale, ap flux 1, limit maille 0, limit noeud 1
1
0.9
0.8
0.8
0.7
0.7
0.6
0.6
0.5
0.4
YAxis
0.9
0.5
0.4
0.3
0.3
0.2
0.2
0.1
0.1

Inuence on speeds: cyclique Rezonning

Recall : Norm of the speed min/max initial : 0/5
nx
50
50
50
50
50
50
Flux
1
1
1
0
0
0
Node Limit
-1
0
1
-1
0
1
norm vit min/max

0/4.976664317
0/4.999652095
0/5.705191088
0/4.977538773
0/4.999712297
0/5.704911304
e vit. finale, ap flux 1, limit maille 0, limit noeud 1 Norme vit. finale, ap flux 1, limit maille 0, limit noeud 0 Norme vit. finale, ap flux 1, limit maille 0, limit noe
4.5
4.5
4
4
3.5
2.5
2
2
1.5
ZAxis
0.5
YA
Z
xis
XAxis
4.8
3.5
4.2
4
2.5
2
3.6
2.4
1.5
1
00
5.4
5.705
ZAxis
4.977
1
00
0.5
YA
xis
XAxis
1.8
1
1.2
00
0.6
YA
xis
XAxis

Conclusion on projection
The projection with the following options gives the best results:
1
self-intersection
Linear limitation on
primal and non-linear on specic quantities (e
dual and non-linear on speed.
...)
3
Linear limitation on

Cemracs Project 2007: Adding Adaptation between Lagrangian and ALE
Cemracs project : Improving ALE results ....

Collaboration : Sandrine Marchal (Institut Elie-Cartan Nancy), Yana
Vasilenko (University of West Bohemia in Pilsen), Amir Ali Feiz (
Universit de Marne La Valle Champs sur Marne).
t=0
t=2
t=1
P1
v=0
Evolution
purement
Lagrangienne
P2
Evolution avec
adaptation non conforme
apres phase Lagrangienne
In some situations, we need to clear and/or add some elements.... the

smoothing process is quiet robust, and we do so that we want this step
to be as few as possible (in time and space).

Project (cont)
We want to essentially keep quadrangles after this process (because

of layers and symmetries), but we can admit some triangles.
We have an ALE code : Lagrangian + Rezone + Remapping
order), with swapping adaptation if triangles.
At the end, we want to obtain such a general scheme:

1
Lagrangian step,
renement/unranement study and
Rezone and Remapping.
Adaptation,
(rst

Dynamic polygonal adaptation with "Welding" lines
Adding dynamically simplied non conformal cells

The aim is to study a non-conformal strategy with welding line (a line
with End Point called Masters Nodes and arbitrary number of Slaves
Nodes distributed on it) see Fig.
Welding Line
welding line
This straight line will take place of edges for which the aspect ratio is
under some tol.
A way to obtain a conservative step, is the computation of the
intersection between this line and some (very few) elements.

A strategy
Strategy
(1)
Lagrange Step:
A Centered Lagrangian scheme is used to march in
time with ALL the nodes considered as degree of freedom (meaning

that slaves nodes of a welding line are moved without any
constrained to slip along the two master end points).
Convex
OR
non convex

A strategy
Strategy (Cont)
(2)
Adaptation Step:
(a) See Previous Fig. Orthogonal projection of slaves nodes on the line
dened by master endpoints in the case of non convex cells around
any of slaves (or we can do it each times). Computation of new
conservative quantities over the new moved cells by self intersection
ux (=exact problem).
(b) Renement study with some criteria (geometrical/physic), see details
after. Computation of new conservative quantities is straigthforward
for rst order scheme. To obtain convex sub-cells there are 3 ways:
Figure: Isotropic
1D
Quasi 1D
(c) Unrenement study with some criteria (geometrical/physic), see
details ... Computation of new conservative quantities is done by
clipping (or self intersection...).

A strategy
Strategy (Cont)
(3)
ALE Step:
(a) Slaves nodes are moved after the movement of Masters endpoints.
Smoothing
(b) Self intersection (or clipping) is used.

A strategy
Renement strategies I: dynamical renement by Layer
0.2528
0.2528
0.2
0.2
0.1
0.1
0
6.41017
1.0101
2.0101
0
6.41017
1.0101
2.0101

A strategy
Renement strategies II: dynamical renement Quasi 1D
0.2742
0.2742
0.2
0.2
0.1
0.1
0
6.01017
1.0101
2.0101
2.7101
0
6.01017
1.0101
2.0101
2.7101

A strategy
Renement strategies III: dynamical renement isotropic

(AMR like)
0.2822
0.2822
0.2
0.2
0.1
0.1
0
5.81017
1.0101
2.0101
2.8101
0
5.81017
1.0101
2.0101
2.8101

A strategy
Renement strategies IV: mixted renement

PLOT
PLOT
YAxis

A strategy
Cont. ZOOM of each Renement Situation

PLOT
PLOT
1.708
YAxis
YAxis
0
0
0
1.101
1.2
1.3
XAxis
1.4
1.5
1.6
1.7
XAxis
PLOT
PLOT
1.595
1.6
1.5
1.4
YAxis
YAxis
1
1.3
1.2
1.1
0.9
1
1.1
1.2
1.3
1.4
XAxis
1.5
1.6
1.7
1.8
0
1.019
1.1
1.2
1.3
XAxis
1.4
1.5
1.6

A strategy
Prospects
(0) Strategy more or less generic wrt Lagrangian hydro (at least
centered scheme of Despres/Mazeran and Ph Maire/Breil).
(1) For renement, the AMR-ALE is recover as a special case among the
3 generic cases that we propose here (genericity for any convex
polygonal cells).
(2) Test and implement a simplied computation of a generic building of
welding line for unrenement step.
(3) Improving tests for adaptation... Help us for good error estimators
(anisotropic) !!

Mesh Refine 内部调整网格

Uploaded by

Document Information

Original Description:

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Mesh Refine 内部调整网格

Uploaded by

Copyright:

Available Formats

Mesh Quality and conservative projection in Lagrangian compressible hydrodynamic

Mesh Quality and conservative projection in

Roma, December 2007

Mesh Quality and conservative projection in Lagrangian compressible hydrodynamic

1 A good alternative method to Lagrangian code: non direct ALE

Escobar Optimization process extended to arbitrary connectivity

ALE (2) : Remapping = Conservative interpolation

Approximations of the Exact problem

2 Cemracs Project 2007: Adding Adaptation between Lagrangian and

Mesh Quality and conservative projection in Lagrangian compressible hydrodynamic

mesh is moving with speed ow

density, u speed, E total energy,

PROS: Pure Lagrangian formulation permits:

cell mass conservation.

if multi-materials then it keeps non diused interfaces between each.

Mesh Quality and conservative projection in Lagrangian compressible hydrodynamic

Mainly 3 dierent Lagrangian schemes:

Mixed Q1/P0 (Speed/Thermo).

Centered (Despres/Mazeran 2002 and Maire/Breil 2003)

All variables are centered (nite volumes type).

Centered version are very simple to implement... still in

Mesh Quality and conservative projection in Lagrangian compressible hydrodynamic

Gains with non direct ALE (Rezone+Remapping)

Lagrangian Computation of an half ball with external pressure (Initial/nal Time)

Mesh Quality and conservative projection in Lagrangian compressible hydrodynamic

Generality on numerical simulations

go far . . . BUT generic diculties :

Interacting shocks can destroy mesh quality.

High curvature of interfaces and boundaries (with fast variations),

problem 1 thermal conduction (if coupling), diusion scheme are

problem 2 hydrodynamic (time step very small)

Smoothing : keep same mesh connectivity

to dene the unkonwn on this new mesh

Mesh Quality and conservative projection in Lagrangian compressible hydrodynamic

connectivity of the Lagrangian mesh.

Two main ways:

Approximate regularizing PDE problem.

Approximate an optimization problem: min Fi (x )

Figure: typical arbitrary mesh : node with 3,4 ou 5 connexion

We use an extension of Escobar smoothing (untangled tetrahedral mesh

Our modication is in the adaptation to arbitrary connectivity.

Mesh Quality and conservative projection in Lagrangian compressible hydrodynamic

Escobar : Detail in a simplex

Linear application from Ideal to real space : x

Objectif function associated to the m

dened on the whole space!

= |S ||S2 1 | , Frobenius Norm: |S | =

Triangle espace reel

local Functionnal :Fi (x )

Mesh Quality and conservative projection in Lagrangian compressible hydrodynamic

Extension by adaptation w.r.t connectivity

Adapatation of the parameter

For internal simplices :

For external simplices belonging to the m'th cell:

Mesh Quality and conservative projection in Lagrangian compressible hydrodynamic

ESCOBAR_MULTI_CONNEXION : Analytic test case

and new Escobar (green,

Mesh Quality and conservative projection in Lagrangian compressible hydrodynamic

ESCOBAR_MULTI_CONNEXION : TEST CASE 1

Mesh Quality and conservative projection in Lagrangian compressible hydrodynamic

ESCOBAR_MULTI_CONNEXION : TEST CASE 2

Mesh Quality and conservative projection in Lagrangian compressible hydrodynamic

After 20 global iterations.

mesh is moving with speed ow

if multi-materials then it keeps non diused interfaces between each.

Mainly 3 dierent Lagrangian schemes:

All variables are centered (nite volumes type).

Lagrangian Computation of an half ball with external pressure (Initial/nal Time)

go far . . . BUT generic diculties :

problem 1 thermal conduction (if coupling), diusion scheme are

to dene the unkonwn on this new mesh

Our modication is in the adaptation to arbitrary connectivity.

dened on the whole space!

Control Of Quality: Nodal quality denition,

Deniton of the Quality of a mesh

nodal quality function, we dene a third M

Choice of the best mesh among all of global iteration, stop if

Candidates for meshes M1 and M2 in the choice of better mesh

is the exact ux (but

Self-intersection ux, is a ux that eventually compute a self-tangled