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

Lecture

Polynomials: Legendre and Gauss

In course

MATH-250: Advanced numerical analysis I

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

Description

This lecture covers the proof of the Legendre polynomials properties, including their distinct real roots in the interval (-1,1) and the change of sign of their derivatives. It also explores the use of Legendre polynomials in the Gauss quadrature formula for numerical integration.

Instructors (3)

Annalisa Buffa

Simone Deparis

Daniel Kressner

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.

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.

Gegenbauer polynomials

In mathematics, Gegenbauer polynomials or ultraspherical polynomials C(x) are orthogonal polynomials on the interval [−1,1] with respect to the weight function (1 − x2)α–1/2. They generalize Legendre polynomials and Chebyshev polynomials, and are special cases of Jacobi polynomials. They are named after Leopold Gegenbauer. File:Plot of the Gegenbauer polynomial C n^(m)(x) with n=10 and m=1 in the complex plane from -2-2i to 2+2i with colors created with Mathematica 13.1 function ComplexPlot3D.

Associated Legendre polynomials

In mathematics, the associated Legendre polynomials are the canonical solutions of the general Legendre equation or equivalently where the indices l and m (which are integers) are referred to as the degree and order of the associated Legendre polynomial respectively. This equation has nonzero solutions that are nonsingular on only if l and m are integers with 0 ≤ m ≤ l, or with trivially equivalent negative values. When in addition m is even, the function is a polynomial.

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.

Related lectures (31)

Numerical Integration: Gauss Quadrature

Explores Gauss quadrature for numerical integration, optimizing evaluation points and weights for accurate results.

Rectangle and Trapezoid Formulas MOOC: Numerical Analysis for Engineers

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

Gauss Formulas MOOC: Numerical Analysis for Engineers

Explains the construction and benefits of Gauss formulas for numerical integration.

Attack on RSA using LLL

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

Orthogonal/Orthonormal Bases and Polynomials