# Starting BDF iterations - suggestions?

• A
Summary:
How do I start BDF iterations? Any suggestions?
As we know, backward differentiation formulas for ODE start off with the backward Euler; which proceeds as:

If I wanted to switch to the second order method;

Can anyone recommend me ideas as to how to generate the initially required yn+1? The only thing I can think of are as follows:
• Use a standard Runge-Kutta to generate the second point, but in my opinion this is somehow futile as the reason why we use implicit methods is to avoid the instabilities which will generated via a standard explicit approach (like Runge-Kutta).
• Use the backward Euler technique with some microscopic (lol) stepsizes to assure that I am accurate, then I switch to a higher BDF method? Say, I want to propagate a second-order solution with a stepsize of 0.1. Maybe I should generate a backward Euler solution of step 0.001? Or something?
I'm very open to suggestions as I have no idea how to proceed. Any suggestions?

Delta2

pbuk
Gold Member
Use a standard Runge-Kutta to generate the second point
This is the usual approach.

, but in my opinion this is somehow futile as the reason why we use implicit methods is to avoid the instabilities which will generated via a standard explicit approach (like Runge-Kutta).
Indeed.

I'm very open to suggestions as I have no idea how to proceed. Any suggestions?
These issues are considered in any good text book on ODE methods, the 'gold standard' being Lambert Computational Methods in Ordinary Differential Equations or alternatively these excellent lecture notes available online: https://people.maths.ox.ac.uk/suli/nsodes.pdf (see s3.2 et seq).

Last edited:
Delta2, jim mcnamara, maistral and 1 other person
Oh! Thank you very much.

Delta2
Chestermiller
Mentor
If you are calculating ##y_{n+2}##, you already know ##y_{n+1}##.

pbuk