Numerov's method is a numerical method to solve ordinary differential equations of second order in which the first-order term does not appear. It is a fourth-order linear multistep method. The method is implicit, but can be made explicit if the differential equation is linear.
The Numerov method can be used to solve differential equations of the form
The function is sampled in the interval [a..b] at equidistant positions . Starting from function values at two consecutive samples and the remaining function values can be calculated as
where and are the function values at the positions and is the distance between two consecutive samples.
In numerical physics the method is used to find solutions of the unidimensional Schrödinger equation for arbitrary potentials. An example of which is solving the radial equation for a spheically symmetric potential. In this example, after seperating the variables and analytically solving the angular equation, we are left with the following equation of the radial : function:
This equation can be reduced to the form necessary for the application of Numerov's method with the following substitution:
And when we make the substitution the radial equation becomes:
Which is equivalent to the one-dimensional Schrödinger equation, but with the modified potential that is analogous to the classical effective potential.
This equation we can proceed to solve the same way we would have solved the one-dimensional Schrödinger equation. We can rewrite the equation a little bit differently and thus see the possible application of Numerov's method more clearly.
Denote the distance from to by and, noting that this means , we can write the above equation as
Computationally, this amounts taking a step forward by an amount h. If we want to take a step backwards, replace every h with -h for the equation of :
Note that only the odd powers of h experienced a sign change. On an evenly spaced grid, the nth site on a computational grid corresponds to position if the step-size between grid points are of length (hence h should be small for the computation to be accurate). This means we have sampling points and . Taking the equations for and from continuous space to discrete space, we see that
The sum of those two equations gives
We solve this equation for and replace it by the expression which we get from the defining differential equation.
We take the second derivative of our defining differential equation and get
We replace the second derivative with the second order difference quotient and insert this into our equation for (note that we take the mixed forward and backward finite difference, not the double forward difference or the double backward difference)
We solve for to get
This yields Numerov's method if we ignore the term of order . It follows that the order of convergence (assuming stability) is 4.
References
Hairer, Ernst; Nørsett, Syvert Paul; Wanner, Gerhard (1993), Solving ordinary differential equations I: Nonstiff problems, Berlin, New York: Springer-Verlag, ISBN978-3-540-56670-0. This book includes the following references: