{"id":1750,"date":"2025-08-17T09:37:00","date_gmt":"2025-08-17T09:37:00","guid":{"rendered":"https:\/\/www.mathros.net.ua\/en\/?p=1750"},"modified":"2025-11-06T11:23:26","modified_gmt":"2025-11-06T11:23:26","slug":"milnes-method","status":"publish","type":"post","link":"https:\/\/www.mathros.net.ua\/en\/milnes-method.html","title":{"rendered":"Milne’s Method: A Simple Explanation and Step-by-Step Example"},"content":{"rendered":"

Milne’s method is a powerful technique for anyone aiming to confidently solve differential equations. If you are familiar with numerical methods, you already know that they help us find approximate solutions when analytical methods become too complex or even impossible. However, Milne’s method stands out due to its unique logic and efficiency. In this article, we\u2019ll dive into how Milne’s method works, explore why its “predict-correct”<\/em> approach leads to great accuracy, and show you how to apply it with minimal effort. Not only will you gain a solid understanding of the theory behind it, but you’ll also see how this method is used in practice to solve specific problems.<\/p>\n

What is Milne’s Method and Why is It So Popular?<\/h2>\n

Milne’s method is a convenient and quite accurate way to approximate solutions to the Cauchy problem for ordinary differential equations. It is part of the multistep methods, which means that each step uses several previous calculations to refine the result. Does it sound complicated? It\u2019s actually quite the opposite! Students and researchers frequently use this method because it\u2019s simple to implement.<\/p>\n

So, what makes Milne’s method stand out? The key is its “predict-correct”<\/em> scheme. First, we make a prediction of the function’s value at a new point using the known values from previous steps. Then, we check the accuracy of the prediction and adjust it if needed. This two-step strategy enables Milne’s method to achieve better accuracy than simpler methods.<\/p>\n

How to Apply Milne’s Method to a Cauchy Problem: Where to Start?<\/h2>\n

Let’s consider a standard Cauchy problem:<\/p>\n

\"Cauchy<\/p>\n

Here\u2019s what we need to do: First, we choose the integration step h=[b-a]\/n<\/em>, and then we create a grid of points:<\/p>\n

\"Formula<\/p>\n

But there’s one important catch: to compute yi+1<\/sub><\/em> using Milne\u2019s method, we need the values from the previous four steps. Where do we get these values from? Initially, we use one of the single-step methods\u2014such as Euler’s<\/a> or Runge-Kutta’s methods<\/a>. These methods help us calculate the first four values: y0<\/sub><\/em>, y1<\/sub><\/em>, y2<\/sub><\/em>, y3<\/sub><\/em>, and then Milne’s method takes over.<\/p>\n

Step-by-Step Milne’s Algorithm: Predict \u2192 Correct<\/h2>\n

Once we have the first four points, we can proceed to calculate the next values (starting from i=4<\/em>). The process is simple: first, predict, then correct. In the prediction step, we estimate the new point based on the previous derivatives y’i-2<\/sub><\/em>, y’i-1<\/sub><\/em>, y’i<\/sub><\/em>. We get the predicted value:<\/p>\n

\"Milne\u2019s<\/p>\n

Next, we substitute \u1ef9i+1<\/sub><\/em> into the equation to find \u1ef9’i+1<\/sub>=f(xi+1<\/sub>, \u1ef9i+1<\/sub>)<\/em>. After that, we make the correction, which “smooths”<\/em> the prediction between the neighboring nodes:<\/p>\n

\"Milne\u2019s<\/p>\n

Do we need to repeat the correction? Sometimes yes, but typically one round of “predict <\/em>\u2192 correct”<\/em> is sufficient. We continue using the same pattern, calculating each step, and gradually build the solution for the entire interval.<\/p>\n

Why These Formulas?<\/h3>\n

The idea is straightforward: we approximate the derivative y’=f(x,y)<\/em> using Newton\u2019s interpolation polynomial<\/a> on a uniform grid, and then integrate this polynomial over the corresponding interval. For the prediction step, we use a third-order polynomial at the nodes xi-3<\/sub><\/em>, xi-2<\/sub><\/em>, xi-1<\/sub><\/em>, xi<\/sub><\/em>:<\/p>\n

\"Third-order<\/p>\n

Next, we approximate the integral of the derivative by integrating P3<\/sub>(x)<\/em>:<\/p>\n

\"Milne\u2019s<\/p>\n

Integrating the polynomial terms over the interval [xi-3<\/sub>, xi+1<\/sub>]<\/em> gives the prediction formula:<\/p>\n

\"Milne\u2019s<\/p>\n

For correction, we use a second-order polynomial at the nodes xi-1<\/sub><\/em>, xi<\/sub><\/em>, xi+1<\/sub><\/em>:<\/p>\n

\"Second-order<\/p>\n

After integrating P2<\/sub>(x)<\/em> over the interval [xi-1<\/sub>, xi+1<\/sub>]<\/em>, we get the corrector:<\/p>\n

\"Milne\u2019s<\/p>\n

Here, in practice, the unknown y’i+1<\/sub><\/em> is replaced with the approximate value \u1ef9’i+1<\/sub>=f(xi+1<\/sub>, \u1ef9i+1<\/sub>)<\/em>. Thus, the formulas naturally emerge from interpolating y’ on the grid and then integrating over the required segment.<\/p>\n

The Advantage of Milne’s Method: More Data Equals a More Accurate Result<\/h2>\n

Unlike single-step methods, Milne’s method uses data from four previous points. This allows for a more accurate prediction of the next value, as it incorporates more data from the history of calculations. Additionally, the correction step helps control the error and adjust it when necessary by aligning the result with neighboring nodes. As a result, you obtain more stable values with better accuracy without significantly increasing computational effort. So, more data at the input leads to more reliable results at the output.<\/p>\n

Applying Milne’s Method in Practice: A Step-by-Step Example<\/h2>\n

Now that we\u2019ve covered the theory, let’s see Milne’s method in action. Reading through the formulas is one thing, but actually working through a concrete example gives you a much clearer understanding of how convenient and effective this method is.<\/p>\n

Example 1: We Have the Differential Equation y’=y-x with the Initial Condition y(0)=1.5. We Need to Find the Approximate solution to This Equation on the Interval [0, 1] and Compare the Results with the Exact Solution, Which is y(x)=0.5\u22c5ex<\/sup>+x+1<\/h6>\n

\"Plot<\/p>\n

First, let\u2019s divide the interval [0, 1]<\/em> into 8<\/em> equal parts, so the integration step is h=0.125<\/em>. The nodes will be as follows:<\/p>\n

\"Sequence<\/p>\n

Since Milne\u2019s method is multistep, we need the first four values: y0<\/sub><\/em>, y1<\/sub><\/em>, y2<\/sub><\/em>, y3<\/sub><\/em>.<\/p>\n

To save time, we use an online Runge-Kutta fourth-order method calculator<\/a> to quickly and accurately get these initial points. We input the equation y’=y-x<\/em>, the initial condition y(0)=1.5<\/em>, the exact solution, the interval [0, 1]<\/em> and the number of parts n=8<\/em>. The result gives us:<\/p>\n

\"Online<\/p>\n

These values are now our starting points for Milne’s method.<\/p>\n

Next, using the prediction and correction formulas, we proceed step by step to calculate the next values:<\/p>\n

\"Step-by-step<\/p>\n

Now, let’s compare the results with the exact values:<\/p>\n\n\n\n\n\n\n\n\n\n
x<\/em><\/th>\nApproximate y<\/em><\/th>\nExact y<\/em><\/th>\nError<\/th>\n<\/tr>\n<\/thead>\n
0.5<\/td>\n2.32437<\/td>\n2.32436<\/td>\n0.00001<\/td>\n<\/tr>\n
0.625<\/td>\n2.55913<\/td>\n2.55912<\/td>\n0.00001<\/td>\n<\/tr>\n
0.75<\/td>\n2.8085<\/td>\n2.8085<\/td>\n0<\/td>\n<\/tr>\n
0.875<\/td>\n3.07444<\/td>\n3.07444<\/td>\n0<\/td>\n<\/tr>\n
1<\/td>\n3.35914<\/td>\n3.35914<\/td>\n0<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n

As we can see, the results are nearly perfect. The errors are either minimal or completely absent after just 8<\/em> steps.<\/p>\n

Milne’s method is not just another formula from a textbook. It\u2019s a powerful tool that delivers highly accurate results with minimal effort, especially when combined with methods like Runge-Kutta to set the initial values. Theory and practice work together beautifully here.<\/p>\n

Want to Learn More? Other Interesting Numerical Methods for Solving Differential Equations<\/h2>\n

Milne’s method is undoubtedly one of the most effective ways to numerically solve differential equations. However, it\u2019s not the only one. There are many other methods in numerical analysis that are just as useful and effective. If you\u2019re interested and want to expand your knowledge, consider these methods:<\/p>\n

    \n
  1. Adams’ Method<\/a>\u00a0– Another multistep approach that uses several previous data points to improve accuracy, allowing for more reliable predictions and reduced errors.<\/li>\n
  2. Modified Euler\u2019s Method<\/a>\u00a0– An improved version of the classic Euler method. It averages the derivative between points for better accuracy without significantly increasing computational costs.<\/li>\n
  3. Runge-Kutta-Merson Method<\/a>\u00a0– One of the most accurate methods, automatically controlling precision by adjusting the integration step. This makes it particularly useful for problems where minimizing error accumulation is essential.<\/li>\n<\/ol>\n

    Each of these methods has its strengths and applications. By exploring them, you’ll be able to choose the right tool for any problem you encounter. In numerical analysis, there is no single “perfect”<\/em> method\u2014only the one that best fits your particular needs.<\/p>\n

    Bring Mathematics to Code: Create Your Own Solution<\/h2>\n

    Mastering Milne’s method allows you to solve complex problems not just on paper, but in your own programs. Imagine how much more efficient it would be to automate calculations, so you don\u2019t have to perform dozens of manual steps. Let your computer do the heavy lifting!<\/p>\n

    You can use any programming language you’re comfortable with\u2014Python<\/em><\/a>, Java<\/em>, C++<\/em>, or even JavaScript<\/em>. The key is that the process should be clear and fun for you. Below is a flowchart illustrating Milne’s method algorithm step by step. It will help you quickly understand the logic behind the calculations and transfer it into code. Use it as a guide, adapt it to your needs, and create a program that will be your personal tool for precise and fast calculations.<\/p>\n

    \"Flowchart<\/p>\n","protected":false},"excerpt":{"rendered":"

    Milne’s method is a powerful technique for anyone aiming to confidently solve differential equations. If you are familiar with numerical<\/p>\n","protected":false},"author":1,"featured_media":1756,"comment_status":"closed","ping_status":"closed","sticky":false,"template":"template-centered.php","format":"standard","meta":{"footnotes":""},"categories":[207],"tags":[349,211,348,350,134],"class_list":["post-1750","post","type-post","status-publish","format-standard","has-post-thumbnail","hentry","category-solving-ordinary-differential-equations","tag-cauchy-problem","tag-differential-equations","tag-milnes-method","tag-multistep-methods","tag-numerical-methods"],"aioseo_notices":[],"_links":{"self":[{"href":"https:\/\/www.mathros.net.ua\/en\/wp-json\/wp\/v2\/posts\/1750","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.mathros.net.ua\/en\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.mathros.net.ua\/en\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.mathros.net.ua\/en\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/www.mathros.net.ua\/en\/wp-json\/wp\/v2\/comments?post=1750"}],"version-history":[{"count":4,"href":"https:\/\/www.mathros.net.ua\/en\/wp-json\/wp\/v2\/posts\/1750\/revisions"}],"predecessor-version":[{"id":1757,"href":"https:\/\/www.mathros.net.ua\/en\/wp-json\/wp\/v2\/posts\/1750\/revisions\/1757"}],"wp:featuredmedia":[{"embeddable":true,"href":"https:\/\/www.mathros.net.ua\/en\/wp-json\/wp\/v2\/media\/1756"}],"wp:attachment":[{"href":"https:\/\/www.mathros.net.ua\/en\/wp-json\/wp\/v2\/media?parent=1750"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.mathros.net.ua\/en\/wp-json\/wp\/v2\/categories?post=1750"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.mathros.net.ua\/en\/wp-json\/wp\/v2\/tags?post=1750"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}