NETMaths

One statement at a time

Part C looks like a multiple-choice question, but it is really four separate true/false calls — and the marking scheme gives you nothing unless every one of them is right. So practise them the way they are actually marked. When you slip, you get the counterexample and, more usefully, the kind of mistake it was.

No account needed. Press T or F to answer, to continue.

Numerical ODE: Euler, Runge–Kutta

Context

Consider solving y′ = f(t, y) numerically with step size h. Which of the following are true?

Is this true?

Halving h in explicit Euler roughly halves the global error.

ShareWhatsAppTelegram