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

Lecture

Numerical Integration: Gauss Quadrature

In course

ChE-312: Numerical methods

This course introduces students to modern computational and mathematical techniques for solving problems in chemistry and chemical engineering. The use of introduced numerical methods will be demonstrated using the Python programming language. ...

Description

This lecture covers the Gauss quadrature method for numerical integration, which optimizes the points where the function is evaluated and the corresponding weights. It explains the Gauss-Legendre formula, solving a nonlinear system of equations, and achieving exact solutions for polynomials up to cubic dependency. The lecture also discusses the advantages of Gaussian quadrature over Newton-Cotes integration, emphasizing the adjustment of weights and nodes based on orthogonal polynomials.

Instructors (2)

Kevin Sivula

Ljubisa Miskovic

Ljubisa Miskovic earned his Ph.D. degree in Automatic Control from the Swiss Federal Institute of Technology (EPFL) under the co-supervision of Dominique Bonvin and Alireza Karimi, in 2006. He pursued his postdoctoral studies at the Centre for Systems Engineering and Applied Mechanics, Universite Catholique de Louvain with Michel Gevers before moving to the laboratory of Vassily Hatzimanikatis at the EPFL. In 2010, he became a research scientist. His research interests include systems biology, metabolic engineering, synthetic biology, data-driven control design, system identification, stochastic processes and estimation theory.

Official source

Ontological neighbourhood

Mathematics

Analysis: Numerical analysis

Related concepts (24)

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.

Legendre polynomials

In mathematics, Legendre polynomials, named after Adrien-Marie Legendre (1782), are a system of complete and orthogonal polynomials with a vast number of mathematical properties and numerous applications. They can be defined in many ways, and the various definitions highlight different aspects as well as suggest generalizations and connections to different mathematical structures and physical and numerical applications. Closely related to the Legendre polynomials are associated Legendre polynomials, Legendre functions, Legendre functions of the second kind, and associated Legendre functions.

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

Numerical Integration: Lagrange Interpolation, Simpson Rules

Explains Lagrange interpolation for numerical integration and introduces Simpson's rules.

Attack on RSA using LLL

Covers Coppersmith's method for attacking RSA encryption by efficiently finding small roots of polynomials modulo N.

Polynomials: Legendre and Gauss

Explores Legendre polynomials properties and their use in numerical integration.

Rectangle and Trapezoid Formulas MOOC: Numerical Analysis for Engineers

Covers numerical integration using rectangle and trapezoid formulas, with decreasing error as step size decreases.

Numerical Integration: Newton-Cotes and Trapezoidal Rule