Casa seminar Rosenbrock (AMF) methods November 12 2008, Marly van - - PowerPoint PPT Presentation

casa seminar
SMART_READER_LITE
LIVE PREVIEW

Casa seminar Rosenbrock (AMF) methods November 12 2008, Marly van - - PowerPoint PPT Presentation

Casa seminar Rosenbrock (AMF) methods November 12 2008, Marly van Geel Where innovation starts Contents 2/25 Introduction 3 Runge-Kutta methods 4 Rosenbrock Methods 6 Model problem 11 Numerical results 13 Conclusion 24 / department


slide-1
SLIDE 1

Where innovation starts

Casa seminar

Rosenbrock (AMF) methods

November 12 2008, Marly van Geel

slide-2
SLIDE 2

2/25

/ department of mathematics and computer science

November 12th 2008

Introduction 3 Runge-Kutta methods 4 Rosenbrock Methods 6 Model problem 11 Numerical results 13 Conclusion 24

Contents

slide-3
SLIDE 3

3/25

/ department of mathematics and computer science

November 12th 2008

ut + (au)x = (dux)x + f(u),

Introduction

slide-4
SLIDE 4

4/25

/ department of mathematics and computer science

November 12th 2008

Runge-Kutta methods: We have dw

dt = F(w).            wn+1 = wn +

s

  • i=1

biki ki = τF

  • wn +

s

  • j=1

αijkj

  • i = 1, . . . , s

Explicit if αij = 0 for j ≥ i. Otherwise implicit.

Runge-Kutta methods

slide-5
SLIDE 5

5/25

/ department of mathematics and computer science

November 12th 2008

This method is

           wn+1 = wn +

s

  • i=1

biki ki = τF

  • wn +

i

  • j=1

αijkj

  • i = 1, . . . , s

Newton iteration to calculate ki

Diagonal Implicit Runge-Kutta

slide-6
SLIDE 6

6/25

/ department of mathematics and computer science

November 12th 2008

Rosenbrock methods are Runge-Kutta type methods.

           wn+1 = wn +

s

  • i=1

biki ki = τF

  • wn +

i−1

  • j=1

αijkj

  • + τJ

i

  • j=1

γijkj i = 1, . . . , s

With J = F ′(wn). Jacobian matrix in the integration formula.

Rosenbrock Methods

slide-7
SLIDE 7

7/25

/ department of mathematics and computer science

November 12th 2008

A-stability or L-stability

  • rder p order conditions

1 b1 + b2 + b3 = 1 2 b2d2 + b3d3 + b4d4 = 1

2 − γ

3 b2c2

2 + b3c2 3 + b4c2 4 = 1 3

b3β32d2 + b4(β42d2 + β43d3) = 1

6 − γ + γ2

where

βij = αij + γij, ci =

i−1

  • j=1

αij, di =

i−1

  • j=1

βij.

Rosenbrock Methods (II)

slide-8
SLIDE 8

8/25

/ department of mathematics and computer science

November 12th 2008

The 1-stage method wn+1 = wn + k1, k1 = τF(wn) + γτJk1.

Stability function

R(z) = 1 + (1 − γ)z 1 − γz

Order 2 if γ = 1

2.

A-stability if γ ≥ 1

2 and L-stability if γ = 1.

Rosenbrock Methods (III)

slide-9
SLIDE 9

9/25

/ department of mathematics and computer science

November 12th 2008

The 2-stage method

We have

wn+1 = wn + b1k1 + b2k2, k1 = τF(wn) + γτJk1 k2 = τF(wn + α21k1) + γ21τJk1 + γτJk2

with

b1 = 1 − b2, α21 = 1 2b2 , γ21 = − γ b2

Stability function

R(z) = 1 + (1 − 2γ)z + (1

2 − 2γ + γ2)z2

(1 − γz)2

A-stability if γ ≥ 1

4 and L-stability if γ = 1 ± 1 2

√ 2.

Rosenbrock Methods (IV)

slide-10
SLIDE 10

10/25

/ department of mathematics and computer science

November 12th 2008

Splitting based on special approximations of the Jacobian matrix.

w′(t) = F(w(t)) = F1(w(t)) + · · · + Fs(w(t)) One-stage method wn+1 = wn + ki, ki = τ(I − γτJ)−1F(wn) wn+1 = wn + τB−1F(wn), B = I − γτJ, J = F ′(wn).

Replace B = I − γτJ by

˜ B = (I − γτJ1)(I − γτJ2) · · · (I − γτJs)

Rosenbrock AMF methods

slide-11
SLIDE 11

11/25

/ department of mathematics and computer science

November 12th 2008

Model problem ut + aux = εuxx + λu(1 − u), 0 < x < 1, t > 0 ux(0, t) = 0, t > 0 u(1, t) = (1 + sin(wt)/2, t > 0 u(x, 0) = v(x), 0 < x < 1.

Write problem as ordinary differential equation.

Model problem

slide-12
SLIDE 12

12/25

/ department of mathematics and computer science

November 12th 2008

The ODE becomes

ut = ε h2       −2 2 1 −2 1

... ... ...

1 −2 1 1 −2       u − a 2h       −1 1

... ... ...

−1 1 −1 0       u + ε h2 − a 2h

    

. . .

1       1 + sin(wt) 2

  • + λ(1 − uj)uj

= (Ad − Aa)u + b + f = F(u)

Now apply Rosenbrock (AMF) methods.

Model problem

slide-13
SLIDE 13

13/25

/ department of mathematics and computer science

November 12th 2008

Rosenbrock methods

The 1-stage method

wn+1 = wn + k1, k1 = τF(wn) + γτJk1. J is the Jacobian matrix F ′(wn). a = −1, ε = 0.01, λ = 1, frequency = 10, Nx = 100, Nt = 100.

Unstable γ = 0.1 Unstable γ = 0.2.

Numerical results

slide-14
SLIDE 14

14/25

/ department of mathematics and computer science

November 12th 2008

Stable γ = 0.4 Stable γ = 0.6. Stable γ = 1.2 Stable γ = 2.0.

Numerical results

slide-15
SLIDE 15

15/25

/ department of mathematics and computer science

November 12th 2008

a = −1, ε = 1, λ = 1, frequency = 10, Nx = 100, Nt = 100.

Unstable γ = 0.4 Stable γ = 0.5.

Numerical results

slide-16
SLIDE 16

16/25

/ department of mathematics and computer science

November 12th 2008

The 2-stage method

wn+1 = wn + b1k1 + b2k2, k1 = τF(wn) + γτJk1 k2 = τF(wn + α21k1) + γ21τJk1 + γτJk2

with

b1 = 1 − b2, α21 = 1 2b2 , γ21 = − γ b2

Numerical results

slide-17
SLIDE 17

17/25

/ department of mathematics and computer science

November 12th 2008

a = −1, ε = 0.01, λ = 1, frequency = 10, b2 = 0.4, Nx = 100, Nt = 100.

Unstable γ = 0.1 Stable γ = 0.2.

Numerical results

slide-18
SLIDE 18

18/25

/ department of mathematics and computer science

November 12th 2008

Stable γ = 0.3 Stable γ = 0.5. Stable γ = 1.0 Stable γ = 1.5.

Numerical results

slide-19
SLIDE 19

19/25

/ department of mathematics and computer science

November 12th 2008

a = −1, ε = 1, λ = 1, frequency = 10, b2 = 0.4, Nx = 100, Nt = 100.

Unstable γ = 0.2 Stable γ = 0.3.

Numerical results

slide-20
SLIDE 20

20/25

/ department of mathematics and computer science

November 12th 2008

Rosenbrock AMF methods

One-stage method

wn+1 = wn + τB−1F(wn), B = I − γτJ, J = F ′(wn).

Replace B = I − γτJ by

˜ B = (I − γτJ1)(I − γτJ2) · · · (I − γτJs)

Approximation is

˜ B = (I − γτA)(I − γτf ′) = B + (γτ)2Af ′ = B + O(τ 2)

Numerical results

slide-21
SLIDE 21

21/25

/ department of mathematics and computer science

November 12th 2008

a = −1, ε = 0.01, λ = 1, frequency = 10, b2 = 0.4, Nx = 100, Nt = 100.

Unstable γ = 0.1 Unstable γ = 0.2.

Numerical results

slide-22
SLIDE 22

22/25

/ department of mathematics and computer science

November 12th 2008

Stable γ = 0.3 Stable γ = 0.4. Stable γ = 0.6 Stable γ = 1.2.

Numerical results

slide-23
SLIDE 23

23/25

/ department of mathematics and computer science

November 12th 2008

a = −1, ε = 1, λ = 1, frequency = 10, b2 = 0.4, Nx = 100, Nt = 100. ε = 1, Unstable γ = 0.4

Stable γ = 0.5.

Numerical results

slide-24
SLIDE 24

24/25

/ department of mathematics and computer science

November 12th 2008

Rosenbrock 1-stage method

A-Stability when γ ≥ 1

2.

Rosenbrock 2-stage method

A-Stability when γ ≥ 1

4.

Rosenbrock AMF method

A-Stability when γ ≥ 1

2.

Conclusion

slide-25
SLIDE 25

25/25

/ department of mathematics and computer science

November 12th 2008

Questions?

Questions