• Aucun résultat trouvé

Exercises - Chapter 3 The Construction of a Finite Element Space

N/A
N/A
Protected

Academic year: 2022

Partager "Exercises - Chapter 3 The Construction of a Finite Element Space"

Copied!
2
0
0

Texte intégral

(1)

Universit´e de Nice Sophia-Antipolis

Master MathMods - Finite Elements - 2008/2009

Exercises - Chapter 3 The Construction of a Finite Element Space

Exercise 1.

Let Pk denote the set of all polynomials of degree less than or equal tok in one variable.

Let Kb = [0,1], the following triplets (K ,b Pb,Nb) are they finite elements? In the favorable case, give the nodal basis of Pb.

(a)Pb =P1,Nb ={N1, N2}where N1(v) =v(0) and N2(v) =v(1).

(b)Pb =P2,Nb ={N1, N2, N3}where N1(v) =v(0), N2(v) =v(1) and N3(v) =v(1/2).

(c) Pb = P3, Nb = {N1, N2, N3, N4} where N1(v) = v(0), N2(v) =v(1), N3(v) =v(1/3) and N4(v) =v(2/3).

(d)Pb =P0,Nb ={N1} whereN1(v) =R1

0 v(x)dx.

(e)Pb=P3,Nb ={N1, N2, N3, N4}whereN1(v) =v(0), N2(v) =v(1),N3(v) =v(0) and N4(v) =v(1).

Leta,bbe reals and K = [a , b]. In each above example where (K ,b Pb,Nb) is a finite element, give a finite element (K ,P,N) affine equivalent to (K ,b Pb,Nb).

Exercise 2.

LetKb be the triangle whose vertices are the points ba1 = (0,0), ba2 = (1,0) and ba3 = (0,1) i.e. Kb ={(0,0),(1,0),(0,1)}, mbi denote the midpoints of his edges, according tomb1 is the midpoint of the edge (ba2,ba3), mb2 is the midpoint of (ba3,ba1),mb3 is the midpoint of (ba1,ba2).

The following triplets (K ,b Pb,Nb) are they finite elements? In the favorable case, give the nodal basis ofPb.

(a)Pb =P1,Nb ={N1, N2, N3} whereNi(v) =v(bai), i= 1,2,3.

(b)Pb =P1,Nb ={N1, N2, N3}where Ni(v) =v(mbi), i= 1,2,3.

(c)Pb=P2,Nb ={N1, N2, N3, N4, N5, N6}whereNi(v) =v(bai), i= 1,2,3 andNi(v) = v(mbi−3), i= 4,5,6.

(d)Pb =P0,Nb ={N1} whereN1(v) = R

Kbv(bx ,y)b dx db yb

|K|b .

(e)Pb=P2,Nb ={N1, N2, N3, N4, N5, N6}whereNi(v) =v(bai), i= 1,2,3 andNi(v) =

∇v(mbi3)·mbi3bai3, i= 4,5,6, with ∇the gradient operator, mbi3bai3 the vector whose ends are mbi−3,bai−3 fori= 4,5,6.

Leta1,a2,a3be points inR2 andK the triangle whose vertices are the points whose vertices 1

(2)

area1,a2,a3: K ={a1, a2, a3}. In each above example where (K ,b Pb,Nb) is a finite element, give a finite element (K ,P,N) affine equivalent to (K ,b Pb,Nb).

Exercise 3.

Let Qk=X

j

cjpj(x)qj(y) such that pj , qj are polynomials of degrees ≤k

.

Let Kb be the squarre whose vertices are the points ba1 = (0,0), ba2 = (1,0) andba3 = (0,1), i.e. Kb ={(0,0),(1,0),(1,1),(0,1)}. The midpoints of the edges of this squarre are denoted by bai, i= 5,6,7,8, according toba5 is the midpoint of the edge (ba1,ba2),ba6 is the midpoint of (ba2,ba3),ba7 is the midpoint of the edge (ba3,ba4),ba8 is the midpoint of (ba4,ba1). The center of the squarre is denoted by ba9.

(a) Let Pb = Q1, Nb = {N1, ... , N4} where Ni(v) = v(bai), i = 1,2,3,4. Show that (K ,b Pb,Nb) is a finite element.

(b) Let Pb = Q2, Nb = {N1, ... , N9} where Ni(v) = v(bai), i = 1, .... ,9. Show that (K ,b Pb,Nb) is a finite element.

Exercise 4.

(a) Given a finite element (K,P,N), let the set {φi : 1 ≤ i≤ k} ∩ P be the basis dual of N. Ifv is a function for which allNi∈ N,i= 1, ..., k, are defined, then we defined the local interpolant by

IKv= Xk

i=1

Ni(v)φi. Prove that the local interpolant is linear.

(b) Let T1 be the triangle whose vertices are a1 = (0,0), a2 = (1,0) and a3 = (0,1), T2 be the triangle whose vertices are a2 = (1,0), a4 = (1,1) and a3 = (0,1). Following finite elements are considered:

(T1,P1,N1) with N1 ={N1, N2, N3}where Ni(v) =v(ai), i= 1,2,3 ;

(T2,P1,N2) with N2 ={N4, N5, N6}where N4(v) =v(a2), N5(v) =v(a4), N6(v) =v(a3).

Finally let f and g be functions inR2: f(x, y) =exy andg(x, y) = sin (π(x+y)/2).

Compute the local interpolations IKf and IKgwhere K=T1, T2. Exercise 5.

Let Pkn denote the space of polynomials of degree ≤ k innvariables.

Prove that dimPkn =

n+k k

, where the latter is the binomial coefficient.

2

Références

Documents relatifs

Which rules of system LK are reversible?. Exercice

Compute the arithmetic complexity (in terms of number of multiplications as a function of n) of the algorithm obtained by using this method (suppose first that n is a power of 3)

2 This naive algorithm can be improved and it is possible to obtain a word complexity in O(n) (A. Weilert 2000) using a divide and conquer approach... Show how to find such a

Let us see here some illustrations of the algorithm (seen in course) which gives the factorization of a polynomial over a number field.. For this, if you are lazy or tired, you

These numbers appear also in Gauss theorem on the constructibility (with rule and compas) of regular polygones: a regular polygone with n vertices is constructible if and only if n is

Compute the class group, the regulator and a system of fundamental units for the number fields defined by the

However, no error estimates for the finite element approximations and theoretical convergence analysis of the method of successive approximation were given.. In this paper we show

In this paper we analyze the three-dimensional scheme where the velocities are approximated by piecewise tnlmear functions The analysis proceeds following closely the lmes of [7]