Linear multistep methods are used for the numerical solution of ordinary differential equations. Conceptually, a numerical method starts from an initial point and then takes a short step forward in time to find the next solution point. The process continues with subsequent steps to map out the solution. Single-step methods (such as Euler's method) refer to only one previous point and its derivative to determine the current value. Methods such as Runge–Kutta take some intermediate steps (for example, a half-step) to obtain a higher order method, but then discard all previous information before taking a second step. Multistep methods attempt to gain efficiency by keeping and using the information from previous steps rather than discarding it. Consequently, multistep methods refer to several previous points and derivative values. In the case of linear multistep methods, a linear combination of the previous points and derivative values is used.
Definitions Numerical methods for ordinary differential equations approximate solutions to initial value problems of the form
y ′ = f ( t , y ) , y ( t 0 ) = y 0 . {\displaystyle y'=f(t,y),\quad y(t_{0})=y_{0}.}
The result is approximations for the value of y ( t ) {\displaystyle y(t)} at discrete times t i {\displaystyle t_{i}} :
y i ≈ y ( t i ) where t i = t 0 + i h , {\displaystyle y_{i}\approx y(t_{i})\quad {\text{where}}\quad t_{i}=t_{0}+ih,}
where h {\displaystyle h} is the time step (sometimes referred to as Δ t {\displaystyle \Delta t} ) and i {\displaystyle i} is an integer. Multistep methods use information from the previous s {\displaystyle s} steps to calculate the next value. In particular, a linear multistep method uses a linear combination of y i {\displaystyle y_{i}} and f ( t i , y i ) {\displaystyle f(t_{i},y_{i})} to calculate the value of y {\displaystyle y} for the desired current step. Thus, a linear multistep method is a method of the form
y n + s + a s − 1 ⋅ y n + s − 1 + a s − 2 ⋅ y n + s − 2 + ⋯ + a 0 ⋅ y n
… excerpt ends here. Continue reading the full article.
