• Keine Ergebnisse gefunden

Scientific Computing II

N/A
N/A
Protected

Academic year: 2021

Aktie "Scientific Computing II"

Copied!
2
0
0

Wird geladen.... (Jetzt Volltext ansehen)

Volltext

(1)

Scientific Computing II

Summer term 2018 Priv.-Doz. Dr. Christian Rieger

Christopher Kacwin

Sheet 1

Submission onThursday, 26.4.18.

Exercise 1. (bilinear elements)

Consider the unit square Ω = [0,1]2 ⊂ R2. We call a continuous function f: Ω → R affine bilinear if f(·, y) is affine linear for all y ∈ Ω and f(x,·) is affine linear for all x∈Ω.

a) Let Q(Ω) be the space of affine bilinear functions on Ω. Show that Q(Ω) has dimension 4, and find a basis which is nodal with respect to the corners of Ω.

Letn∈N. We defineai =i/nfori= 1, . . . , n and decompose Ω into a union of squares Ωij ={(x, y)>∈Ω|ai−1 ≤x≤ai, aj−1 ≤y≤aj} ⊂Ω

fori, j= 1, . . . , n.

b) Find the dimension of

V ={f ∈ C(Ω)|f|ij ∈Q(Ωij) for i, j= 1, . . . , n}

and determine whether a nodal basis with respect to the gridpoints (ai, aj)>,i, j= 0, . . . , n exists.

(4 points) Exercise 2. (stiffness- and mass matrix entries)

For given n, i, j∈N, consider the space Q(Ωij) given as in Exercise 1b). Let φ1, . . . , φ4

be the nodal basis ofQ(Ωij). ComputeR

ijφk(x)φl(x) dxand R

ij∇φk(x)∇φl(x) dxfor k, l= 1. . . ,4.

(4 points) Exercise 3. (Galerkin approximation)

Let Ω = [0,1]2 and consider the problem:

Find u∈H01(Ω) such that a(u, v) :=

Z

∇u(x)∇v(x) dx+ Z

u(x)v(x) dx= Z

v(x) dx=:F(v) for all v∈H01(Ω).

a) Let n ∈ N and V be the space defined in Exercise 1b). Define V0 = {v ∈ V | v = 0 on ∂Ω} and consider the problem: Find u ∈ V0 such that a(u, v) = F(v) for all v∈V0. Reformulate this problem as a linear system of equations using the Galerkin Ansatz.

b) Solve this linear system explicitely forn= 3.

1

(2)

(4 points) Exercise 4. (oszillating coefficient)

LetI = [0,1] and consider the ODE

−[a(x)u0(x)]0 = 1 inI , u(0) =u(1) = 0.

Fora(x) = (2 + sin(x/))−1, find a solution to the stated ODE and compute the corre- sponding effective coefficient

Z 1 0

a(x)−1dx −1

.

(4 points)

2

Referenzen

ÄHNLICHE DOKUMENTE

Summer term 2018 Priv.-Doz..

The goal of this exercise sheet is to resolve singular initial conditions for parabolic equations, using a geometrically refined

Let B e n be the transformed version of the Bernoulli polynomial B n such that the domain is [0, 2π] instead of

As usual, you find the tasks in the accompanying note- book on the lecture’s website.

a) A greedy algorithm is an algorithm that tries to solve an optimization problem by making a locally optimal choice at each stage. Show that this is indeed true. Hint: Use G2.. c)

Exercise sheet 11 To be handed in on Thursday, 07.06.2016. Application of PCA

Prove the following simplyfied version of Lemma 2.16?. How should the algorithm be modified in

Vergabe von Terminen f¨ ur die m¨ undliche Pr¨ ufung: Termine f¨ ur die m¨ undliche Pr¨ ufung werden in der Vorlesung am Dienstag, 19.07.2016, vergeben. Appointments for oral