• Aucun résultat trouvé

Basic Concepts - Exercises (Chapter 0)

N/A
N/A
Protected

Academic year: 2022

Partager "Basic Concepts - Exercises (Chapter 0)"

Copied!
2
0
0

Texte intégral

(1)

Universit´e de Nice Sophia-Antipolis

Master MathMods - Finite Elements - 2008/2009 V. Dolean

Basic Concepts - Exercises (Chapter 0)

Exercise 1.

Find the ”stiffness” matrixK for piecewise linear basis functions. If the right hand side f is piecewise linear i.e.

f(x) =

n

X

i=1

fiφi(x)

determine the matrixM called ”mass” matrix such that :KU=MF.

Exercise 2.

Give the weak formulation for the two-point boundary value problem : −u00+u=f, x∈(0,1),

u(0) =u(1) = 0

Exercise 3.

Explain what is wrong in both variational and classical setting for the problem : −u00=f, x∈(0,1),

u0(0) =u0(1) = 0

that is explain in both contexts why this problem is not well-posed.

Exercise 4.

Show that piecewise quadratics have nodal basis consisting of values at nodes xi together with the midpoints 12(xi+xi+1). Calculate the stiffness matrix for these elements.

Exercise 5.

Leth= max1≤i≤n(xi−xi−1). Then,

ku−uIk ≤Chku00k,∀u∈V, whereC is independent of h and u.

Hint : Use first thehomogeneity argument, then show that :

Z 1 0

w(x)2dx≤c˜ Z 1

0

w0(x)2dx

by utilizing the fact that w(0) = 0. How small can you make ˜c if you use bothw(0) = 0 and w(1) = 0 ?

Exercise 6.

We denote a(u, v) = R1

0 u0(x)v0(x)dx and V = {v ∈ L2(0,1);a(v, v) < ∞, v(0) = 0}. Prove the followingcoercivity results :

kvk2+kv0k2≤Ca(v, v),∀v∈V Give a value forC.

1

(2)

Exercise 7.

Consider the difference method represented by :

− 2

hi+hi+1

Ui+1−Ui

hi+1 − Ui−Ui−1

hi

=f(xi).

Prove that ˜uS=P

iUiφi satisfies the following :

a(˜uS, v) =Q(f v),∀v∈S, a(u, v) = Z 1

0

u0(x)v0(x)dx

where S consists of piecewise linears andQ denotes the quadrature approximation based on the trapezoidal rule :

Q(w) =

n

X

i=0

hi+hi+1 2 w(xi).

We further defineh0 =hn+1= 0 for simplicity of notation.

Exercise 8.

LetQbe give by the previous exercise. Prove that :

Q(w)− Z 1

0

w(x)dx

≤Ch2

n

X

i=1

Z xi

xi−1

|w00(x)|dx

Hint : Observe that the trapezoidal rule is exact for piecewise linears and then use exercise 5.

Exercise 9.

LetuS the solution ofa(uS, v) = (f, v),∀v∈S, where S consists of piecewise linears and let

˜

uS be as in exercise 7. Prove that :

|a(uS−u˜S, v)| ≤Ch2(kf0k+kf00k)(kvk+kv0k) Hint : Apply exercise 8 and Schwarz’ inequality.

Exercise 10.

LetuS and ˜uS be like in the exercise 9. Prove that :

kuS−u˜SkE ≤Ch2(kf0k+kf00k) Hint : Apply exercise 9, pick v=uS−u˜S and apply exercise 6.

2

Références

Documents relatifs

Find the ”stiffness” matrix K for linear basis functions... Therefore the problem is

Which rules of system LK are reversible?. Exercice

• Study of possible alternative sources of Study of possible alternative sources of surface and groundwater supply, taking into consideration conjunctive use j. • Assessment

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