• Aucun résultat trouvé

A CeVeFE DDFV scheme for discontinuous anisotropic permeability tensors

N/A
N/A
Protected

Academic year: 2021

Partager "A CeVeFE DDFV scheme for discontinuous anisotropic permeability tensors"

Copied!
9
0
0

Texte intégral

(1)

HAL Id: hal-00580540

https://hal.archives-ouvertes.fr/hal-00580540

Submitted on 28 Mar 2011

HAL is a multi-disciplinary open access

archive for the deposit and dissemination of

sci-entific research documents, whether they are

pub-lished or not. The documents may come from

teaching and research institutions in France or

abroad, or from public or private research centers.

L’archive ouverte pluridisciplinaire HAL, est

destinée au dépôt et à la diffusion de documents

scientifiques de niveau recherche, publiés ou non,

émanant des établissements d’enseignement et de

recherche français ou étrangers, des laboratoires

publics ou privés.

A CeVeFE DDFV scheme for discontinuous anisotropic

permeability tensors

Yves Coudière, Florence Hubert, Gianmarco Manzini

To cite this version:

Yves Coudière, Florence Hubert, Gianmarco Manzini. A CeVeFE DDFV scheme for discontinuous

anisotropic permeability tensors. Finite Volume for Complex Applications VI, Jun 2011, Praha,

Czech Republic. pp.283–292. �hal-00580540�

(2)

anisotropic permeability tensors

Yves Coudi`ere, Florence Hubert and Gianmarco Manzini

Abstract In this work we derive a formulation for discontinuous diffusion tensor for the Discrete Duality Finite Volume (DDFV) framework that is exact for affine solutions. In fact, DDFV methods can naturally handle anisotropic or non-linear problems on general distorded meshes. Nonetheless, a special treatment is required when the diffusion tensor is discontinuous across an internal interfaces shared by two control volumes of the mesh. In such a case, two different gradients are consid-ered in the two subdiamonds centconsid-ered at that interface and the flux conservation is imposed through an auxiliary variable at the interface.

Key words: Finite volume schemes, Darcy flow MSC2010: 65N08, 76S05

1 Introduction

In this proceeding we propose a Discrete Duality Finite Volume (DDFV) method that can handle discontinuous permeability coefficients. This method is a variant of the DDFV formulation proposed by Y. Coudi`ere and F. Hubert in [6] to ex-tend to three-dimensional (3D) problems the original two-dimensional finite volume schemes by F. Hermeline [11] and K. Domelevo and P. Omn`es [9]. In the DDFV ap-proach the diffusive flux is approximated using a piecewise constant approximation of the solution gradient over a set of edge-based cells called diamond cells. In the

Yves Coudi`ere

Laboratoire Jean Leray, Nantes, FRANCE, e-mail: [email protected] Florence Hubert

LATP, Universit´e de Provence, Marseille, FRANCE, e-mail: [email protected] Gianmarco Manzini

IMATI and CESNA-IUSS, Pavia, ITALY, e-mail: [email protected]

(3)

2 Yves Coudi`ere, Florence Hubert and Gianmarco Manzini two dimensional formulation, the gradient is approximated by a formula that re-quires the vertex values of the scalar solution. Following the DDFV approach, such vertex values are the solution of another finite volume method whose control vol-umes are built around the vertices. Therefore, the resulting scheme combines two distinct finite volume methods for the cell unknowns and the vertex unknowns on two overlapping meshes. Effectiveness and efficiency of such coupled finite volume formulation are documented in [5, 10].

Several generalizations of the two-dimensional DDFV formulation have been proposed in the literature; it is worth mentioning the works by F. Hermeline in [12], C. Pierre in [13, 8], and B. Andreianov and collaborators in [3, 4, 2, 1]. Here, we consider the alternative construction proposed in [6], which uses two families of additional unknowns. In the first family, the unknowns are located at the vertices of the mesh and are the solution of a finite volume method whose control volumes are built around the vertices. In the second family, the unknowns are located at the cen-ters of mesh edges and faces and are the solution of a finite volume method whose control volumes are built around such geometric objects. Therefore, the resulting scheme couples three distinct finite volume methods through a 3D gradient formula that generalizes the 2D one on a set of special cells, the so called diamond cells, built around edges and faces as will be discussed in the next sub-section.

The outline of the paper is as follows. In Section 2 we present a short review of the DDFV method. In Section 3 we present the numerical treatment that we propose for the case of discontinuous permeabilities. In Section 4 we offer final remarks and conclusions.

2 The Discrete Duality Finite volume formulation

Meshes

Given a general finite volume mesh M of the computational domainΩ , composed of polyhedra, three additional polyhedral partitions ofΩ are built, denoted by N , F E and D, hereafter described.

We denote the control volumes of the initial mesh M by Kor L. The set∂ M gathers the boundary faces, which we consider as degenerated control volumes, and we complete the initial mesh as M= M ∪ ∂ M . We associate a set of points xK∈K

with the control volumes in M ; specifically, in the current applications we use the arithmetic average of the vertex position vectors for each polyhedral cell. We denote the vertices, the edges, and the faces of mesh M by xA,EandF, respectively, and we define some additional points: the center of gravity xF of each faceF and the midpoint xEof each edgeE. These points are ordered following the relation

(4)

The 3D gradient formula that we will introduce in the next subsection provides a piecewise constant approximation of the solution gradient on the mesh D , which is the set of diamond cellsD. To each one of the pairs “(edge, face)”(E,F) related

by xE ≺ xFthere corresponds a different diamond cellDthat we define as follows. CellDis the convex polyhedra with vertices xA,xB,xE,xF,xK,xL, where xA and xB denote the endpoints ofE,KandLthe two cells sharing the common faceF. Specif-ically, it holds thatD= hull(xA,xF,xB,xK) ∪ hull(xA,xF,xB,xL). We associate with each diamond cellDthe point xD=1

2(xE+ xF) ∈D.

We partition each diamond cell into eight tetrahedra sharing xDas common vertex and having the remaining three vertices chosen within the pairs(xA,xB), (xE,xF) and (xK,xL), respectively. Formally, we denote the eight possible combinations by

D= hull  xD,xA xB  ,xE xF  ,xK xL  , with xA xB  ≺ xE≺ xF≺xK xL  .

We assume the six vertices xK,xL, xA,xB and xE,xF of the diamond cellD(E,F) to

be ordered in such a way that∆EF:= det(xB− xA,xF− xE,xL− xK) > 0. Thus, the measure ofDis|D| =16∆EF.

We denote the control volume associated with a vertex xA of the mesh by A. This control volume is built by gathering the contributions (i.e., sub-tetraedra) of the diamond cells that share vertex xAas:

A= ∪ D∈DA hull  xD,xA,xE xF  ,xK xL  ,

whereDA= {D∈ D, such that xA≺ xE≺ xF} for xAfixed. The resulting finite vol-ume partition ofΩ , denoted by N , forms the vertex mesh. The vertex mesh is split into interior and boundary controls volumes, respectively denoted by N and∂ N ; formally, it holds that N = N ∪ ∂ N .

Similarly, we associate a control volume denoted either byFor by E, with the point xF(face center) or the point xE(edge midpoint) in accordance with the follow-ing formula: E= ∪ D∈DE hull  xD, xA xB  ,xE, xK xL  , F= ∪ D∈DF hull  xD, xA xB  ,xF, xK xL  ,

whereDE= {D∈ D, with xE≺ xF} with xE fixed andDF= {D∈ D, with xE≺ xF} with xF fixed. The resulting finite volume partition ofΩ , denoted by F E , is the face-edge mesh. This partition contains both control volumes associated with the faces and the edges of the initial mesh and is split into the interior and boundary controls volumes, respectively denoted by F E and∂ F E ; formally, it holds that F E = F E ∪ ∂ F E .

(5)

4 Yves Coudi`ere, Florence Hubert and Gianmarco Manzini The 3D “Cell-Vertex-Face/Edge” DDFV Scheme

We say that uT = (uM

,uN,uF E) is a discrete function on Ω whenever its three components are piecewise constant functions on the meshes M , N and F E , re-spectively, and take the form

uM =

K∈M uKχK, u N =

A∈N uAχA, u F E =

F∈F uFχF+

E∈E uEχE.

Let X denote the set of the degrees of freedom of the form uT = (uK)K∈M,(uA)A∈N,(uE)E∈E,(uF)F∈F.

In order to take into account the Dirichlet boundary conditions, this set is supple-mented by the boundary data

δ uT = (uK)xK∈∂ M,(uA)xA∈∂ N,(uE)xE∈∂ F E,(uF)xF∈∂ F E

 ,

which form the set∂ X. We will search the numerical approximation to the scalar solution field u in the product set(uT

,δ uT

) ∈ X ×∂ X. Note that X, ∂ X, and X ×∂ X can be given the algebraic structure of a linear space after introducing (in the obvious way) the addition of two elements of the set and the multiplication of an element of the set by a real number.

The gradient of the discrete unknown uT, denoted by ∇T

uT, is a constant vector field on each diamond cell and is identified with a piecewise constant vector field on mesh D . It depends on the boundary dataδ uT

and can be written as ∇T

δ uu T = ∑D∈D∇Dδ uu T χD where ∇D δ uu T = 1

3|D| (uL− uK)NKL+ (uB− uA)NAB+ (uF− uE)NEF



. (1)

for anyD∈ D and with the vectors NKL= 12(xB− xA) × (xF− xE), NAB=12(xF−

xE) × (xL− xK) and NEF=1

2(xL− xK) × (xB− xA). This procedure defines a

gradi-ent operator, denoted by ∇T

δ u, mapping the discrete space X onto the space of the

discrete vector fields ∇T

uT, which we conveniently denote by Q.

Using the gradient formula we define the flux through each interface of the con-trol volumes of the three meshes M , N and F E . The three finite volume schemes are written by using a discrete divergence operator that maps each vector field in Q to a triple of scalar functions in X . Formally, we introduce the operator

divT :ξ = (ξD)D∈D∈ Q 7→ (divMξ , divN ξ , divF Eξ ) ∈ X

where divMξ = (divKξ )K, divN ξ = (divAξ )Aand divF Eξ = {(divEξ )E,(divFξ )F} are given by

(6)

|K| divKξ =

D∈DK ξD· NKL, |A| divAξ =

D∈DA ξD· NAB, (2) |E| divEξ =

D∈DE ξD· NEF, |F| divFξ =

D∈DF ξD· (−NEF) . (3)

In the previous statements, the symbols DK,DA,DE,DF refer to the diamond cells which overlap the cells labeled by the corresponding subscripted indices K,A,E, andL.

Since each of the divCξ approximates 1 |C|

R

Cdivξ (forC=K,A,E,F), the right hand side of the discrete problem is given by the piecewise constant projection of the function f onto the space X ,πT

f= {( fK)K∈M,( fA)A∈N,( fE,fF)E∈E ,F∈F} with fC=|C1|

R

Cf(x)dx for any cellC=K∈ M orA∈ N orForE∈ F E . Finally, the DDFV scheme reads as

− divT(KD∇D δ uu T ) = πT f (4) where KD= 1 |D| R

DK(x)dx is defined piecewise on the diamond cells. The scheme in (4) originates a symmetric and positive-definite linear system of equations (see [6] for a thourough discussion of the other properties). Assembling the matrix of the system amounts to gathering the local contributions of the discrete gradient associ-ated to each diamond cell. These contributions are explicitly taken into account by the local Gram matrix

KD=  

KDNKL· NKL KDNKL· NAB KDNKL· NEF KDNAB· NKL KDNAB· NABKDNAB· NEF KDNEF· NKL KDNEF· NAB KDNEF· NEF

 

The right hand side in (4) is split similarly in elementary contributions on the eight tetrahedra that compose the diamond cellsD.

3 Treatment of discontinuous permeability tensors

The case of a discontinuous permeability tensor in the DDFV framework deserves a special treatment that we discuss in this subsection. Let us suppose that the per-meability tensor is discontinuous across the interfaces of the control volumes of mesh M . We decompose each diamond cell into two sub-diamondsDKandDL, i.e.,

D=DK∪DL, whereDK is the union of the four tetrahedra with vertices xD, xK, the third vertex being xAor xB, and the fourth vertex being xEor xF.

Then, we introduce an additional degree of freedom at xD, the center of the dia-mond cell, and we write a gradient formula that is exact for affine functions on the two sub-diamonds. We obtain the two following formulas

(7)

6 Yves Coudi`ere, Florence Hubert and Gianmarco Manzini ∇T Ku T = 1 3|DK|

(uD− uK)NKL+ (uB− uA)NK

AB+ (uF− uE)N K EF  ∇T Lu T = 1 3|DL|

(uL− uD)NKL+ (uB− uA)NL

AB+ (uF− uE)N L EF



using the geometric vectors NK AB= 1 2(xF− xE) × (xD− xK), N L AB= 1 2(xF− xE) × (xL− xD), NK EF= 1 2(xD− xK) × (xB− xA), N L EF= 1

2(xL− xD) × (xB− xA), and introducing

the two volume factors|DK| =16det(xB− xA,xF− xE,xD− xK) and |DL| =16det(xB− xA,xF− xE,xL− xD). Also, we remark that |D| = |DK| + |DL|, NAB= NABK + N

L ABNEF= NK

EF+ N L

EFand it holds that|DK|N L AB− |DL|NABK = |DK|NAB− |D|N L AB. Let KDK = 1 |DK| R DKK(x)dx and KDL = 1 |DL| R

DLK(x)dx be the constant

approxi-mation of the diffusion tensor on the two sub-diamondsDK andDL. We determine the additional unknown uDin terms of the other local degrees of freedom uK, uL, uA, uB, uEand uFby imposing that

KDK∇ T Ku T · NKL= KDL∇ T Lu T · NKL,

which is the flux conservation through the common faceDK|DL. Moreover, let us introduce the following geometric factors that also depend on the permeability co-efficients: βKL= +|DL|KDKNKL· NKL+ |DK|KDLNKL· NKL βAB= −|DL|KDKN K AB· NKL+ |DK|KDLN L AB· NKL βEF= −|DL|KDKN K EF· NKL+ |DK|KDLN L EF· NKL A straightforward calculation yields the formula for uD

uD=|DL|KDKNKL· NKL βKL uK+|DK|KDLNKL· NKL βKL uL+βAB βKL uB− uA +βEF βKL uF− uE , and the formulas for the numerical gradients:

3∇TKu T =KDLNKL· NKL βKL NKL uL− uK +  β AB |DK|βKL NKL+ 1 |DK| NK AB  (uB− uA) +  β EF |DK|βKL NKL+ 1 |DK|N K EF  (uF− uE), 3∇T Lu T =KDKNKL· NKL βKL NKL uL− uK +  β AB |DL|βKL NKL+ 1 |DL| NL AB  (uB− uA) +  βEF |DL|βKL NKL+ 1 |DL|N L EF  (uF− uE).

Finally, we define the divergence operator for a discrete vector field which is piecewise constant onDK∩DLand may be discontinuous acrossDK|DLas

(8)

|K| divKξD=

D|K ξDK· NKL=

D|K ξDL· NKL=

D|K  |DK| |D| ξDK+ |DL| |D|ξDL  · NKL, (5) |A| divAξD=

D|A (ξDK· N K AB+ ξDL· N L AB), (6) |E| divEξD=

D|E (ξDK· N K EF+ ξDL· N L EF), (7) |F| divFξD=

D|DF (ξDK· −N K EF − ξDL· −N L EF). (8)

The DDFV method for the discontinuous case follows by using (5)-(8) with the approximate permeability tensors KDK and KDL instead of (2)-(3) in the scheme

formulation (4). LetξD

= KDTuT

and evaluate the quantities:  |DK|

|D| ξDK+

|DL|

|D|ξDL



· NKL= αKL·KL(uL− uK) + αKL·AB(uB− uA) + αKL·EF(uF− uE)

ξDK· N

K

AB+ ξDL· N

L

AB= αAB·KL(uL− uK) + αAB·AB(uB− uA) + αAB·EF(uF− uE) ξDK· N

K

EF+ ξDL· N

L

EF= αEF·KL(uL− uK) + αEF·AB(uB− uA) + αEF·EF(uF− uE) using the entries of the coefficient matrix

KnewD =  

αKL·KL αKL·AB αKL·EF αAB·KL αAB·ABαAB·EF αEF·KL αEF·AB αEF·EF

 .

Since KnewD is a 3× 3 symmetric elements we have only six independent entries, which after a straightforward calculations are given by:

αKL·KL= 1 3 KDKNKL· NKLKDLNKL· NKL βKL , αKL·AB= KDKNKL· N K ABKDLNKL· NKL+ KDLNKL· N L ABKDKNKL· NKL βKL , αKL·EF= 1 3 KDKNKL· N K EFKDLNKL· NKL+ KDLNKL· N L EFKDKNKL· NKL βKL , αAB·AB= 1 3  − β 2 AB |DK||DL|βKL + 1 |DK|KDKN K AB· N K AB+ 1 |DL|KDLN L AB· N L AB  , αAB·EF= 1 3  − βABβEF |DK||DL|βKL + 1 |DK|KDKN K EF· N K AB+ 1 |DL|KDLN L EF· N L AB  , αEF·EF= 1 3  − β 2 EF |DK||DL|βKL + 1 |DK|KDKN K EF· N K EF+ 1 |DL|KDLN L EF· N L EF  . and the remaining coefficients are determined by symmetry, i.e.,αAB·KL= αKL·AB,

(9)

8 Yves Coudi`ere, Florence Hubert and Gianmarco Manzini

4 Conclusions

In this work, we discussed how a discontinuous permeability can be treated in the numerical framework offered by the DDFV method. Whenever the discontinuity is across an internal interfaces shared by two control volumes of the primal mesh, two different gradients are considered on the two subdiamonds centered at that interface. Introducing an auxiliary variable at the interface and imposing flux conservation makes it possible to derive a formula for both gradients that is exact for affine func-tions. Then, a DDFV method can be formulated using a discrete divergence operator to express the flux balance on the overlapping meshes for primal control volumes, vertex control volumes and face-edge control volumes. The numerical experiments in [7] show the effectiveness of the method.

Acknowledgements

The work of the first two authors was supported by Groupement de Recherche MO-MAS. The work of the third author was partially supported by the Italian MIUR through the program PRIN2008.

References

1. Andreianov, B., Bendahmane, M., Hubert, F.: On 3D DDFV discretization of gradient and divergence operators. Part II. (2011). HAL, http://hal.archives-ouvertes.fr/hal-00567342 2. Andreianov, B., Bendahmane, M., Hubert, F., Krell, S.: On 3D DDFV discretization of

gradient and divergence operators. Part I. (2011) HAL, http://hal.archives-ouvertes.fr/hal-00355212.

3. Andreianov, B., Bendahmane, M., Karlsen, K.: A gradient reconstruction formula for finite-volume schemes and discrete duality. FVCA5, Wiley, (2008).

4. Andreianov, B., Hubert, F., Krell, S.: Benchmark 3D: a version of the DDFV scheme with cell/vertex unknowns on general meshes, this volume (2011).

5. Boyer, F., Hubert, F.: Benchmark on anisotropic problems, the DDFV discrete duality finite volumes and m-DDFV schemes. In: R. Eymard, J.M. H´erard (eds.) FVCA5, Wiley, (2008). 6. Coudi`ere, Y., Hubert, F.: A 3D discrete duality finite volume method for nonlinear elliptic

equation (2010) HAL, URL: http://hal.archives-ouvertes.fr/hal-00456837/fr.

7. Coudi`ere, Y., Hubert, F., Manzini, G.: Benchmark 3D: CeVeFE-DDFV, a discrete duality scheme with cell/vertex/face+edge unknowns. (this volume) (2011).

8. Coudi`ere, Y., Pierre, C., Rousseau, O., Turpault, R.: A 2D/3D discrete duality finite volume scheme. Application to ECG simulation. International Journal on Finite Volumes (2009) 6(1). 9. Domelevo, K., Omn`es, P.: A finite volume method for the laplace equation on almost arbitrary

two-dimensional grids. M2AN, Math. Model. Numer. Anal. (2005) 39(6), 1203–1249. 10. Herbin, R., Hubert, F.: Benchmark on discretization schemes for anisotropic diffusion

prob-lems on general grids. FVCA5, Wiley, (2008).

11. Hermeline, F.: Approximation of diffusion operators with discontinuous tensor coefficients on distorted meshes. Comp. Meth. Appl. Mech. Eng. (2003) 192(16), 1939–1959.

12. Hermeline, F.: A finite volume method for approximating 3D diffusion operators on general meshes. Journal of computational Physics (2009) 228(16), 5763–5786.

13. Pierre, C.: Mod´elisation et simulation de l’activit´e ´electrique du coeur dans le thorax, analyse num´erique et m´ethodes de volumes finis. Ph.D. thesis, Universit´e de Nantes (2005). The paper is in final form and no similar paper has been or is being submitted elsewhere.

Références

Documents relatifs

In a nutshell, we are going to argue that temporal clefts are in fact the only true clefts of CN, while other prima facie clefts are better analysed as concealed

In this paper, we study the moments of central values of cer- tain unitary families of Hecke L-functions of the Gaussian field, and establish quantitative non-vanishing result for

Abstract: The performance of networked control systems based on a switched control law is studied. The control law is switched between sampled-data feedback and zero control, the

The extension to advection-diffusion-reaction equations entails several new ideas: (i) We de- vise a local reconstruction of the advective derivative from cell- and face-based

We describe a numerical method, based on the spectral decom- position of vector/tensor components onto spherical harmonics, that allows for the evolution of only those scalar

It also shows different profiles of references for the three universities with a focus on basic biology in Strasbourg, on psychology, sport sciences and physiology in Aix-Marseille

The methods reviewed in this book (if we restrict our attention only to finite element type methods using piecewise polynomial approximation spaces in one form or an- other)

L’objectif principal de notre travail est de clarifier les effets d’une dose élevée de L- méthionine sur quelques paramètres biochimiques (Hcy, cholestérol total, LDL, HDL, TG,