FETI-DP and BDDC preconditioners

for the Virtual Element Method in 2D and 3D

Silvia Bertoluzza

Istituto di Matematica Applicata e Tecnologie Informatiche del CNR, Pavia

Work in collaboration with M. Pennacchio, D. Prada (IMATI-CNR)

FEF2017, Rome

S. Bertoluzza (IMATI-CNR) FETI-DP and BDDC for VEM FEF2017 - Rome 1 / 24

Layout

Model problem:

u = f , in , u = 0 on

Variational form
Z
u H01 (), a(u, v ) := u v = hf , v i v H01 ()

Polygonal tessellation
Assumptions
Quasi-uniformity
h: for any two vertices A, B of an element K , |A B| ' h
VEM discretization of order k

S. Bertoluzza (IMATI-CNR) FETI-DP and BDDC for VEM FEF2017 - Rome 2 / 24

Preconditioners

Variational formulation linear system

Au = f

Matrix A ill conditioned

Precondition by domain decomposition approach

Several possible approaches

FETI-DP & BDDC
[C. Farhat, M. Lesoinne, P. LeTallec, K. Pierson, & D. Rixen, 01 - Mandel&Dohrman 03]

Tools developed allow analysis of other approaches (FETI,

substructuring)

S. Bertoluzza (IMATI-CNR) FETI-DP and BDDC for VEM FEF2017 - Rome 3 / 24

Domain decomposition
Tessellation Th split as Th = Th` so that = ` with polygonal
subdomains ` = K T ` K
h
Local bilinear forms
X
ah` (u, v ) = ahK (u, v )
K Th`

` nice polygons: # and size of faces and shape regularity of `

plays a role (no arbitrary union of elements)

S. Bertoluzza (IMATI-CNR) FETI-DP and BDDC for VEM FEF2017 - Rome 4 / 24

Interface problem

Eliminate interiors unknown and work on a problem defined on the

interface
Subdomain spaces Vh` = Vh |` , Wh` = Vh` |`
Discrete harmonic lifting of VEM traces:

L`h : Wh` Vh` , L`h w |` = w , ah` (L`h w , v ) = 0, v Vh` H01 (` )

Stability of discrete harmonic lifting

L`h verifies
kL`h w kH 1 (` ) . kw kH 1/2 (` )

For VEM proof requires the construction of one stable lifting, which need the construction of a
Scott-Zhang type operator [B., Pennacchio 15]

S. Bertoluzza (IMATI-CNR) FETI-DP and BDDC for VEM FEF2017 - Rome 5 / 24

 Original problem
X
u Vh , ah (u, v ) = ah` (u, v ) = hf , v i, v Vh
`

Interface problem

w Wh = Vh | , s(w , z) = hg , zi, z Wh

with X
sh (w , z) = ah` (L`h w , L`h z), hg , zi = hf , L`h zi
`

Proposition
There exist constant , such that
X X
|w |2H 1/2 (` ) sh (w , w ) |w |2H 1/2 (` )
` `

S. Bertoluzza (IMATI-CNR) FETI-DP and BDDC for VEM FEF2017 - Rome 6 / 24

BDDC and FETI-DP: the minimalist description
[Mandel & Sousedik, 13]

W finite dimensional space, s(, ) bilinear form on W , coercive on W

Variational problem on space W W :

u W : s(u, v ) = hf , v i v W .

Intermediate space W with W W W s.t. s(, ) coercive on W

Problem on W easier than problem on W

Linear operators

S : W W 0 , hSu, v i = s(u, v ) v W
S : W W 0 , hSu, v i = s(u, v ) v W

S. Bertoluzza (IMATI-CNR) FETI-DP and BDDC for VEM FEF2017 - Rome 7 / 24

Ingredients: linear operators P, B, BDT
P: projector

P : W W , P 2 = P, range P = W

B enforces the condition u W by Bu = 0:

B : W , null B = W , range B = = W /W

BDT : generalized inverse of B

BDT : W , BBDT = I

R : W W natural injection

Assumption
B, BDT and P satisfy
BDT B + P = IW
S. Bertoluzza (IMATI-CNR) FETI-DP and BDDC for VEM FEF2017 - Rome 8 / 24
BDDC

Solve
Su = f

BDDC is the PCG method with abstract preconditioner MBDDC

MBDDC : r 7 u = Pw with w W : a(w , z) = hr , Pzi z W

Operator form of BDDC

MBDDC = P S 1 P T

S. Bertoluzza (IMATI-CNR) FETI-DP and BDDC for VEM FEF2017 - Rome 9 / 24

FETI-DP

Saddle point problem

Su + B T = P T f , Bu = 0

Eliminate u = S 1 (P T f B T ) equation in

B S 1 B T = B S 1 P T f

FETI-DP is PCG with preconditioner

MFETI DP = BD SBDT

S. Bertoluzza (IMATI-CNR) FETI-DP and BDDC for VEM FEF2017 - Rome 10 / 24

Condition number estimates

Theorem [Mandel & Sousedik, 13]

The eigenvalues of the preconditioned operators of FETI-DP and BDDC
satisfy 1 FETI DP and 1 BDDC with

BDDC = kPk2S FETI DP = kBDT Bk2S

Moreover if W 6= W and if BDT B + P = IW , then

BDDC = FETI DP

S. Bertoluzza (IMATI-CNR) FETI-DP and BDDC for VEM FEF2017 - Rome 11 / 24

The spaces W , W and W

Interface nodes split as

nodes interior to macro-edges (dual nodes)
cross points (primal nodes)
W : continuity at all interface nodes
W : drop continuity at dual nodes
W : drop continuity at all interface nodes
B: jump at dual nodes

S. Bertoluzza (IMATI-CNR) FETI-DP and BDDC for VEM FEF2017 - Rome 12 / 24

Building P and BDT

Various recipes for building P that trivially carry over to VEM

averaging (single value in double node = average of the two values)
weighted averaging to take into account non constant coefficients
(different recipes for choosing the weights)

More refined strategies introduced recently (BDDC and FETI-DP de

luxe) [L. Beirao da Veiga, L. F. Pavarino, S. Scacchi, O. B. Widlund, S. Zampini, 14]

Recipe for building BDT

choose any pseudoinverse B + of B (BB + = I )
set BDT = (IW P)B +
definition independent of the choice of B +
it is possible to check that BDT B + P = IW

S. Bertoluzza (IMATI-CNR) FETI-DP and BDDC for VEM FEF2017 - Rome 13 / 24

Condition numbers estimate [B.,Pennacchio, 2017]

Theorem
The condition numbers FETI DP and BDDC for, resp., FETI-DP and
BDDC applied to VEM satisfy

FETI DP . (1 + log(Hk 2 /h))2 , BDDC . (1 + log(Hk 2 /h))2

Proof relies on series of technical lemmata holding for FEM carried over to
VEM

S. Bertoluzza (IMATI-CNR) FETI-DP and BDDC for VEM FEF2017 - Rome 14 / 24

Technical lemmata

Example
E macroedge of ` , w Wh` , w 0 Wh` defined as

w 0 = w at nodes interior to E , w 0 = 0 at all other nodes

Then
kw 0 kH 1/2 (E ) . (1 + log(Hk 2 /h))2 kw kH 1/2 (E ) .
00

New proof relying solely on the properties of Wh (Vh completely forgotten)

In 2D Wh piecewise polynomial functions
Essentially use inverse inequalities and trace type theorems
Carries over to 3D VEM spaces (Wh is a 2D VEM space)

S. Bertoluzza (IMATI-CNR) FETI-DP and BDDC for VEM FEF2017 - Rome 15 / 24

Numerical tests

Test problem

u = 1 in , u = 0 on , =]0, 1[2

split in equal squared subdomains

Hexagonal and Voronoi tessellation in each subdomain

S. Bertoluzza (IMATI-CNR) FETI-DP and BDDC for VEM FEF2017 - Rome 16 / 24

Test 1. k = 1 - = 1

Table: Hexagonal mesh - N number of subdomains - n local problem size

N\n 8 10 18 20 34 40 70 80
8 9 (3.28) 11 (4.56) 11 (5.58) 12 (6.77)
16 9 (3.52) 11 (4.83) 12 (5.89) 14 (7.15)
32 9 (3.66) 10 (4.87) 11 (5.94) 13 (7.22)
64 8 (3.34) 9 (4.88) 10 (5.93)

Table: Voronoi mesh - N number of subdomains - n local problem size

N\n 100 400 1400 5000
8 9 (2.74) 11 (3.71) 11 (4.72) 12 (5.37)
16 9 (2.84) 12 (3.95) 12 (4.94) 12 (5.68)
32 9 (2.87) 11 (3.94) 11 (4.98) 12 (5.74)
64 9 (2.88) 11 (3.98) 11 (4.99) -

S. Bertoluzza (IMATI-CNR) FETI-DP and BDDC for VEM FEF2017 - Rome 17 / 24

Varying coefficients

u = 1
= 10 , random
in SD
Operator E built by
weighted averaging

+ wi+ + wi
wi =
+ + n

S. Bertoluzza (IMATI-CNR) FETI-DP and BDDC for VEM FEF2017 - Rome 18 / 24

k = 1 - = 10 , [4, 4] random in SD

Table: Hexagonal mesh - N number of subdomains - n local problem size

N\n 8 10 18 20 34 40 70 80
8 12 (3.20) 16 (4.39) 19 (5,86) 22 (6.93)
16 13 (3.45) 14 (4.36) 16 (5.87) 18 (6.80)
32 13 (3.40) 15 (4.60) 15 (6.07) 18 (7.45)

Table: Voronoi mesh - N number of subdomains - n local problem size

N\n 100 400 1400 5000
8 11 (2.82) 13 (3.77) 15 (4.65) 17 (5.46)
16 11 (2.74) 14 (3.95) 15 (4.77) 15 (5.56)
32 11 (2.84) 14 (4.02) 13 (4.68) 15 (5.57)

S. Bertoluzza (IMATI-CNR) FETI-DP and BDDC for VEM FEF2017 - Rome 19 / 24

variable k - =?

Table: Hexagonal mesh - k polynomial order - N: number of subdomain.

N\k 2 3 4 5 6 7 8
8 11 12 13 13 14 14 14
16 12 14 14 15 16 17 17
32 11 13 14 14 14 16 -

Figure: Left. Largest eigenvalue for increasing polynomial degree, Right. Largest
eigenvalue for increasing H/h and k = 4, 8, N = 256, 64.

S. Bertoluzza (IMATI-CNR) FETI-DP and BDDC for VEM FEF2017 - Rome 20 / 24

Influence of geometry

Strong shape regularity assumption is quite restrictive

Needed to obtain inverse inequality on egdes

kuh k1,E C (mesh)kuh k0,E , C (mesh) ' h1

Dependence of C (mesh) on #(d.o.f.) in 1D

1 uniform grid;
2 random grid
#(d.o.f .) N + 1,
h 1/N;
3 random grid
#(d.o.f .) N + 1,
h 1/(2N);
4 random grid
#(d.o.f .) N + 1,
h 1010 .

S. Bertoluzza (IMATI-CNR) FETI-DP and BDDC for VEM FEF2017 - Rome 21 / 24

Extension to 3D

W in 3D:
continuity at cross points is Rnot enough
continuity of edge average ( E [u] = 0) - easy to impose since on edge
we have pw polynomials R
continuity of face average ( F [u] = 0) - easy to impose for k > 1 since
average on elements are d.o.f

Proof of technical lemmas in 3D: for each face / edge

Inverse inequality on face and edges
Rieszs basis property
X
w (d.o.f )(d.o.f )2 ' k k2L2
d.o.f .

Stability of discrete harmonic Lifting

S. Bertoluzza (IMATI-CNR) FETI-DP and BDDC for VEM FEF2017 - Rome 22 / 24

Extension to 3D

in 2D traces of VEM functions are 1D finite elements: everything is

known!
in 3D traces of VEM functions are 2D VEM: proofs are needed

We are able to prove everything for k = 1

Rieszs basis property proved using maximum principle

Theorem holds in 3D for the lowest order case!

For k > 1 Rieszs basis property will depend on the choice of degrees
of freedom

S. Bertoluzza (IMATI-CNR) FETI-DP and BDDC for VEM FEF2017 - Rome 23 / 24

Remarks

FETI-DP and BDDC preconditioners for VEM behave similarly as for

FEM
Proof holds in 2D and carry over to 3D

Technical lemmata allow the analysis of other domain decomposition

preconditioners for VEM
FETI
Iterative substructuring

New techniques allow to carry over the proof to any discretization

satisfying
Stability of the discrete harmonic lifting
Inverse inequalities

S. Bertoluzza (IMATI-CNR) FETI-DP and BDDC for VEM FEF2017 - Rome 24 / 24