1. Forum
  2. Usenet
  3. COMP.LANG.FORTRAN

  • =?UTF-8?Q?Re=3A_Bulirsch=E2=80=93Stoer_vs_Runge=2DKutta?=

    From Robin Vowels@21:1/5 to dcar...@gmail.com on Thu Sep 1 02:42:01 2022
    On Thursday, March 3, 2011 at 9:26:29 AM UTC+11, dcar...@gmail.com wrote:
    Hello,
    I hope you'll forgive a completely non-Fortran question. I have been
    unable to find useful information with Google. Does anyone know an
    online reference that explains when Runge-Kutta is the best way to
    solve an ODE and when the Bulirsch–Stoer works best?
    All I can find is pages explaining how they work, but nothing that
    compares them.
    .
    The algorithm Bulirsch–Stoer if far more complicated than Runge-Kutta.
    Look in Numerical Recipes in C for the former.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Ron Shepard@21:1/5 to Robin Vowels on Thu Sep 1 09:12:44 2022
    On 9/1/22 4:42 AM, Robin Vowels wrote:
    On Thursday, March 3, 2011 at 9:26:29 AM UTC+11, dcar...@gmail.com wrote:
    Hello,
    I hope you'll forgive a completely non-Fortran question. I have been
    unable to find useful information with Google. Does anyone know an
    online reference that explains when Runge-Kutta is the best way to
    solve an ODE and when the Bulirsch–Stoer works best?
    All I can find is pages explaining how they work, but nothing that
    compares them.
    .
    The algorithm Bulirsch–Stoer if far more complicated than Runge-Kutta.
    Look in Numerical Recipes in C for the former.

    I remember reading about Bulirsch–Stoer in Numerical Recipes (the first edition in fortran, not the C version a decade later). The authors were
    big proponents of the method.

    $.02 -Ron Shepard

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)