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

Lecture

Error Analysis for Galerkin Scheme

In course

MATH-451: Numerical approximation of PDEs

The course is about the derivation, theoretical analysis and implementation of the finite element method for the numerical approximation of partial differential equations in one and two space dimensions. ...

Description

This lecture covers the error analysis for the Galerkin scheme, focusing on the solution of continuous and semi-discrete problems. It discusses the fully discrete solution and the method of orthogonal polynomials of degree 1. The lecture also delves into the error estimation due to discretization and the importance of Galerkin orthogonality. It concludes with the integration in time formula and the implications of different estimation methods.

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

Instructor

Annalisa Buffa

Official source

Ontological neighbourhood

Mathematics

Analysis: Numerical analysis

Related concepts (32)

Orthogonal polynomials

In mathematics, an orthogonal polynomial sequence is a family of polynomials such that any two different polynomials in the sequence are orthogonal to each other under some inner product. The most widely used orthogonal polynomials are the classical orthogonal polynomials, consisting of the Hermite polynomials, the Laguerre polynomials and the Jacobi polynomials. The Gegenbauer polynomials form the most important class of Jacobi polynomials; they include the Chebyshev polynomials, and the Legendre polynomials as special cases.

Classical orthogonal polynomials

In mathematics, the classical orthogonal polynomials are the most widely used orthogonal polynomials: the Hermite polynomials, Laguerre polynomials, Jacobi polynomials (including as a special case the Gegenbauer polynomials, Chebyshev polynomials, and Legendre polynomials). They have many important applications in such areas as mathematical physics (in particular, the theory of random matrices), approximation theory, numerical analysis, and many others.

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.

Hermite polynomials

In mathematics, the Hermite polynomials are a classical orthogonal polynomial sequence. The polynomials arise in: signal processing as Hermitian wavelets for wavelet transform analysis probability, such as the Edgeworth series, as well as in connection with Brownian motion; combinatorics, as an example of an Appell sequence, obeying the umbral calculus; numerical analysis as Gaussian quadrature; physics, where they give rise to the eigenstates of the quantum harmonic oscillator; and they also occur in some cases of the heat equation (when the term is present); systems theory in connection with nonlinear operations on Gaussian noise.

Round-off error

In computing, a roundoff error, also called rounding error, is the difference between the result produced by a given algorithm using exact arithmetic and the result produced by the same algorithm using finite-precision, rounded arithmetic. Rounding errors are due to inexactness in the representation of real numbers and the arithmetic operations done with them. This is a form of quantization error.

Related lectures (34)

Orthogonal/Orthonormal Bases and Polynomials

Explores orthogonal and orthonormal bases, Gram-Schmidt process, and orthogonal polynomials in physics.

Analyse 2: Division euclidienne

Explores the process of division euclidienne in polynomials, emphasizing the importance of polynomial degrees during operations.

Polynomials, Division, and Ideals

Explores polynomials, their operations, and the concept of ideals in polynomial rings.

Attack on RSA using LLL

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

Parameter Estimation of SDEs with Linear Response Theory