04.01.2015 Views

Introduction to Scientific Computing - Tutorial 13: Recapitulation

Introduction to Scientific Computing - Tutorial 13: Recapitulation

Introduction to Scientific Computing - Tutorial 13: Recapitulation

SHOW MORE
SHOW LESS

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

Previous HW- Runge-Kutta-Fehlberg method<br />

Let us observe the ODE of form:<br />

˙u = f (t, u(t)), u(t 0 ) = u 0<br />

and find the Taylor expansion of solution:<br />

p∑ u k<br />

U := u m+1 = u m +<br />

k! hk + O(h p+1 ).<br />

k=1<br />

The 2(3)-stage Runge–Kutta–Fehlberg-method is given as<br />

k 1 = f (t, u)<br />

k 2 = f (t + c 2 h, u + ha 21 k 1 )<br />

k 3 = f (t + c 3 h, u + ha 31 k 1 + ha 32 k 2 )<br />

2∑<br />

u m+1 = u m + h b i k i , û m+1 = u m + h<br />

i=1<br />

1. Februar 20<strong>13</strong> Bojana Rosic <strong>Introduction</strong> <strong>to</strong> <strong>Scientific</strong> <strong>Computing</strong> Seite 23<br />

3∑<br />

ˆb i k i .<br />

i=1

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!