• Keine Ergebnisse gefunden

Scientific Computing 2

N/A
N/A
Protected

Academic year: 2021

Aktie "Scientific Computing 2"

Copied!
1
0
0

Wird geladen.... (Jetzt Volltext ansehen)

Volltext

(1)

Scientific Computing 2

Summer term 2017 Prof. Dr. Ira Neitzel Christopher Kacwin

Sheet 9

Submission onThursday, 6.7.2017.

Exercise 1. (weak differentiability)

We consider the functionf: [−1,1]→R,f(x) =|x|.

a) Show thatf is weakly differentiable and compute its weak derivative.

b) Show thatf is not twice weakly differentiable.

(4 points) Exercise 2. (weak formulation for bilaplace)

Let Ω⊂Rnbe a regular domain. Forf ∈L2(Ω) consider the partial differential equation

∆(∆u) =f with boundary conditions

u = 0 on ∂Ω

νu = 0 on ∂Ω,

where∂ν is the directional derivative with respect to the normal vectorν on ∂Ω. Derive the weak formulation inH02(Ω) ={w∈H2(Ω)|w= 0 on∂Ω, ∂νw= 0 on∂Ω} for this PDE. (Hint: Use the Gauss divergence theorem / Green’s identities to do the integration by parts)

(6 points) Exercise 3. (higher regularity in 1D)

Let I = [a, b]⊂ R and f ∈ L2(I). Let u ∈H01(I) be the weak solution to the Poisson equation

−u00=f

with Dirichlet boundary conditions. Show that u belongs toH2(Ω).

(4 points) Exercise 4. (finite 2D element)

Let T ⊂R2 be the closed triangle with cornersa1 = (0,0)>,a2 = (1,0)>,a3 = (0,1)>. Furthermore, let{φ1, φ2, φ3}be the nodal basis to this triangle, i.e., fori= 1,2,3 one has that φi:T →R is a linear function which satisfies φi(aj) =δij forj = 1,2,3. Compute the local stiffness matrix K∈R3×3 with entries

Kij = Z

T

(∇φi)>∇φj.

(6 points)

1

Referenzen

ÄHNLICHE DOKUMENTE

b) triangle’s output includes two files .node and .ele that contain the list of nodes and elements in the mesh, respectively. Write a program that reads these files into memory.

If yes, what does this imply for existence and uniqueness of minima. Calculate the global minimum

Summer term 2017 Prof.. Ira Neitzel

We repeat this procedure until we arrive in a fixed point of this iteration?. Is it possible to find the solution of this optimization problem with the

• The solutions must be handed in directly before (very latest: at the beginning of) the exercise course on Friday, June 3rd, 2011, in lecture hall AH 2.. Alternatively you can

Term Rewriting Systems SS 11 Solution - Exercise Sheet 6

Two players alternate their turns, where the current one removes at least 1 and at most k matches from the board.. If the last match is removed, the current

Numerical Algorithms for Visual Computing III: Optimisation.. Michael Breuß and Kai Uwe Hagenburg