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

Create successful ePaper yourself

Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.

Runge-Kutta methods<br />

The general form of explicit Runge-Kutta method is:<br />

where<br />

s∑<br />

y n+1 = y n + h b i k i<br />

i=1<br />

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

k 2 = f (t n + c 2 h, y n + a 21 k 1 h),<br />

k 3 = f (t n + c 3 h, y n + (a 31 k 1 + a 32 k 2 )h),<br />

.<br />

k s = f (t n + c s h, y n + h(a s1 k 1 + a s2 k 2 + · · · + a s,s−1 k s−1 ))<br />

and b i are coefficients.<br />

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

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

Saved successfully!

Ooh no, something went wrong!