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

Lecture

Quadrature: Digital Integration

In courses (2)

MATH-250: Advanced numerical analysis I

Construction and analysis of numerical methods for the solution of problems from linear algebra, integration, approximation, and differentiation. ...

MATH-251(c): Numerical analysis

Le cours présente des méthodes numériques pour la résolution de problèmes mathématiques comme des systèmes d'équations linéaires ou non linéaires, l'approximation de fonctions, l'intégration et la dérivation, et les équations différentielles. ...

Description

This lecture covers the concept of quadrature formulas for digital integration, focusing on approaching the integral of a function within a specific range. It explains the definition of quadrature formulas, the degree of accuracy, and the interpolation techniques used. The instructor demonstrates how to achieve accurate results by selecting appropriate integration points and polynomial degrees.

Instructors (3)

Annalisa Buffa

Simone Deparis

Daniel Kressner

Official source

Ontological neighbourhood

Mathematics

Analysis: Numerical analysis

Related concepts (32)

Numerical integration

In analysis, numerical integration comprises a broad family of algorithms for calculating the numerical value of a definite integral, and by extension, the term is also sometimes used to describe the numerical solution of differential equations. This article focuses on calculation of definite integrals. The term numerical quadrature (often abbreviated to quadrature) is more or less a synonym for numerical integration, especially as applied to one-dimensional integrals.

Gaussian quadrature

In numerical analysis, a quadrature rule is an approximation of the definite integral of a function, usually stated as a weighted sum of function values at specified points within the domain of integration. (See numerical integration for more on quadrature rules.) An n-point Gaussian quadrature rule, named after Carl Friedrich Gauss, is a quadrature rule constructed to yield an exact result for polynomials of degree 2n − 1 or less by a suitable choice of the nodes x_i and weights w_i for i = 1, ..., n.

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.

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.

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.

Related lectures (48)

Topology of Riemann Surfaces

Covers the topology of Riemann surfaces, focusing on orientation and orientability.

Polynomial Identity Testing

Covers polynomial identity testing using oracles and random point evaluation, with applications in graph theory and algorithmic aspects.

Stein Algorithm: Polynomial Identity Testing

Explores the Stein algorithm for polynomial identity testing and the minimization of a cut problem.

Algebraic Curves: Normalization

Covers the normalization process of plane algebraic curves, focusing on irreducible polynomials and affine curves.

Interpolation de degré 2 par intervalles MOOC: Numerical Analysis for Engineers