• Keine Ergebnisse gefunden

Please, bring your laptops along!

N/A
N/A
Protected

Academic year: 2022

Aktie "Please, bring your laptops along!"

Copied!
1
0
0

Wird geladen.... (Jetzt Volltext ansehen)

Volltext

(1)

Universit¨at T ¨ubingen T ¨ubingen, den 11.07.2018 Mathematisches Institut

Dr. Bal´azs Kov´acs

10. Exercise sheet for Numerik f ¨ur Differentialgleichungen auf Oberfl¨achen

Exercise 23. Consider the surface evolution described by v(x,t) = −H(x,t)νΓ(X)(x,t), d

dtX(p,t) =v(X(p,t),t), X(p, 0) =Id.

Using the identity−HνΓ(X) = Γ(X)xΓ(X), where xΓ(X) denotes the identity map on Γ(X), derive the weak formulation of the problem.

Discretise the problem using evolving surface finite elements and linearly implicit BDF methods, then implement the resulting scheme.

Solved together in the tutorial (Pr¨asenzaufgabe).

Please, bring your laptops along!

Discussed on the tutorials on 17.07.2018.

Referenzen

ÄHNLICHE DOKUMENTE

Applied Automata Theory (WS 2014/2015) Technische Universit¨ at Kaiserslautern.. Exercise

Applied Automata Theory (WS 2014/2015) Technische Universit¨ at Kaiserslautern. Exercise

Hint: the expression (BR) ∗ ( + B) represents the possible initial decks (b) Let L be an arbitrary language over a 1-letter alphabet.. We further call A top-down

Show that the model checking problem can be reduced (in the sense of Turing reduction) to the problem of whether in a given finite automaton, one given state can be reached..

Show that R is

Present a detailed definition of the automaton C, for which there is only an informal description in the lecture notes.

Hint: Construct 2 n words that lie in L n such that the following holds: After a fixed number of steps in the accepting runs, A has to enter distinct states for these words,

In the following exercises, by an A-tree for q, we mean a tree that is labeled with states by a run of A and in which the root node is labeled with q..