ArticleslgStudy

mathematics

Runge–Kutta–Fehlberg method

Runge–Kutta–Fehlberg method is a mathematics topic covered in the lgStudy science library. This page brings together a partial reference excerpt, illustrations, worked examples, real-world applications and a short study plan, so you can understand Runge–Kutta–Fehlberg method rather than just read about it. In short: In mathematics, the Runge–Kutta–Fehlberg method (or Fehlberg method) is an algorithm in numerical analysis for the numerical solution of ordinary differential equations. It was developed by the German mathematician Erwin Fehlberg and is based on the large class of Runge–Kutta methods.

Runge–Kutta–Fehlberg method — main illustration
Runge–Kutta–Fehlberg method — illustration

Key takeaways

  • Runge–Kutta–Fehlberg method belongs to mathematics; place it in that map before memorising details.
  • Learn the definition first, then one example that makes the definition concrete.
  • Connect Runge–Kutta–Fehlberg method to a quantity you can measure, compute or draw — that is where exam questions come from.
  • Reproduce the core statement of Runge–Kutta–Fehlberg method from memory before moving on to harder problems.

Reference excerpt

In mathematics, the Runge–Kutta–Fehlberg method (or Fehlberg method) is an algorithm in numerical analysis for the numerical solution of ordinary differential equations. It was developed by the German mathematician Erwin Fehlberg and is based on the large class of Runge–Kutta methods. The novelty of Fehlberg's method is that it is an embedded method from the Runge–Kutta family, meaning that it reuses the same intermediate calculations to produce two estimates of different accuracy, allowing for automatic error estimation. The method presented in Fehlberg's 1969 paper has been dubbed the RKF45 method, and is a method of order O(h4) with an error estimator of order O(h5). By performing one extra calculation, the error in the solution can be estimated and controlled by using the higher-order embedded method that allows for an adaptive stepsize to be determined automatically.

Butcher tableau for Fehlberg's 4(5) method Any Runge–Kutta method is uniquely identified by its Butcher tableau. The embedded pair proposed by Fehlberg:

Implementing an RK4(5) Algorithm The coefficients found by Fehlberg for Formula 1 (derivation with his parameter α2=1/3) are given in the table below. Note that while Fehlberg's original tables begin indexing at 0, the standard mathematical convention for Runge–Kutta methods established by Butcher uses coefficients denoted as a i j {\displaystyle a_{ij}} with i = 1 , 2 , … , s {\displaystyle i=1,2,\ldots ,s} and j = 1 , 2 , … , s {\displaystyle j=1,2,\ldots ,s} . Therefore, when implementing these methods in programming languages that use 0-based array indexing, there is a shift between the mathematical notation and array indices: what appears as k 1 {\displaystyle k_{1}} in the mathematical formulation corresponds to index 0 in the implementation arrays.

Fehlberg outlines a solution to solving a system of n differential equations of the form:

d y i d x = f i ( x , y 1 , y 2 , … , y n ) , i = 1 , 2 , … , n {\displaystyle {\frac {dy_{i}}{dx}}=f_{i}(x,y_{1},y_{2},\ldots ,y_{n}),i=1,2,\ldots ,n}

to iterative solve for

y i ( x + h ) , i = 1 , 2 , … , n {\displaystyle y_{i}(x+h),i=1,2,\ldots ,n}

where h is an adaptive stepsize to be determined algorithmically: The solution is the weighted average of six increments, where each increment is the product of the size of the interval, h {\textstyle h} , and an estimated slope specified by function f on the right-hand side of the differential equation.

… excerpt ends here. Continue reading the full article.

Worked examples

Example 1 — a first encounter with Runge–Kutta–Fehlberg method

Start with the simplest possible case. Write down what Runge–Kutta–Fehlberg method claims or describes in one sentence, then invent the smallest concrete situation in which that sentence is true. In mathematics, the smallest case is usually a single object, a single equation or a single measurement. Check that every symbol or term in your sentence has a meaning in that case.

Example 2 — changing one variable

Take the situation from Example 1 and change exactly one quantity: double it, halve it, or set it to zero. Predict what should happen to Runge–Kutta–Fehlberg method before you calculate. Comparing your prediction with the result is the fastest way to find out whether you understand the idea or only the words.

Example 3 — an exam-style question

Typical questions about Runge–Kutta–Fehlberg method ask you to (a) state it precisely, (b) apply it to given data, and (c) explain a limitation. Practise writing all three answers in under five minutes; the third part is what separates a full-mark answer from an average one.

Applications of Runge–Kutta–Fehlberg method

In research
Runge–Kutta–Fehlberg method appears in mathematics research whenever the underlying quantities have to be modelled precisely. Papers usually cite it as a starting assumption and then explore where it breaks down.
In technology and industry
Engineering practice reuses Runge–Kutta–Fehlberg method in design rules, simulations and safety margins. Knowing the idea lets you read a specification sheet and understand why the numbers look the way they do.
In the classroom
Runge–Kutta–Fehlberg method is common in secondary-school and first-year university syllabi. It links to neighbouring topics Numerical analysis, Numerical differential equations, Runge–Kutta methods, so understanding it makes those chapters shorter.
In everyday life
Look for Runge–Kutta–Fehlberg method outside the textbook — in sport, cooking, traffic, electronics or the sky above you. An example you found yourself is remembered far longer than one you were given.
Ask Teacher Smith questions about this articleOpens your AI tutor with a question about “Runge–Kutta–Fehlberg method” →

Affiliate

Preply — study more efficiently by working with a personal tutor. 50% off.

How to study Runge–Kutta–Fehlberg method in 20 minutes

  1. Read the reference excerpt below once, without taking notes.
  2. Close the page and write down what Runge–Kutta–Fehlberg method means in your own words.
  3. Compare your version with the excerpt and mark what you missed.
  4. Work through the three examples above with pen and paper.
  5. Explain Runge–Kutta–Fehlberg method out loud to somebody else — or to Teacher Smith in the lgStudy chat.

Frequently asked questions

What is Runge–Kutta–Fehlberg method in simple terms?

In mathematics, the Runge–Kutta–Fehlberg method (or Fehlberg method) is an algorithm in numerical analysis for the numerical solution of ordinary differential equations. It was developed by the German mathematician Erwin Fehlberg and is based on the large class of Runge–Kutta methods.

Why does Runge–Kutta–Fehlberg method matter?

Because it connects several mathematics ideas at once: it gives you a definition you can apply, a quantity you can calculate, and a way to check whether a result is plausible.

How should I study Runge–Kutta–Fehlberg method?

Read the excerpt, restate it from memory, then work through the examples and applications listed on this page. The five-step study plan above takes about twenty minutes.

What does this page cover?

It gives you a compact reference excerpt plus original lgStudy explanations, examples, applications and study material on Runge–Kutta–Fehlberg method.

Tags

  • Numerical analysis
  • Numerical differential equations
  • Runge–Kutta methods

Keep exploring