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

Lecture

Error Estimation in Numerical Methods

In course

MATH-451: Numerical approximation of PDEs

The course is about the derivation, theoretical analysis and implementation of the finite element method for the numerical approximation of partial differential equations in one and two space dimensions. ...

Description

This lecture covers the concept of error estimation in numerical methods, focusing on stability and truncation errors. It discusses conditions for stability, explicit and implicit schemes, and the importance of inverse monotonicity. The instructor explains the implications of the CFL condition and the balance between errors in time and space.

This video is available exclusively on Mediaspace for a restricted audience. Please log in to MediaSpace to access it if you have the necessary permissions.

Watch on Mediaspace

Instructor

Annalisa Buffa

Official source

Ontological neighbourhood

Mathematics

Analysis: Numerical analysis

Related concepts (32)

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.

Numerical stability

In the mathematical subfield of numerical analysis, numerical stability is a generally desirable property of numerical algorithms. The precise definition of stability depends on the context. One is numerical linear algebra and the other is algorithms for solving ordinary and partial differential equations by discrete approximation. In numerical linear algebra, the principal concern is instabilities caused by proximity to singularities of various kinds, such as very small or nearly colliding eigenvalues.

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.

Round-off error

In computing, a roundoff error, also called rounding error, is the difference between the result produced by a given algorithm using exact arithmetic and the result produced by the same algorithm using finite-precision, rounded arithmetic. Rounding errors are due to inexactness in the representation of real numbers and the arithmetic operations done with them. This is a form of quantization error.

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 (34)

Numerical Differentiation: Part 1

Covers numerical differentiation, forward differences, Taylor's expansion, Big O notation, and error minimization.

High Order Methods: Space Discretisation

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

Runge-Kutta Methods: Approximating Differential Equations

Covers the stages of the explicit Runge-Kutta method for approximating y(t) with detailed explanations.

Euler Forward Method

Introduces the Euler Forward Method for ODEs, focusing on error analysis and stability.

Numerical Methods: Differential Equations and Stability Analysis