• Keine Ergebnisse gefunden

Scientific Computing I

N/A
N/A
Protected

Academic year: 2021

Aktie "Scientific Computing I"

Copied!
1
0
0

Wird geladen.... (Jetzt Volltext ansehen)

Volltext

(1)

Scientific Computing I

Wintersemester 2018/2019 Prof. Dr. Carsten Burstedde

Jose A. Fonseca

Exercise Sheet 12. Due date: Tue, 22.1.2019.

The points you may obtain from this problem sheet are bonus points

Exercise 1. (6 Points)

Let A and B be M-matrices with B ≥ A (component wise). Prove that 0 ≤ B

−1

≤ A

−1

and kB

−1

k

≤ kA

−1

k

.

Exercise 2. (6 Points)

Compute the incomplete LU factorization with zero fill-in, ILU(0) of the following matrix

4 −1 −1 0

−1 4 0 −1

−1 0 4 −1

0 −1 −1 4

. (1)

Exercise 3. (6 Points)

Let

u(x) :=

 

  1

2 x

2

+ x + 1 for x < 0,

− 1

2 x

2

+ x + 1 for x ≥ 0.

(2)

Does u have a second order derivative in the strong or the weak sense? Compute it according to your answer.

Exercise 4. (2+4 Points)

Let Ω ∈ R

d

be a bounded Lipschitz domain, f ∈ L

2

(Ω) and g ∈ L

2

(∂Ω). For β ≥ 0 and ν ∈ R

d

consider the Poisson problem

−∆u = f in Ω, (3a)

βu + ν

>

∇u = g on ∂Ω. (3b)

a) Let V := H

1

(Ω)/ R , that is, V consists of classes of H

1

(Ω) functions differing only by an additive constant. Prove that V with (u, v)

V

:= (∇u, ∇v)

0

is a Hilbert space and that in the case β = 0 the problem (3) as a unique solution in V .

b) If β > 0, find a suitable Hilbert space V and a bilinear form a(·, ·) : V × V → R such that (3) has a unique solution when posed in this space.

1

Referenzen

ÄHNLICHE DOKUMENTE

Please submit your solutions on October 31, 2019, in the lecture break.. Remark: Always justify

Differential Geometric Aspects in Image

i) The positive level set corresponding to distance d can be geometrically con- structed by drawing from each point p of the curve, a segment of length d in the outwards

Differential Geometric Aspects in Image

Given a database schema based on the CREATE TABLE statements from Exercise 0 and using the SQL syntax introduced in the lecture, provide INSERT, UPDATE, and DELETE statements for the

f) What are the candidate keys for R with respect to F? Explain your answer. Provide intermediate results for each of the following steps and explain how you reached them:. 1)

1) Give an example of a scenario where views may help with solving privacy issues in your database. 2) Provide an updatable view (you might need to adjust your scenario) that

Based on the database schema build from your CREATE TABLE statements from Exercise 1 b), provide SQL CREATE VIEW statements for the following tasks:.. a) Create the