• 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 8

Submission on Thursday, 5.7.18.

The goal of this exercise sheet is to resolve singular initial conditions for parabolic equations, using a geometrically refined time mesh. We consider the model problem from the lecture

u0(t) +Lu(t) =g(t), t∈I = (0,1) u(0) =u0

withL(X, X) an elliptic differential operator,u0 ∈X, andg∈L2(I, H) being analytic as a function in time. We discretize I with the partition Tn,σ ={Im}n+1m=1 with grading factor σ ∈(0,1) andn+ 1 time intervallsIm given by the nodes t0 = 0, tmn−m+1. The time steps ∆tm = tm−tm−1 satisfy ∆tm =λtm−1, λ= 1−σσ . Set γ = max{1, λ}.

Assign to every interval a polynomial approximation orderrm and assume regularity of the solutionu|Im ∈Hsm with smmrmm ∈(0,1).

Exercise 1. (sharper estimate away from the initial conditions) Fix an intervalIm,m≥2. Show that there exist constants C, d >0 s.t.

ku−ΠrIm

muk2L2(Im,X)≤Cσ(n−m+2)

(γd)m

(1−αm)1−αm (1 +αm)1+αm

rm

withC,donly depending onu0,g.

(10 points) Exercise 2. (exponential convergence)

Let u be the exact solution and U ∈ Vr(Tn,σ, X) the computed hp-DGFEM solution.

Show that there exists µ >0 s.t. forrm=bµmc,m= 1, . . . , n+ 1, one obtains ku−Uk2L2(I,X)≤Cexp(−bN12)

with constants C and bindependent of N = dimVr(Tn,σ, X).

You can use the following estimate for the first interval without proof:

ku−Uk2L2(I1,X)≤cσn, withc >0 independent ofn.

(10 points)

1

Referenzen

ÄHNLICHE DOKUMENTE

Summer term 2018 Priv.-Doz..

Additionally,we assume that we are able to control the heat flux of the metal rod at the end points... (10 points)

(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-

Summer term 2018 Priv.-Doz..

Additionally,we assume that we are able to control the heat flux of the metal rod at the end points.. The goal is to influence this temperature distribution such that at time T ,

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