• Keine Ergebnisse gefunden

The goal of this exercise is to model a one-dimensional parabolic optimal control problem, discretize it and derive the corresponding Lagrange formulation.

N/A
N/A
Protected

Academic year: 2021

Aktie "The goal of this exercise is to model a one-dimensional parabolic optimal control problem, discretize it and derive the corresponding Lagrange formulation."

Copied!
2
0
0

Wird geladen.... (Jetzt Volltext ansehen)

Volltext

(1)

Scientific Computing 2

Summer term 2017 Prof. Dr. Ira Neitzel Christopher Kacwin

Sheet 10 Submission on Thursday, 20.7.2017.

Exercise 1. (optimal control)

The goal of this exercise is to model a one-dimensional parabolic optimal control problem, discretize it and derive the corresponding Lagrange formulation.

We consider a metal rod and its temperature distribution y : [0, 1] × [0, T ] −→ R

with initial condition y(·, 0) = y 0 . Additionally,we assume that we are able to control the heat flux of the metal rod at the end points. More precisely, we model y(x, t) to satisfy the partial differential equation

y t − y xx = f in [0, 1] × [0, T ]

−y x (0, ·) = u l in [0, T ] y x (1, ·) = u r in [0, T ]

y(·, 0) = y 0 in [0, 1]

with control parameters u l (t), u r (t) and additional enviromental influence f (x, t) (ma- terial conditions, additional heat source...). The goal is to influence this temperature distribution such that at time T , it will be close to the desired end state y d . This should be balanced with respect to the energy needed to advance from y 0 to y d . A cost functional to this problem can be stated as

J (y, u l , u r ) = 1

2 ky(·, T ) − y d k 2 L

2

[0,1] + α 2

ku l k 2 L

2

[0,T] + ku r k 2 L

2

[0,T ]

which we want to minimize with respect to some constraints on u l and u r .

As a first step, we want to do a spatial discretization of the partial differential equation.

We interpret y(x, t) = y(t)(x) = y(t) ∈ V (f likewise), where y is now a function of time mapping into a function space V , which consists of functions defined on [0, 1] (for instance C[0, 1]). The finite-dimensional subspace V h ⊂ V with basis {φ 1 , . . . , φ m } is used to approximate y(t) as

y(t) ≈

m

X

i=1

y i (t)φ i

with a time-dependent coefficient vector y(t) ∈ R m . a) Derive the spatially discretized weak formulation

My 0 (t) + Ky(t) = L(t) , t ∈ [0, T ] M y(0) = I .

Here, M ∈ R m×m is the mass matrix with M ij = R

φ i φ j , K ∈ R m×m is the stiffness matrix with K ij = R

(φ i ) x (φ j ) x , L(t) ∈ R m is the load vector with L i (t) = R f (t)φ i + φ i (0)u l (t) + φ i (1)u r (t), and I ∈ R m are the initial conditions with I i = R y 0 φ i .

1

(2)

This is a vector-valued first order ODE with matrix coefficients. We continue with a time discretization. Introducing the time steps t n = nT /N for n = 0, . . . , N with spacing τ = T /N we define y n = y(t n ), L n = L(t n ).

b) Using the implicit Euler scheme, derive the space-time discretized formulation (M + τ K) y n = My n−1 + τ L n , n = 1, . . . , N

My 0 = I .

State a block-matrix formulation that expresses Y = [y n ] N n=1 ∈ ( R m ) N as the solution of a linear system

AY = B .

c) State the discrete optimization problem using an appropiate discrete cost functio- nal and justify your choice in a few words. Introduce the Lagrangian formalism for this problem using discrete Lagrangian multipliers p n for n = 1, . . . , N (without restrictions for the control parameters).

d) State the KKT-conditions for the discrete optimization problem, with emphasis on the adjoint equations. Do these equations resemble a certain differential equation?

(20 points)

2

Referenzen

ÄHNLICHE DOKUMENTE

The red-green government of Chancellor Gerhard Schröder enforced promotion of electricity produced from renewable energy sources and the gradual restriction of

Karlsruher Institut f¨ ur Technologie Institut f”ur Theoretische Festk¨ orperphysik Ubungen zur Modernen Theoretischen Physik I ¨ SS14.. -

d) Conclude that the algorithm correctly implements safe broadcast!.. Check the standard deviation of the binomial distribution and make use of this connection.. c) Show that if f =

(Hint: Figure out a solution sorting two values and then plug it into a sorting network to get the general circuit!. You don’t have to (re)invent sorting networks, you may just point

We're finding, as we forward deploy, as we work together to put troops in a position where they can have a deterrence, that we've not done that, and perhaps that's a great role

• Self-Play: Suppose, instead of playing against a random opponent, the reinforcement learning algorithm described above played against itself, with both sides learning?. What do

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

I am especially indebted to three teachers and scholars, all lately of Columbia University: Sir George Sansom, under whom I was privileged to study and who first suggested the