HOME

TheInfoList



OR:

Numerov's method (also called Cowell's method) is a
numerical method In numerical analysis, a numerical method is a mathematical tool designed to solve numerical problems. The implementation of a numerical method with an appropriate convergence check in a programming language is called a numerical algorithm. Mathem ...
to solve
ordinary differential equation In mathematics, an ordinary differential equation (ODE) is a differential equation whose unknown(s) consists of one (or more) function(s) of one variable and involves the derivatives of those functions. The term ''ordinary'' is used in contras ...
s of second order in which the first-order term does not appear. It is a fourth-order
linear multistep method 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 proce ...
. The method is implicit, but can be made explicit if the differential equation is linear. Numerov's method was developed by the Russian astronomer Boris Vasil'evich Numerov.


The method

The Numerov method can be used to solve differential equations of the form : \frac = - g(x) y(x) + s(x). In it, three values of y_, y_n, y_ taken at three equidistant points x_, x_n, x_ are related as follows: : y_ \left(1 + \frac g_\right) = 2 y_n \left(1 - \frac g_n\right) - y_ \left(1 + \frac g_\right) + \frac (s_ + 10 s_n + s_) + \mathcal(h^6), where y_n = y(x_n) , g_n = g(x_n) , s_n = s(x_n) , and h = x_ - x_n .


Nonlinear equations

For nonlinear equations of the form : \frac = f(x,y), the method gives : y_ - 2 y_n + y_ = \frac (f_ + 10 f_n + f_) + \mathcal (h^6). This is an implicit
linear multistep method 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 proce ...
, which reduces to the explicit method given above if f is linear in y by setting f(x,y) = - g(x) y(x) + s(x) . It achieves order-4 accuracy .


Application

In numerical physics the method is used to find solutions of the unidimensional
Schrödinger equation The Schrödinger equation is a linear partial differential equation that governs the wave function of a quantum-mechanical system. It is a key result in quantum mechanics, and its discovery was a significant landmark in the development of th ...
for arbitrary potentials. An example of which is solving the radial equation for a spherically symmetric potential. In this example, after separating the variables and analytically solving the angular equation, we are left with the following equation of the radial function R(r): : \frac \left(r^2 \frac \right) - \frac (V(r) - E) R(r) = l (l + 1) R(r). This equation can be reduced to the form necessary for the application of Numerov's method with the following substitution: : u(r) = r R(r) \Rightarrow R(r) = \frac, : \frac = \frac \frac - \frac = \frac \left (r \frac - u(r) \right) \Rightarrow \frac \left(r^2 \frac \right) = \frac + r \frac - \frac = r \frac. And when we make the substitution, the radial equation becomes : r \frac - \frac (V(r) - E) u(r) = \frac u(r), or : -\frac \frac + \left(V(r) + \frac \frac \right) u(r) = E u(r), which is equivalent to the one-dimensional Schrödinger equation, but with the modified effective potential : V_\text(r) = V(r) + \frac \frac = V(r) + \frac, \quad L^2 = l (l + 1) \hbar^2. 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: : \frac = - \frac (E - V_\text(r)) u(r), : g(r) = \frac (E - V_\text(r)), : s(r) = 0.


Derivation

We are given the differential equation : y''(x) = - g(x) y(x) + s(x). To derive the Numerov's method for solving this equation, we begin with the
Taylor expansion In mathematics, the Taylor series or Taylor expansion of a function is an infinite sum of terms that are expressed in terms of the function's derivatives at a single point. For most common functions, the function and the sum of its Taylor se ...
of the function we want to solve, y(x) , around the point x_0 : : y(x) = y(x_0) + (x-x_0)y'(x_0) + \fracy''(x_0) + \fracy(x_0) + \fracy'(x_0) + \fracy''(x_0) + \mathcal(h^6). Denoting the distance from x to x_0 by h = x - x_0 , we can write the above equation as : y(x_0 + h) = y(x_0) + hy'(x_0) + \fracy''(x_0) + \fracy(x_0) + \fracy'(x_0) + \fracy''(x_0) + \mathcal(h^6). If we evenly discretize the space, we get a grid of x points, where h = x_ - x_n . By applying the above equations to this discrete space, we get a relation between the y_n and y_ : : y_ = y_n + hy'(x_n) + \fracy''(x_n) + \fracy(x_n) + \fracy'(x_n) + \fracy''(x_n) + \mathcal(h^6). Computationally, this amounts to taking a step ''forward'' by an amount h . If we want to take a step ''backwards'', we replace every h with - h and get the expression for y_ : : y_ = y_n - hy'(x_n) + \fracy''(x_n) - \fracy(x_n) + \fracy'(x_n) - \fracy''(x_n) + \mathcal(h^6). Note that only the odd powers of h experienced a sign change. By summing the two equations, we derive that : y_ - 2 y_n + y_ = h^2 y''_n + \fracy'_n + \mathcal(h^6). We can solve this equation for y_ by substituting the expression given at the beginning, that is y''_n = - g_n y_n + s_n . To get an expression for the y'_n factor, we simply have to differentiate y''_n = - g_n y_n + s_n twice and approximate it again in the same way we did this above: : y'_n = \frac (-g_n y_n + s_n), : h^2 y'_n = -g_ y_ + s_ + 2 g_n y_n - 2 s_n - g_ y_ + s_ + \mathcal(h^4). If we now substitute this to the preceding equation, we get : y_ - 2 y_n + y_ = (- g_n y_n + s_n) + \frac (- g_ y_ + s_ + 2 g_n y_n - 2 s_n - g_ y_ + s_) + \mathcal(h^6), or : y_ \left(1 + \frac g_ \right) - 2 y_n \left(1 - \frac g_n \right) + y_ \left(1 + \frac g_ \right) = \frac (s_ + 10 s_n + s_) + \mathcal(h^6). This yields the Numerov's method if we ignore the term of order h^6 . It follows that the order of convergence (assuming stability) is 4.


References

* .
This book includes the following references: * . * {{Citation , last1=Numerov , first1=Boris Vasil'evich , author1-link=Boris Vasil'evich Numerov , title=Note on the numerical integration of d2''x''/d''t''2 = ''f''(''x'',''t'') , year=1927 , journal=
Astronomische Nachrichten ''Astronomische Nachrichten'' (''Astronomical Notes''), one of the first international journals in the field of astronomy, was established in 1821 by the German astronomer Heinrich Christian Schumacher. It claims to be the oldest astronomical jou ...
, volume=230 , issue=19 , pages=359–364, bibcode = 1927AN....230..359N , doi=10.1002/asna.19272301903. Numerical differential equations