• Keine Ergebnisse gefunden

of PDEs

N/A
N/A
Protected

Academic year: 2021

Aktie "of PDEs"

Copied!
2
0
0

Wird geladen.... (Jetzt Volltext ansehen)

Volltext

(1)

Numerical Algorithms for Visual Computing II

Michael Breuß and Pascal Peter Released: 22.10.2010

Assigned to: Tutorial at 29.10.2010

Assignment 1

(4 Exercises)

– Basic Basics

TM

of PDEs

Exercise No. 1 – Typesetting of PDEs (4×2=8 points)

Consider a second-order PDE in two variables as an equation of the form Auxx+Buxy+Cuyy+Dux+Euy+F u = G,

whereA, B, C, D, E, F, Gcan be constants or given functions ofxandy. It can be shown that parabolic equations satisfy the propertyB2−4AC = 0, hyperbolic equa- tionsB2−4AC >0and elliptic equationsB2−4AC <0.

Categorise the following differential equations with respect to the order, linearity or non-linearity with variable coefficients or not, and the type of the PDE:

(a) ut=uxx

(b) utt=uxx

(c) uxx+uyy= 0 (d) xux+yuy+u2= 0

Exercise No. 2 – Tayloring schemes (4+4=8 points) Compute

• the Taylor expansion,

• the local truncation error

for an approximation of the second derivative approximation ofu, i.e.u00(x), by ma- king use only of the mesh points(j+ 2)∆x,j∆xand(j−2)∆x.

Exercise No. 3 – How big is this

O

? (4×2=8 points)

Leth∈Randp, q∈N. Prove validity / non-validity of the following assertions, also assumingp < q:

O(hp) +O(hq) = O(hp), O(hp)· O(hq) = O(hp+q), O(hp)− O(hp) = O(hp),

1

O(hp) 6= O

1

hp

.

1

(2)

Exercise No. 4 – Resizing

O

(3×2=6 points) Let the following functions be given, withh∈Rsmall:

a(h) := h+h2+ 1020h3

b1(h) := h+h2+ 1020h3+ 10−100h4 b2(h) := −h−h2+ 1020h3+ 10−100h4.

Write down the results of the following operations in terms ofO(hk),k ∈ N. Give each time a reason for your answer.

(a) a(h)·b1(h) (b) b1(h)−a(h) (c) b1(h) +b2(h)

2

Referenzen

ÄHNLICHE DOKUMENTE

Under certain continuity assumptions, we then discuss the existence of L´ evy processes under convex or sublinear expectations using a nonlinear version of Kolmogorov’s theorem..

Using the results from the previous tutorial, show that the Gibbard-Satterthwaite theorem holds if there are at least two agents.. Hint: Use an induction argument and in particular

bestätigten in ihren beschlüssen erneut, dass die db regio ag im hinblick auf den betrieb der Wartungseinrichtungen (auch) ein eiu ist, das nbs aufzustellen hat. die db regio

Michael Breuß and Pascal Peter Released: 29.10.2010.. Assigned to: Tutorial

(You don’t need to code the method to give an answer, however, it may help if you don’t have a clue.) (3x2=6

Determine the weight α needed in order to have a consistent discretisation, and compute for this case the local truncation error. For discretising the Poisson equation, is this a

Let the random variables X n be independent and take the values ±1 with equal probability

That is, they define what the names of elements and attributes are, what order they can appear, where they can appear, and what the spelling rules for attribute values and