Mediaspace scheduled maintenance: Aug 25, 2026 07:00 - 12:00 AM. During this time, videos will be temporarily unavailable. Check status updates.

Lecture

Runge-Kutta Methods: Stability and Implicit Schemes

In courses (2)

MATH-250: Advanced numerical analysis I

Construction and analysis of numerical methods for the solution of problems from linear algebra, integration, approximation, and differentiation. ...

MATH-251(c): Numerical analysis

Le cours présente des méthodes numériques pour la résolution de problèmes mathématiques comme des systèmes d'équations linéaires ou non linéaires, l'approximation de fonctions, l'intégration et la dérivation, et les équations différentielles. ...

Description

This lecture covers digital integration methods, stability, and Runge-Kutta methods. It explains implicit schemes, unconditional stability, and order 2 methods. The trapezoid formula and node systems are discussed, along with the Crank-Nicolson diagram. Various integration methods like Simpson's method and 4th order Runge-Kutta are explored.

Instructors (3)

Daniel Kressner

Annalisa Buffa

Simone Deparis

Official source

Ontological neighbourhood

Mathematics

Analysis: Numerical analysis

Related concepts (24)

Euler method

In mathematics and computational science, the Euler method (also called the forward Euler method) is a first-order numerical procedure for solving ordinary differential equations (ODEs) with a given initial value. It is the most basic explicit method for numerical integration of ordinary differential equations and is the simplest Runge–Kutta method. The Euler method is named after Leonhard Euler, who first proposed it in his book Institutionum calculi integralis (published 1768–1870).

Runge–Kutta methods

In numerical analysis, the Runge–Kutta methods (ˈrʊŋəˈkʊtɑː ) are a family of implicit and explicit iterative methods, which include the Euler method, used in temporal discretization for the approximate solutions of simultaneous nonlinear equations. These methods were developed around 1900 by the German mathematicians Carl Runge and Wilhelm Kutta. The most widely known member of the Runge–Kutta family is generally referred to as "RK4", the "classic Runge–Kutta method" or simply as "the Runge–Kutta method".

Numerical methods for ordinary differential equations

Numerical methods for ordinary differential equations are methods used to find numerical approximations to the solutions of ordinary differential equations (ODEs). Their use is also known as "numerical integration", although this term can also refer to the computation of integrals. Many differential equations cannot be solved exactly. For practical purposes, however – such as in engineering – a numeric approximation to the solution is often sufficient. The algorithms studied here can be used to compute such an approximation.

Heun's method

In mathematics and computational science, Heun's method may refer to the improved or modified Euler's method (that is, the explicit trapezoidal rule), or a similar two-stage Runge–Kutta method. It is named after Karl Heun and is a numerical procedure for solving ordinary differential equations (ODEs) with a given initial value. Both variants can be seen as extensions of the Euler method into two-stage second-order Runge–Kutta methods.

Trapezoidal rule

In calculus, the trapezoidal rule (also known as the trapezoid rule or trapezium rule; see Trapezoid for more information on terminology) is a technique for approximating the definite integral. The trapezoidal rule works by approximating the region under the graph of the function as a trapezoid and calculating its area. It follows that The trapezoidal rule may be viewed as the result obtained by averaging the left and right Riemann sums, and is sometimes defined this way.

Related lectures (43)

Ordinary Differential Equations: Methods and Applications

Explores ordinary differential equations and numerical integration methods for stability and accuracy.

Numerics: semester project

Covers the semester project on numerics, focusing on adaptive algorithms and multistep methods.

Explicit Stabilised Methods: Stochastic Differential Equations

Covers explicit stabilized methods for stiff stochastic differential equations, analyzing their properties and applications.

Euler Backward Method: ODEs

Explores the Euler backward method for ODEs, discussing stability, error reduction, and implicit vs explicit methods.

Runge-Kutta Methods: Approximating Differential Equations