Lecture

Progressive Euler Convergence

Graph Chat

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

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 the convergence of the progressive Euler method for ODE systems, including stability analysis and demonstration of local and global truncation errors. It also explores Lagrange's theorem for error estimation.

Instructors (3)

Simone Deparis

Expertise Simone Deparis is a professor at EPFL specializing in applied mathematics, numerical analysis, and the didactics of university-level mathematics. His research spans computational modeling for biomedical applications and innovations in mathematics education, with a focus on equity, self-efficacy, and assessment reform in large STEM cohorts. Mission Our group conducts research at the intersection of applied mathematics and learning sciences. In applied mathematics, we focus on modeling and simulatio

Daniel Kressner

Annalisa Buffa

Teaching & PhD PhD Students Gonzalo Bonilla Moreno, Philipp Christoph Weder, Yannis Dirk Voet, Fabio Marcinno, Ferhat Sindy, Francesco Sala, Markus Renoldner, Mohamed Ben Abdelouahab, Davor Dobrota Past EPFL PhD Students Luca Coradello, Ondine Chanon, Riccardo Puppi Courses Numerical approximation of PDEs MATH-451 The course is about the derivation, theoretical analysis and implementation of the finite element method for the numerical approximation of partial differential equations in on

Official source

Related concepts (14)

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).

Verlet integration

Verlet integration (vɛʁˈlɛ) is a numerical method used to integrate Newton's equations of motion. It is frequently used to calculate trajectories of particles in molecular dynamics simulations and computer graphics. The algorithm was first used in 1791 by Jean Baptiste Delambre and has been rediscovered many times since then, most recently by Loup Verlet in the 1960s for use in molecular dynamics. It was also used by P. H. Cowell and A. C. C.

Trapezoidal rule (differential equations)

In numerical analysis and scientific computing, the trapezoidal rule is a numerical method to solve ordinary differential equations derived from the trapezoidal rule for computing integrals. The trapezoidal rule is an implicit second-order method, which can be considered as both a Runge–Kutta method and a linear multistep method. Suppose that we want to solve the differential equation The trapezoidal rule is given by the formula where is the step size.

Finite difference method

In numerical analysis, finite-difference methods (FDM) are a class of numerical techniques for solving differential equations by approximating derivatives with finite differences. Both the spatial domain and time interval (if applicable) are discretized, or broken into a finite number of steps, and the value of the solution at these discrete points is approximated by solving algebraic equations containing finite differences and values from nearby points.

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.

Related lectures (64)

Numerics: semester project

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

Ordinary Differential Equations: Methods and Applications

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

Explicit Stabilised Methods: Stochastic Differential Equations

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

High Order Methods: Space Discretisation

Covers high order methods for space discretisation in linear differential systems.

Optimal Transport: Gradient Flows in Rd