• Keine Ergebnisse gefunden

Scientific Computing II

N/A
N/A
Protected

Academic year: 2021

Aktie "Scientific Computing II"

Copied!
1
0
0

Wird geladen.... (Jetzt Volltext ansehen)

Volltext

(1)

Scientific Computing II

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

Christopher Kacwin

Sheet 7

Submission onThursday, 28.6.18.

Exercise 1. (Helmholtz equation)

Let Ω = [0,1] and consider the Helmholtz equation

−u00=λu in Ω u(0) =u(1) = 0

forλ∈R.

a) Let (u, λ) be a strong solution. Show thatu∈C(Ω).

b) Let (u, λ), (v, µ) be Eigenpairs with λ6=µ. Show that (u, v)L2(Ω) = 0.

c) Compute all Eigenpairs (u, λ).

(6 points) Exercise 2. (Laplacian)

Let Ω ⊂ Rn be an open and bounded domain and consider the Laplacian as a linear operator acting onH01(Ω). Show that the Eigenfunctions (φi, λi)i=1,...,∞ of (−∆) on are an orthogonal basis ofH01(Ω). Show that the Eigenvalues are bounded from below by a constantc >0.

(4 points) Exercise 3. (ONB expansion)

Let Ω⊂Rn be an open and bounded domain and T >0∈R. Let L:H01(Ω)−→L2(Ω) be a linear, continuous, elliptic operator. Let (φi, λi)i=1,...,∞ be an orthonormal basis of L2(Ω) of Eigenpairs toL. Consider the parabolic equation

tu+Lu=f in Ω×[0, T] u(·,0) =u0 in Ω

with datau0∈L2(Ω), f ∈L2(Ω×[0, T]). Show that a solution can be written as

u(x, t) =

X

i=1

e−λit(u0, φi)L2(Ω)φi(x) +

X

i=1

ˆ t

0

e−λi(t−s)(f(·, s), φi)L2(Ω)ds φi(x). (6 points)

1

Referenzen

ÄHNLICHE DOKUMENTE

(14 points) The programming exercise should be handed in either before/after the exercise class on 21.6.18 (bring your own laptop!) or in the HRZ-CIP-Pool, after making an appoint-

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