Maday Efef PDF

A Symmetric mortar element method:
with its Robin iterative procedure

Y. Maday
1
1
Laboratoire Jacques-Louis Lions
Universit Pierre et Marie Curie, Paris, France
and Brown Univ.
European Finite Element Fair
Y. Maday (Paris 6 & Brown) Symetric Mortar EFEF07 1 / 31
Collaboration with
Caroline Japhet
Frdric Nataf
Outline
1
Introduction
Hybrid formulation
2
Iterative method
Continuous problem.
3
The discrete case
The triangulation and the discrete local spaces
The iterative scheme
4
Numerical results
Outline
1
Introduction
Hybrid formulation
2
Iterative method
Continuous problem.
3
The discrete case
4
Numerical results
Hybrid formulation.
Domain decomposition
Consider the problem
(Id )u = f in , u = 0 on , (1)
written under the following variational formulation : nd u H
1
0
()
such that
_
(uv +uv) dx =
_
fvdx, v H
1
0
(). (2)
taking into account the domain decomposition
=
K
k=1
k
. (3)
the problem can be written nd u H
1
0
() such that v H
1
0
().
K
k=1
_
k
_
(u
|
k ) (v
|
k ) +u
|
k v
|
k
_
dx =
K
k=1
_
k
f
|
k v
|
k dx,
Hybrid formulation.
(Id )u = f in , u = 0 on , (1)
1
0
()
such that
_
(uv +uv) dx =
_
fvdx, v H
1
0
(). (2)
=
K
k=1
k
. (3)
1
0
() such that v H
1
0
().
K
k=1
_
k
_
(u
|
k ) (v
|
k ) +u
|
k v
|
k
_
dx =
K
k=1
_
k
f
|
k v
|
k dx,
Hybrid formulation.
(Id )u = f in , u = 0 on , (1)
1
0
()
such that
_
(uv +uv) dx =
_
fvdx, v H
1
0
(). (2)
=
K
k=1
k
. (3)
1
0
() such that v H
1
0
().
K
k=1
_
k
_
(u
|
k ) (v
|
k ) +u
|
k v
|
k
_
dx =
K
k=1
_
k
f
|
k v
|
k dx,
Hybrid formulation.
(Id )u = f in , u = 0 on , (1)
1
0
()
such that
_
(uv +uv) dx =
_
fvdx, v H
1
0
(). (2)
=
K
k=1
k
. (3)
1
0
() such that v H
1
0
().
K
k=1
_
k
_
(u
|
k ) (v
|
k ) +u
|
k v
|
k
_
dx =
K
k=1
_
k
f
|
k v
|
k dx,
Hybrid formulation.
(Id )u = f in , u = 0 on , (1)
1
0
()
such that
_
(uv +uv) dx =
_
fvdx, v H
1
0
(). (2)
=
K
k=1
k
. (3)
1
0
() such that v H
1
0
().
K
k=1
_
k
_
(u
|
k ) (v
|
k ) +u
|
k v
|
k
_
dx =
K
k=1
_
k
f
|
k v
|
k dx,
Hybrid formulation.
Localisation
The space H
1
0
() can be identied with
V = {v = (v
1
, ..., v
K
)
K
k=1
H
1
(
k
),
k, , k = , 1 k, K, v
k
= v
over
k

}.
or again
V = {v = (v
1
, ..., v
K
)
K
k=1
H
1
(
k
),
p (p
k
)
K
k=1
H
1/2
(
k
) with p
k
= p
over
k,
,
K
k=1
H
1/2
(
k
)

H
1/2
(
k
)
= 0}.
Hybrid formulation.
Localisation
The space H
1
0
() can be identied with
V = {v = (v
1
, ..., v
K
)
K
k=1
H
1
(
k
),
k, , k = , 1 k, K, v
k
= v
over
k

}.
or again
V = {v = (v
1
, ..., v
K
)
K
k=1
H
1
(
k
),
p (p
k
)
K
k=1
H
1/2
(
k
) with p
k
= p
over
k,
,
K
k=1
H
1/2
(
k
)

H
1/2
(
k
)
= 0}.
Hybrid formulation.
Localisation with Lagrange multipliers
The problem (2) is equivalent to the following one : Find (u, p) V
such that v
K
k=1
H
1
(
k
),
K
k=1
_
k
(u
k
v
k
+u
k
v
k
) dx
K
k=1
H
1/2
(
k
)

H
1/2
(
k
)
=
K
k=1
_
k
f
k
v
k
dx.
With the constrained space dened as follows
V = {(v, q)
_
K
k=1
H
1
(
k
)
_
_
K
k=1
H
1/2
(
k
)
_
,
v
k
= v
and q
k
= q
over
k,
}
Hybrid formulation.
Localisation with Lagrange multipliers
The problem (2) is equivalent to the following one : Find (u, p) V
such that v
K
k=1
H
1
(
k
),
K
k=1
_
k
(u
k
v
k
+u
k
v
k
) dx
K
k=1
H
1/2
(
k
)

H
1/2
(
k
)
=
K
k=1
_
k
f
k
v
k
dx.
With the constrained space dened as follows
V = {(v, q)
_
K
k=1
H
1
(
k
)
_
_
K
k=1
H
1/2
(
k
)
_
,
v
k
= v
and q
k
= q
over
k,
}
Outline
1
Introduction
Hybrid formulation
2
Iterative method
Continuous problem.
3
The discrete case
4
Numerical results
Continuous problem.
Robin interface conditions
Instead of imposing the equalities of u and p we write
p
k
+u
k
= p
+u
over
k,
where is a given positive real number, and introduce the following
algorithm : let (u
n
k
, p
n
k
) H
1
(
k
) H
1/2
(
k
) be an approximation
of (u, p) in
k
at step n, then, (u
n+1
k
, p
n+1
k
) is the solution in
H
1
(
k
) H
1/2
(
k
) of
_
k
_
u
n+1
k
v
k
+u
n+1
k
v
k
_
dx
H
1/2
(
k
)

H
1/2
(
k
)
=
_
k
f
k
v
k
dx, v
k
H
1
(
k
) (4)

k, =
k, , v
k
H
1/2
00
(
k,
) (5)
Continuous problem.
p
k
+u
k
= p
+u
over
k,
algorithm : let (u
n
k
, p
n
k
) H
1
(
k
) H
1/2
(
k
of (u, p) in
k
at step n, then, (u
n+1
k
, p
n+1
k
H
1
(
k
) H
1/2
(
k
) of
_
k
_
u
n+1
k
v
k
+u
n+1
k
v
k
_
dx
H
1/2
(
k
)

H
1/2
(
k
)
=
_
k
f
k
v
k
dx, v
k
H
1
(
k
) (4)

k, =
k, , v
k
H
1/2
00
(
k,
) (5)
Continuous problem.
p
k
+u
k
= p
+u
over
k,
algorithm : let (u
n
k
, p
n
k
) H
1
(
k
) H
1/2
(
k
of (u, p) in
k
at step n, then, (u
n+1
k
, p
n+1
k
H
1
(
k
) H
1/2
(
k
) of
_
k
_
u
n+1
k
v
k
+u
n+1
k
v
k
_
dx
H
1/2
(
k
)

H
1/2
(
k
)
=
_
k
f
k
v
k
dx, v
k
H
1
(
k
) (4)

k, =
k, , v
k
H
1/2
00
(
k,
) (5)
Continuous problem.
p
k
+u
k
= p
+u
over
k,
algorithm : let (u
n
k
, p
n
k
) H
1
(
k
) H
1/2
(
k
of (u, p) in
k
at step n, then, (u
n+1
k
, p
n+1
k
H
1
(
k
) H
1/2
(
k
) of
_
k
_
u
n+1
k
v
k
+u
n+1
k
v
k
_
dx
H
1/2
(
k
)

H
1/2
(
k
)
=
_
k
f
k
v
k
dx, v
k
H
1
(
k
) (4)

k, =
k, , v
k
H
1/2
00
(
k,
) (5)
Continuous problem.
It is obvious to remark that this series of equations results in
uncoupled problems set on every
k
whenever f L
2
() we have
u
n+1
k
+u
n+1
k
= f
k
over
k
u
n+1
k
n
k
+u
n+1
k
= p
n
+u
n
over
k,
p
n+1
k
=
u
n+1
k
n
k
over
k
(6)
Continuous problem.
It is obvious to remark that this series of equations results in
uncoupled problems set on every
k
whenever f L
2
() we have
u
n+1
k
+u
n+1
k
= f
k
over
k
u
n+1
k
n
k
+u
n+1
k
= p
n
+u
n
over
k,
p
n+1
k
=
u
n+1
k
n
k
over
k
(6)
Continuous problem.
Analysis of the convergence
As in [Lions] and [Despres] by using an energy estimate (done with
f = 0)
_
k
_
|u
n+1
k
|
2
+|u
n+1
k
|
2
_
dx =
_
k
p
n+1
k
u
n+1
k
ds
=
1
4
_
k,
_
(p
n+1
k
+u
n+1
k
)
2
(p
n+1
k
u
n+1
k
)
2
_
ds
By using the interface conditions (5) we obtain
_
k
_
|u
n+1
k
|
2
+|u
n+1
k
|
2
_
dx +
1
4
k,
(p
n+1
k
u
n+1
k
)
2
ds
=
1
4
k,
(p
n
+u
n
)
2
ds (7)
Continuous problem.
f = 0)
_
k
_
|u
n+1
k
|
2
+|u
n+1
k
|
2
_
dx =
_
k
p
n+1
k
u
n+1
k
ds
=
1
4
_
k,
_
(p
n+1
k
+u
n+1
k
)
2
(p
n+1
k
u
n+1
k
)
2
_
ds
_
k
_
|u
n+1
k
|
2
+|u
n+1
k
|
2
_
dx +
1
4
k,
(p
n+1
k
u
n+1
k
)
2
ds
=
1
4
k,
(p
n
+u
n
)
2
ds (7)
Continuous problem.
f = 0)
_
k
_
|u
n+1
k
|
2
+|u
n+1
k
|
2
_
dx =
_
k
p
n+1
k
u
n+1
k
ds
=
1
4
_
k,
_
(p
n+1
k
+u
n+1
k
)
2
(p
n+1
k
u
n+1
k
)
2
_
ds
_
k
_
|u
n+1
k
|
2
+|u
n+1
k
|
2
_
dx +
1
4
k,
(p
n+1
k
u
n+1
k
)
2
ds
=
1
4
k,
(p
n
+u
n
)
2
ds (7)
Continuous problem.
f = 0)
_
k
_
|u
n+1
k
|
2
+|u
n+1
k
|
2
_
dx =
_
k
p
n+1
k
u
n+1
k
ds
=
1
4
_
k,
_
(p
n+1
k
+u
n+1
k
)
2
(p
n+1
k
u
n+1
k
)
2
_
ds
_
k
_
|u
n+1
k
|
2
+|u
n+1
k
|
2
_
dx +
1
4
k,
(p
n+1
k
u
n+1
k
)
2
ds
=
1
4
k,
(p
n
+u
n
)
2
ds (7)
Continuous problem.
Let us now introduce
E
n
=
K
k=1
_
k
_
|u
n
k
|
2
+|u
n
k
|
2
_
and B
n
=
1
4
K
k=1
=k
_
k,
(p
n
k
u
n
k
)
2
ds.
By summing up the previous estimates over k = 1, ..., K, we have
E
n+1
+B
n+1
B
n
,
so that, by summing up these inequalities, now over n, we obtain :
n=1
E
n
B
0
.
We thus have
lim
n
E
n
= 0
so that
lim
n
p
n
k
H
1/2
(
k
)
= 0, for k = 1, ..., K,
which proves the convergence of the continuous algorithm. Y. Maday (Paris 6 & Brown) Symetric Mortar EFEF07 12 / 31
Continuous problem.
E
n
=
K
k=1
_
k
_
|u
n
k
|
2
+|u
n
k
|
2
_
and B
n
=
1
4
K
k=1
=k
_
k,
(p
n
k
u
n
k
)
2
ds.
E
n+1
+B
n+1
B
n
,
n=1
E
n
B
0
.
We thus have
lim
n
E
n
= 0
so that
lim
n
p
n
k
H
1/2
(
k
)
= 0, for k = 1, ..., K,
Continuous problem.
E
n
=
K
k=1
_
k
_
|u
n
k
|
2
+|u
n
k
|
2
_
and B
n
=
1
4
K
k=1
=k
_
k,
(p
n
k
u
n
k
)
2
ds.
E
n+1
+B
n+1
B
n
,
n=1
E
n
B
0
.
We thus have
lim
n
E
n
= 0
so that
lim
n
p
n
k
H
1/2
(
k
)
= 0, for k = 1, ..., K,
Continuous problem.
E
n
=
K
k=1
_
k
_
|u
n
k
|
2
+|u
n
k
|
2
_
and B
n
=
1
4
K
k=1
=k
_
k,
(p
n
k
u
n
k
)
2
ds.
E
n+1
+B
n+1
B
n
,
n=1
E
n
B
0
.
We thus have
lim
n
E
n
= 0
so that
lim
n
p
n
k
H
1/2
(
k
)
= 0, for k = 1, ..., K,
Continuous problem.
E
n
=
K
k=1
_
k
_
|u
n
k
|
2
+|u
n
k
|
2
_
and B
n
=
1
4
K
k=1
=k
_
k,
(p
n
k
u
n
k
)
2
ds.
E
n+1
+B
n+1
B
n
,
n=1
E
n
B
0
.
We thus have
lim
n
E
n
= 0
so that
lim
n
p
n
k
H
1/2
(
k
)
= 0, for k = 1, ..., K,
Continuous problem.
E
n
=
K
k=1
_
k
_
|u
n
k
|
2
+|u
n
k
|
2
_
and B
n
=
1
4
K
k=1
=k
_
k,
(p
n
k
u
n
k
)
2
ds.
E
n+1
+B
n+1
B
n
,
n=1
E
n
B
0
.
We thus have
lim
n
E
n
= 0
so that
lim
n
p
n
k
H
1/2
(
k
)
= 0, for k = 1, ..., K,
Continuous problem.
We have just proven that
Theorem
Assume that f is in L
2
() and (p
0
k
)
1kK

H
1/2
(
k,
). Then, the
algorithm (4)-(5) converges in the sense that
lim
n
_
u
n
k
u
k
H
1
(
k
)
+p
n
k
p
k
H
1/2
(
k
)
_
= 0, for 1 k K,
where u
k
is the restriction to
k
of the solution u to (1), and p
k
=
u
k
n
k
over
k
, 1 k K.
Outline
1
Introduction
Hybrid formulation
2
Iterative method
Continuous problem.
3
The discrete case
4
Numerical results
Each
k
is provided with its own mesh T
k
h
, 1 k K, such that
k
=
TT
k
h
T.
As is standard we introduce the discretization parameter
h = max
1kK
h
k
, with h
k
= max
TT
k
h
h
T
.
We assume that T
k
h
is uniformly regular Then, we dene over each
subdomain two conforming spaces Y
k
h
and X
k
h
by :
Y
k
h
= {v
h,k
C
0
(
k
), v
h,k
|T
P
M
(T), T T
k
h
},
X
k
h
= {v
h,k
Y
k
h
, v
h,k
|
k
= 0}.
Each
k
k
h
, 1 k K, such that
k
=
TT
k
h
T.
h = max
1kK
h
k
, with h
k
= max
TT
k
h
h
T
.
We assume that T
k
h
k
h
and X
k
h
by :
Y
k
h
= {v
h,k
C
0
(
k
), v
h,k
|T
P
M
(T), T T
k
h
},
X
k
h
= {v
h,k
Y
k
h
, v
h,k
|
k
= 0}.
Each
k
k
h
, 1 k K, such that
k
=
TT
k
h
T.
h = max
1kK
h
k
, with h
k
= max
TT
k
h
h
T
.
We assume that T
k
h
k
h
and X
k
h
by :
Y
k
h
= {v
h,k
C
0
(
k
), v
h,k
|T
P
M
(T), T T
k
h
},
X
k
h
= {v
h,k
Y
k
h
, v
h,k
|
k
= 0}.
Each
k
k
h
, 1 k K, such that
k
=
TT
k
h
T.
h = max
1kK
h
k
, with h
k
= max
TT
k
h
h
T
.
We assume that T
k
h
k
h
and X
k
h
by :
Y
k
h
= {v
h,k
C
0
(
k
), v
h,k
|T
P
M
(T), T T
k
h
},
X
k
h
= {v
h,k
Y
k
h
, v
h,k
|
k
= 0}.
The interface spaces
Over each
k,
we consider the space of traces of elements of Y
k
h
. It is
denoted by Y
k,
h
.
k, Y
k
h
= Y
k,
h
over each such that
k,
= . Mortar subspace
W
k,
h
Y
k,
h
Example in 2D, over each (possibly curved) side
k,
of piecewise
polynomials of degree M.
W
k,
h
composed of polynomials of degree M 1 over both [x
k,
0
, x
k,
1
]
and [x
k,
n1
, x
k,
n
].
W
k
h
is the product space of the

W
k,
h
over each such that
k,
= .
Over each
k,
k
h
. It is
denoted by Y
k,
h
.
k, Y
k
h
= Y
k,
h
over each such that
k,
= . Mortar subspace
W
k,
h
Y
k,
h
k,
of piecewise
W
k,
h
k,
0
, x
k,
1
]
and [x
k,
n1
, x
k,
n
].
W
k
h

W
k,
h
over each such that
k,
= .
Over each
k,
k
h
. It is
denoted by Y
k,
h
.
k, Y
k
h
= Y
k,
h
over each such that
k,
= . Mortar subspace
W
k,
h
Y
k,
h
k,
of piecewise
W
k,
h
k,
0
, x
k,
1
]
and [x
k,
n1
, x
k,
n
].
W
k
h

W
k,
h
over each such that
k,
= .
Over each
k,
k
h
. It is
denoted by Y
k,
h
.
k, Y
k
h
= Y
k,
h
over each such that
k,
= . Mortar subspace
W
k,
h
Y
k,
h
k,
of piecewise
W
k,
h
k,
0
, x
k,
1
]
and [x
k,
n1
, x
k,
n
].
W
k
h

W
k,
h
over each such that
k,
= .
Over each
k,
k
h
. It is
denoted by Y
k,
h
.
k, Y
k
h
= Y
k,
h
over each such that
k,
= . Mortar subspace
W
k,
h
Y
k,
h
k,
of piecewise
W
k,
h
k,
0
, x
k,
1
]
and [x
k,
n1
, x
k,
n
].
W
k
h

W
k,
h
over each such that
k,
= .
Over each
k,
k
h
. It is
denoted by Y
k,
h
.
k, Y
k
h
= Y
k,
h
over each such that
k,
= . Mortar subspace
W
k,
h
Y
k,
h
k,
of piecewise
W
k,
h
k,
0
, x
k,
1
]
and [x
k,
n1
, x
k,
n
].
W
k
h

W
k,
h
over each such that
k,
= .
The global spaces and the problem
The global discrete constrained space is then
V
h
= {(u
h
, p
h
)
_
K
k=1
X
k
h
_
_
K
k=1
W
k
h
_
,
_
k,
((p
h,k
+u
h,k
) (p
h,
+u
h,
))
h,k,
= 0,
h,k,

W
k,
h
},
and the discrete problem is : Find (u
h
, p
h
) V
h
such that
v
h
= (v
h,1
, ...v
h,K
)
K
k=1
X
k
h
,
K
k=1
_
k
_
u
h,k
v
h,k
+u
h,k
v
h,k
_
dx
K
k=1
_
k
p
h,k
v
h,k
ds
=
K
k=1
_
k
f
k
v
h,k
dx. (8)
The global spaces and the problem
The global discrete constrained space is then
V
h
= {(u
h
, p
h
)
_
K
k=1
X
k
h
_
_
K
k=1
W
k
h
_
,
_
k,
((p
h,k
+u
h,k
) (p
h,
+u
h,
))
h,k,
= 0,
h,k,

W
k,
h
},
and the discrete problem is : Find (u
h
, p
h
) V
h
such that
v
h
= (v
h,1
, ...v
h,K
)
K
k=1
X
k
h
,
K
k=1
_
k
_
u
h,k
v
h,k
+u
h,k
v
h,k
_
dx
K
k=1
_
k
p
h,k
v
h,k
ds
=
K
k=1
_
k
f
k
v
h,k
dx. (8)
Outline
1
Introduction
Hybrid formulation
2
Iterative method
Continuous problem.
3
The discrete case
4
Numerical results
We also have the discrete algorithm : let (u
n
h,k
, p
n
h,k
) X
k
h

W
k
h
then,
(u
n+1
h,k
, p
n+1
h,k
) is the solution in X
k
h

W
k
h
of
_
k
_
u
n+1
h,k
v
h,k
+u
n+1
h,k
v
h,k
_
dx
_
k
p
n+1
h,k
v
h,k
ds
=
_
k
f
k
v
h,k
dx, v
h,k
X
k
h
(9)
_
k,
(p
n+1
h,k
+u
n+1
h,k
)
h,k,
=
_
k,
(p
n
h,
+u
n
h,
)
h,k,
,
h,k,

W
k,
h
. (10)
Convergence for the iterative scheme
We can prove the convergence of the iterative scheme
Theorem
Let us assume that h c, for some constant c small enough. Then,
the discrete problem (8) has a unique solution (u
h
, p
h
) V
h
. The
algorithm (9)-(10) is well posed and converges in the sense that
lim
n
_
_
u
n
h,k
u
h,k
H
1
(
k
)
+
=k
p
n
h,k,
p
h,k,
1
2
(
k,
)
_
_
= 0, for 1 k K.
Convergence for the iterative scheme
Based on a stability result for the Lagrange multipliers, proven in 2D by
Ben Belgacem, and valid also in 3D
Lemma
There exists a constant c
such that, for any p

h,k,
in

W
k,
h
, there exists
an element w
h,k,
in X
k
h
that vanishes over
k
\
k,
and satises
_
k,
p
h,k,
w
h,k,
p
h,k,
2
H
1
2
(
k,
)
(11)
with a bounded norm
w
h,k,
H
1
(
k
)
c
p
h,k,
1
2
(
k,
)
. (12)
Analysis of the discrete problem
Lemma
There exists a constant > 0 independent of h such that
(u
h
, p
h
) V
h
, v
h

K
k=1
X
k
h
,
a((u
h
, p
h
), v
h
)) (u
h
+p
h
1
2
,
)v
h
. (13)
Moreover, we have the continuity argument : there exists a constant
c > 0 such that
(u
h
, p
h
) V
h
, v
h

K
k=1
X
k
h
,
a((u
h
, p
h
), v
h
)) c(u
h
+p
h
1
2
)(v
h
). (14)
Convergence of the discrete scheme -1-
Theorem
Assume that the solution u of (1)-(1) is in H
2
() H
1
0
(), and
u
k
= u
|
k H
2+m
(
k
), with M 1 m 0, and let p
k,
=
u
n
k
over
each
k,
. Then, there exists a constant c independent of h and such
that
u
h
u
+p
h
p
1
2
,
c(h
2+m
+h
1+m
)
K
k=1
u
H
2+m
(
k
)
+ c(
h
m
+h
1+m
)
K
k=1
p
k,
H
1
2
+m
(
k,
)
.
Convergence of the discrete scheme -2-
Theorem
Assume that the solution u of (1)-(1) is in H
2
() H
1
0
(),
u
k
= u
|
k H
2+m
(
k
), and p
k,
=
u
n
k
is in H
3
2
+m
(
k,
) with
M 1 m 0. Then there exists a constant c independent of h and
such that
u
h
u
+p
h
p
1
2
,
c(h
2+m
+h
1+m
)
K
k=1
u
H
2+m
(
k
)
+ c(
h
1+m
+h
2+m
)(logh)
(m)
K
k=1
p
k,
H
3
2
+m
(
k,
)
with (m) = 0 if m M 2 and (m) = 1 if m = M 1.
What about P
1
elements
Assume u
K
k=1
H
2
(
k
) and is a constant independent of h then
u
h
u
c
K
i =1
u
H
2
(
k
)
which is not optimal.
In order to improve should depend on h, or assume more regularity
on u, or at least over p
k,
=
u
n
k
:
If the solution u
K
k=1
H
2
(
k
) and =
c
h
, then
u
h
u
ch
K
i =1
u
H
2
(
k
)
If the solution u
K
k=1
H
2
(
k
), p
k,
H
3
2
(
k,
) and is a
constant independent of h then
u
h
u
= O(h| log(h)|).
Numerical results
0 0.2 0.4 0.6 0.8 1
0
0.1
0.2
0.3
0.4
0.5
0.6
0.7
0.8
0.9
1
x
y
Mesh
Figure: Lebesgue constant on the interval.
Choice of the Robin parameter
The Robin parameter is either an arbitrary constant or takes the
following values :
min
= [(
2
+1)((

h
min
)
2
+1)]
1
4
mean
= [(
2
+1)((

h
mean
)
2
+1)]
1
4
max
= [(
2
+1)((

h
max
)
2
+1)]
1
4
where h
min
, h
mean
and h
max
stands respectively for the smallest
meanest or highest step size on the interface.
Numerical results
0 20 40 60 80 100 120 140 160 180
10
!7
10
!6
10
!5
10
!4
10
!3
10
!2
10
!1
10
0
number of iterations
l
o
g
(

r
e
l
a
t
i
v
e

H
1

e
r
r
o
r

)
Schwarz : relative H
1
error versus the number of iterations, for different values of !
1
8.9126 (!
hmax
)
10.9130 (!
hmean
)
16.2657 (!
hmin
)
35
Figure: Lebesgue constant on the interval.
Conclusions and Future
This is a new non conforming approximation
More symmetric than the mortar element method
The iterative method is already working quite well
But should be improved by order 2 Robin conditions
Japhet, C.; Maday, Y.; Nataf, F. A new cement to glue
non-conforming grids with Robin interface conditions: the nite
element case
Achdou, Y.; Japhet, C.; Maday, Y.; Nataf, F. A new cement to glue
volume case. Numer. Math. 92 (2002), no. 4, 593620
element case
element case
element case
element case
element case
21 - 25 mai : Rigidit en dynamique et en gomtrie
28 mai - 1er juin : Autour des conjectures de Brou
29 mai - 1er juin : Petit groupe de travail : Mesures innies et
applications unimodales
4 - 8 juin : Noeuds, arrangements dhyperplans et groupes de
Coxeter
11 au 12 juin : Miniworkshop de Biomathmatique et Systmes
Dynamiques: Bifurcations et symtries en gntique et en
neurosciences; Proprites statistiques des systmes dynamiques
11 - 15 juin : Confrence franco-japonaise sur lendoscopie
automorphe
13 - 15 juin : Journes Odysse
18 - 22 juin : Gomtrie et EDP
18 - 29 juin : Research in Pairs : Core of Monomial Ideals
25 - 29 juin : Espaces doprateurs, Espaces L
p
non-commutatifs
et Applications
2 au 6 juillet : Colloque OPSFA 07
9 au 20 juillet : Ecole dt sur la conjecture de modularit de
Serre

Maday Efef PDF

Загружено:

Сведения о документе

Оригинальное название

Авторское право

Доступные форматы

Поделиться этим документом

Поделиться или встроить документ

Параметры публикации

Этот документ был вам полезен?

Это неприемлемый материал?

Авторское право:

Доступные форматы

Maday Efef PDF

Загружено:

Авторское право:

Доступные форматы

A Symmetric mortar element method:

with its Robin iterative procedure

such that, for any p

Вам также может понравиться