**Are you an EPFL student looking for a semester project?**

Work with us on data science and visualisation projects, and deploy your project as an app on top of GraphSearch.

Concept# Euler method

Summary

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).
The Euler method is a first-order method, which means that the local error (error per step) is proportional to the square of the step size, and the global error (error at a given time) is proportional to the step size.
The Euler method often serves as the basis to construct more complex methods, e.g., predictor–corrector method.
Geometrical description
Purpose and why it works
Consider the problem of calculating the shape of an unknown curve which starts at a given point and sat

Official source

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Related publications

Loading

Related people

Loading

Related units

Loading

Related concepts

Loading

Related courses

Loading

Related lectures

Loading

Related concepts (19)

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 "numer

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 approx

Backward Euler method

In numerical analysis and scientific computing, the backward Euler method (or implicit Euler method) is one of the most basic numerical methods for the solution of ordinary differential equations. It

Related courses (60)

FIN-472: Computational finance

Participants of this course will master computational techniques frequently used in mathematical finance applications. Emphasis will be put on the implementation and practical aspects.

MATH-251(a): Numerical analysis

This course presents numerical methods for the solution of mathematical problems such as systems of linear and non-linear equations, functions approximation, integration and differentiation and differential equations.

MATH-456: Numerical analysis and computational mathematics

The course provides an introduction to scientific computing. Several numerical methods are presented for the computer solution of mathematical problems arising in different applications. The software MATLAB is used to solve the problems and verify the theoretical properties of the numerical methods.

Related units (6)

Related people (6)

Related publications (53)

Loading

Loading

Loading

Related lectures (163)

Nicolas Boumal, Christopher Arnold Criscitiello

We describe the first gradient methods on Riemannian manifolds to achieve accelerated rates in the non-convex case. Under Lipschitz assumptions on the Riemannian gradient and Hessian of the cost function, these methods find approximate first-order critical points faster than regular gradient descent. A randomized version also finds approximate second-order critical points. Both the algorithms and their analyses build extensively on existing work in the Euclidean case. The basic operation consists in running the Euclidean accelerated gradient descent method (appropriately safe-guarded against non-convexity) in the current tangent space, then moving back to the manifold and repeating. This requires lifting the cost function from the manifold to the tangent space, which can be done for example through the Riemannian exponential map. For this approach to succeed, the lifted cost function (called the pullback) must retain certain Lipschitz properties. As a contribution of independent interest, we prove precise claims to that effect, with explicit constants. Those claims are affected by the Riemannian curvature of the manifold, which in turn affects the worst-case complexity bounds for our optimization algorithms.

This work aims to investigate, by means of numerical simulation, the evolution of free surface flow in aluminium production cells, and especially the magnetohydrodynamic instabilities. We design a numerical method combining a level-set technique together with a finite element discretization, in order to solve the non-stationnary Navier-Stokes equations and the equation for the motion of the free surface. Our numerical experiments confirms results obtained by other authors and we study the evolution of instabilities calculated by a stationary program, ALUCELL.

A space-time adaptive algorithm to solve the motion of a rigid disk in an incompressible Newtonian fluid is presented, which allows collision or quasi-collision processes to be computed with high accuracy. In particular, we recover the theoretical result proven in [M. Hillairet, Lack of collision between solid bodies in a 2D incompressible viscous flow, Comm. Partial Differential Equations 32 (2007), no. 7-9, 1345-1371], that the disk will never touch the boundary of the domain in finite time. Anisotropic, continuous piecewise linear finite elements are used for the space discretization, the Euler scheme for the time discretization. The adaptive criteria are based on a posteriori error estimates for simpler problems.