• Keine Ergebnisse gefunden

Exercise sheet 4 To be handed in on Thursday, 12.05.2016

N/A
N/A
Protected

Academic year: 2021

Aktie "Exercise sheet 4 To be handed in on Thursday, 12.05.2016 "

Copied!
2
0
0

Wird geladen.... (Jetzt Volltext ansehen)

Volltext

(1)

Wissenschaftliches Rechnen II/Scientific Computing II

Sommersemester 2016 Prof. Dr. Jochen Garcke Dipl.-Math. Sebastian Mayer

Exercise sheet 4 To be handed in on Thursday, 12.05.2016

1 Group exercises

G 1. Let k : Ω

2

→ R be positive semi-definite. Provide details for the proof of Theorem 34. Concretely,

a) Recall H = span{k(x, ·) | x ∈ Ω} with inner product h·, ·i

H

given by hf, g,

i

H =

n

X

i=1 m

X

j=

a

i

b

j

k(x

i

, y

j

) for f = P

n

i=1

a

i

k(x

i

, ·), g = P

m

j=1

b

j

K(y

j

, ·). Let (h

n

)

n∈N

, h

n

∈ H, be a Cauchy sequence. Show that the pointwise limit h(t) := lim

n→∞

h

n

(t) exists.

b) Let N

k

be the set of pointwise limits of arbitrary Cauchy sequences in H. For g, f ∈ N

k

, let

hf, gi

k

:= lim

n→∞

hf

n

, g

n

i

H

.

Verify that hf, f i = 0 if and only if f = 0, that is, h·, ·i is indeed a scalar product.

c) Show that N

k

is complete with respect to the norm induced by h·, ·i

k

. G 2. (Interpolation and discrete Fourier transform)

For even n ∈ N , consider again the space of complex-valued trigonometric polynomials H

n

introduced in Sheet 2, Exercise G2. Further consider the sampling points

x

k

= 2πk

n ∈ [−π, π], k = −n/2, . . . , 0, . . . , n/2 − 1.

a) Consider the subspace H e

n

= {f ∈ H

n

: hf, e

0

i = 0}, which has the kernel D e

n

(x, y) = 2 P

n

k=1

cos(k(x − y)). Show that the matrix D e

n

:=

2n1

( D e

n

(x

j

, x

l

))

j,l=−n/2,...,n/2−1

is the identity, that is,

D e

n

(2πj/n, 2πl/n) =

( 2n : j = l 0 : j 6= l.

Hint: Use the following fact about geometric series: for r 6= 1, we have P

n

k=0

r

k

=

1−rn+1 1−r

.

b) Assume to be given observations (x

k

, y

k

)

k=−n/2,...,n/2−1

. Determine the polynomial g

n

∈ H e

n

which solves the interpolation problem

g

n

(x

i

) = y

i

, i = −n/2, . . . , n/2 − 1.

Determine the Fourier coefficients of g

n

.

Remark: The Fourier coefficients of g

n

are the discrete Fourier transform of the

vector (y

k

)

k=−n/2,...,n/2−1

.

(2)

2 Homework

H 1. (Sums of kernel spaces)

Let k

1

, k

2

: Ω

2

→ R be two positive semi-definite mappings. Consider k = k

1

+ k

2

given by

k(x, y) := k

1

(x, y) + k

2

(x, y).

Show the native space N

k

is given by

N

k

= {f

1

+ f

2

| f

1

∈ N

k1

, f

2

∈ N

k2

} and the norm fufills

kf k

2k

= min{kf

1

k

2k

1

+ kf

2

k

2k

2

: f = f

1

+ f

2

, f

i

∈ N

ki

}.

Hint: Consider the product space H = N

k1

× N

k2

with norm given by k(f

1

, f

2

)k

2H

= kf

1

k

2k

1

+ kf

2

k

2k

2

and find a suitable closed subspace.

(10 Punkte) H 2. (Kernel smoothing spline)

For even n ∈ N , let H

n

be the space of trigonometric polynomials as introduced in Sheet 2, G2. Let x

−n/2

, . . . , x

n/2−1

be the sampling points given in G2. Further, let f : [−π, π] → C be a 2π-periodic function. You are given noisy observations

y

i

= f (x

i

) +

i

, i = −n/2, . . . , n/2 − 1.

The goal is to solve the following kernel smoothing spline optimization problem explicitly:

fλ

min

∈Hn

1 2n

n/2

X

i=−n/2

y

i

− f

λ

(x

i

)

2

+ λ 2π

Z

π

−π

(f

λ(m)

(x))

2

dx. (1) Proceed as follows:

a) Determine the trigonometric polynomial f

noisy

∈ H

n

which solves the interpolation problem

f

noisy

= y

i

, i = −n/2, . . . , n/2 − 1.

b) Use a) to reformulate the optimization problem (1) in terms of the Fourier coefficients of f

noisy

and f

λ

. Determine the Fourier coefficients of the trigonometric polynomial f

λ

∈ H

n

which minimizes (1).

c) Compare the Fourier coefficients of f

noisy

and f

λ

and interpret the difference between f

noisy

and f

λ

.

(10 Punkte)

2

Referenzen

ÄHNLICHE DOKUMENTE

Summer term 2018 Priv.-Doz..

The goal of this exercise sheet is to resolve singular initial conditions for parabolic equations, using a geometrically refined

Furthermore assume the corresponding value function as continuous in Ω.. assume the extrema to be a

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.

Give an alternative proof of Lemma 46 based on the representer

(Worst-case integration error in kernel spaces). Consider the same setting as

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)