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

Lecture

Advanced Numerical Analysis: Space Discretization

In course

MATH-351: Advanced numerical analysis II

The student will learn state-of-the-art algorithms for solving differential equations. The analysis and implementation of these algorithms will be discussed in some detail. ...

Description

This lecture covers the advanced topic of space discretization in numerical analysis, focusing on methods to discretize space for solving differential systems. The instructor explains various techniques and schemes used for discretizing space, such as Crank-Nicolson and Newmark schemes, highlighting their stability conditions and implementation. The lecture also delves into the implications of different discretization methods on the accuracy and stability of numerical solutions.

Instructor

Marco Picasso

Official source

Ontological neighbourhood

Mathematics

Analysis: Numerical analysis

Algebra: Linear algebra

Related concepts (32)

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.

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.

Stability theory

In mathematics, stability theory addresses the stability of solutions of differential equations and of trajectories of dynamical systems under small perturbations of initial conditions. The heat equation, for example, is a stable partial differential equation because small perturbations of initial data lead to small variations in temperature at a later time as a result of the maximum principle. In partial differential equations one may measure the distances between functions using Lp norms or the sup norm, while in differential geometry one may measure the distance between spaces using the Gromov–Hausdorff distance.

Lyapunov stability

Various types of stability may be discussed for the solutions of differential equations or difference equations describing dynamical systems. The most important type is that concerning the stability of solutions near to a point of equilibrium. This may be discussed by the theory of Aleksandr Lyapunov. In simple terms, if the solutions that start out near an equilibrium point stay near forever, then is Lyapunov stable. More strongly, if is Lyapunov stable and all solutions that start out near converge to , then is said to be asymptotically stable (see asymptotic analysis).

Linear algebra

Linear algebra is the branch of mathematics concerning linear equations such as: linear maps such as: and their representations in vector spaces and through matrices. Linear algebra is central to almost all areas of mathematics. For instance, linear algebra is fundamental in modern presentations of geometry, including for defining basic objects such as lines, planes and rotations. Also, functional analysis, a branch of mathematical analysis, may be viewed as the application of linear algebra to spaces of functions.

Related lectures (51)

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.

Diffusion-Convection: Modeling and Schemes

Covers modeling and numerical schemes for diffusion-convection problems.

Explicit RK Methods

Explains explicit Runge-Kutta methods up to order 4 and conditions for method's order.

Euler Backward Method: ODEs