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

Lecture

Initial Problem Solutions

In course

MATH-301: Ordinary differential equations

Ce cours donne une introduction rigoureuse au principaux thèmes de la théorie des équations différentielles ordinaires (EDO). Les EDO sont fondamentales pour l'étude des systèmes dynamiques et des équations aux dérivées partielles. Des applications dans ce ...

Description

This lecture covers the description of all the problem solutions and all the solutions of the initial problem, including the completion of the solutions. It also delves into the concept of compactness and uniform continuity. The instructor demonstrates various proofs and interpolations between functions, emphasizing the importance of equicontinuity and compactness in the context of initial auxiliary problems.

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

Instructors (2)

Joachim Krieger

François Samer Genoud

2000-2005 Etudes en Physique à l'EPFL dont une année d'échange à Zürich (ETH, 2002-2003). 2005 Diplôme de Physicien EPF (Master) en physique mathématique, sous la direction du Prof. C.-E. Pfister. 2005-2008 Doctorat sous la direction du Prof. C.A. Stuart, sur l'étude de certaines équations de Schrödinger non-linéaires, en particulier de questions liées à l'existence et la stabilité orbitale d'ondes stationnaires. 2009-2010 Chercheur postdoc FNS à OxPDE, Université d'Oxford. 2010-2013 Chercheur postdoc à l'Université Heriot-Watt, Edimbourg. 2013-2014 Chercheur postdoc à l'Université de Vienne. 2015-2017 Professeur Assistant à TU Delft. 2017-2018 Professeur Associé à l'Université libre de Bruxelles. 2018- Directeur du CMS Domaines d'intérêt scientifique: analyse non-linéaire, calcul des variations, équations aux dérivées partielles, physique mathématique et physique théorique en général.

Official source

Ontological neighbourhood

Mathematics

Topology: General topology

Related concepts (32)

Interpolation

In the mathematical field of numerical analysis, interpolation is a type of estimation, a method of constructing (finding) new data points based on the range of a discrete set of known data points. In engineering and science, one often has a number of data points, obtained by sampling or experimentation, which represent the values of a function for a limited number of values of the independent variable. It is often required to interpolate; that is, estimate the value of that function for an intermediate value of the independent variable.

Multivariate interpolation

In numerical analysis, multivariate interpolation is interpolation on functions of more than one variable (multivariate functions); when the variates are spatial coordinates, it is also known as spatial interpolation. The function to be interpolated is known at given points and the interpolation problem consists of yielding values at arbitrary points . Multivariate interpolation is particularly important in geostatistics, where it is used to create a digital elevation model from a set of points on the Earth's surface (for example, spot heights in a topographic survey or depths in a hydrographic survey).

Compact space

In mathematics, specifically general topology, compactness is a property that seeks to generalize the notion of a closed and bounded subset of Euclidean space. The idea is that a compact space has no "punctures" or "missing endpoints", i.e., it includes all limiting values of points. For example, the open interval (0,1) would not be compact because it excludes the limiting values of 0 and 1, whereas the closed interval [0,1] would be compact.

Polynomial interpolation

In numerical analysis, polynomial interpolation is the interpolation of a given bivariate data set by the polynomial of lowest possible degree that passes through the points of the dataset. Given a set of n + 1 data points , with no two the same, a polynomial function is said to interpolate the data if for each . There is always a unique such polynomial, commonly given by two explicit formulas, the Lagrange polynomials and Newton polynomials.

Bilinear interpolation

In mathematics, bilinear interpolation is a method for interpolating functions of two variables (e.g., x and y) using repeated linear interpolation. It is usually applied to functions sampled on a 2D rectilinear grid, though it can be generalized to functions defined on the vertices of (a mesh of) arbitrary convex quadrilaterals. Bilinear interpolation is performed using linear interpolation first in one direction, and then again in another direction.

Related lectures (48)

Harmonic Forms: Main Theorem

Explores harmonic forms on Riemann surfaces and the uniqueness of solutions to harmonic equations.

Darboux Theorem: Advanced Analysis I

Explores the Darboux theorem for continuous functions on closed intervals, emphasizing uniform continuity and function behavior implications.

Numerical Integration

Explores numerical integration, properties of integrals, composite formulas, and error estimation.

Interpolation of Functions

Covers interpolation of functions, multilayer perceptron, hidden layers, and Lagrange polynomials.

Differentiating under the integral sign