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

Lecture

Euler Progressive Scheme

Description

This lecture covers the Euler progressive scheme, starting from an initial value to calculate subsequent values, using a method of marching in time. It explains the explicit scheme advantages, disadvantages, and the formula for approximating values. The instructor discusses the stability and the use of finite difference formulas.

In MOOC

Numerical Analysis for Engineers

Official source

Quiz

Ontological neighbourhood

Mathematics

Analysis: Numerical analysis

Related concepts (14)

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.

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

Numerical analysis

Numerical analysis is the study of algorithms that use numerical approximation (as opposed to symbolic manipulations) for the problems of mathematical analysis (as distinguished from discrete mathematics). It is the study of numerical methods that attempt at finding approximate solutions of problems rather than the exact ones. Numerical analysis finds application in all fields of engineering and the physical sciences, and in the 21st century also the life and social sciences, medicine, business and even the arts.

Finite difference

A finite difference is a mathematical expression of the form f (x + b) − f (x + a). If a finite difference is divided by b − a, one gets a difference quotient. The approximation of derivatives by finite differences plays a central role in finite difference methods for the numerical solution of differential equations, especially boundary value problems. The difference operator, commonly denoted is the operator that maps a function f to the function defined by A difference equation is a functional equation that involves the finite difference operator in the same way as a differential equation involves derivatives.

Explicit and implicit methods

Explicit and implicit methods are approaches used in numerical analysis for obtaining numerical approximations to the solutions of time-dependent ordinary and partial differential equations, as is required in computer simulations of physical processes. Explicit methods calculate the state of a system at a later time from the state of the system at the current time, while implicit methods find a solution by solving an equation involving both the current state of the system and the later one.

Related lectures (46)

Numerical Methods: Boundary Value Problems

Explores numerical methods for boundary value problems, including heat diffusion and fluid flow, using finite difference methods.

Numerical Methods: Euler Schemes

Focuses on Euler schemes for numerical approximation of forces and velocities.

Finite Difference Grids

Explains finite difference grids for computing solutions of elastic membranes using Laplace's equation and numerical methods.

Numerical Methods: Differential Equations and Stability Analysis

Covers numerical methods for solving differential equations and their stability analysis, focusing on error calculation and practical applications in engineering and science.

Boundary Problems in 1D: Finite Differences