This shows you the differences between two versions of the page.
Both sides previous revision Previous revision | |||
rk3 [2023/03/10 12:51] daria removed |
— (current) | ||
---|---|---|---|
Line 1: | Line 1: | ||
- | ====== rk3 ====== | ||
- | |||
- | Explicit fixed-step solver of third order. The method was proposed by Przemyslaw Bogacki and Lawrence F. Shampine in 1989. The Bogacki–Shampine method is a Runge–Kutta method of order three with four stages with the First Same As Last (FSAL) property, so that it uses approximately three function evaluations per step. | ||
- | |||
- | Low-order methods are more suitable than higher-order methods like the Dormand–Prince method of order five, if only a crude approximation to the solution is required. Bogacki and Shampine argue that their method outperforms other third-order methods with an embedded method of order two. | ||
- | |||
- | The [[Butcher_tableau|Butcher tableau]] for the Bogacki–Shampine method is: | ||
- | |||
- | 0 | ||
- | 1/2 | ||
- | 1/2 | ||
- | 3/4 | ||
- | 0 | ||
- | 3/4 | ||
- | 2/9 | ||
- | 1/3 | ||
- | 4/9 | ||
- | Applicable [[Solver_settings|solver settings]]: | ||
- | |||
- | * Fixed-step size | ||
- | * Limit data points to last | ||
- | |||
- | ===== Reference ===== | ||
- | |||
- | * http:// | ||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||