• Keine Ergebnisse gefunden

Winter 2016 / 17

N/A
N/A
Protected

Academic year: 2021

Aktie "Winter 2016 / 17"

Copied!
2
0
0

Wird geladen.... (Jetzt Volltext ansehen)

Volltext

(1)

Exercises to Wissenschaftliches Rechnen I/Scientific Computing I (V3E1/F4E1)

Winter 2016 / 17

Prof. Dr. Martin Rumpf

Alexander Effland — Stefanie Heyden — Stefan Simon — Sascha Tölkes

Problem sheet 2

Please hand in the solutions in the lecture on Tuesday November 8 !

Remark: Exercise 4 was also contained in sheet 1. It is suggested to hand in the solution of this exercise with the other solutions of this sheet on November 8 !

Exercise 4 4 Points

Let a : ( 0, 1 ) → R be the following function:

a ( x ) =

c 1 if x ∈ ( 0, b 1 ) , c 2 if x ∈ [ b 1 , b 2 ) , c 3 if x ∈ [ b 2 , 1 ) ,

for c 1 , c 2 , c 3R and 0 < b 1 < b 2 < 1. Determine a weak solution u ∈ H 1,2 ( 0, 1 ) of the boundary value problem

−( a ( x ) u 0 ( x )) 0 = 0 ∀ x ∈ ( 0, 1 ) , u ( 0 ) = 0 ,

u ( 1 ) = 1 .

Exercise 5 4 Points

Consider the function

u n ∈ H 1,2 (( 0, 1 ) , R ) , x 7→ 1 4 q

1 4 + n 1

2

− ( x − 1 2 ) 2 q

( x − 1 2 ) 2 + n 1

2

.

Show that u n converges w.r.t. the H 1,2 (( 0, 1 )) -norm to u ∈ H 1,2 (( 0, 1 ) , R ) , x 7→ 1

2 −

x − 1 2 .

Recall that for any f ∈ H 1,2 (( 0, 1 )) the H 1,2 (( 0, 1 )) -norm is defined as k f k 2 1,2 =

Z 1

0

( f ( x )) 2 dx + Z 1

0

( f 0 ( x )) 2 dx .

(2)

Exercise 6 4 Points Let Ω ⊂ R 2 be a open and bounded domain with smooth boundary. Let Γ ⊂ be an injective smooth curve that separates Ω into two non-empty and connected sets Ω + and Ω . Let f ∈ C 1 ( ) be such that f

+

∈ C ( + ) and f

∈ C ( ) . Show that f is twice weakly differentiable.

Exercise 7 4 Points

Let Ω ⊂ R n be a bounded domain with Lipschitz boundary and a ij , b i , b ∈ L ( ) with

∑ n i,j = 1

a i,j ξ i ξ j ≥ c 0 | ξ | 2

for all ξR n with c 0 > 0. Verify that the following operators are bounded and coercive bilinear forms on H 0 1,2 ( ) :

i) L 1 ( u, v ) : = R

Ω ∑ i,j a i,j i u∂ j v + buv dx under the assumption c 0 > k b k C P ( ) . ii) L 2 ( u, v ) : = R

Ω ∑ i,j a i,j i u∂ j v + i b i i uv dx

under the assumption c 0 > 1 2 ( i k b i k ( 1 + C P ( ))) . Hints:

Use the Poincaré inequality k u k 2 2 ≤ C P ( )k∇ u k 2 2 with a constant C p ( ) depending solely on Ω.

For ii) use i u · u ≤ 1 2 ( i u ) 2 + 1 2 u 2 .

Referenzen

ÄHNLICHE DOKUMENTE

Alexander Effland — Stefanie Heyden — Stefan Simon — Sascha Tölkes. Problem

Think about possible refinement patterns and write a pseudo code algorithm to refine T with a

In this programming task, you will implement an adaptive grid refinement algorithm using the longest edge bisection method.. A common way to implement refinement algorithms on

Furthermore, let V h be the space of piece-wise affine and continuous finite

Derive an explicit formula for the total number of degrees of freedom of V h in terms of m and n.. Hint: Follow the proof of

Your program output should be two tables containing the number of elements and k u − u h k in the two norms for adaptive and uniform refinement, respectively.. The code that needs to

To this end, derive the saddle point formulation and show ellipticity of a suitable bilinear form and prove an inf-sup-condition. Exercise 32

Exercises to Wissenschaftliches Rechnen I/Scientific Computing I (V3E1/F4E1). Winter 2016