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

Lecture

Simpson's Rule

Description

This lecture introduces Simpson's rule as a three-point formula to approximate integrals over the interval [-1, 1]. By using three points (-1, 0, 1) and Lagrange basis polynomials, the weights for the formula are derived. The lecture demonstrates the accuracy of Simpson's rule for quadratic polynomials and extends the analysis to cubic polynomials. It concludes by discussing the error estimation for continuously differentiable functions using Simpson's rule.

In MOOC

Numerical Analysis for Engineers

Official source

Quiz

Ontological neighbourhood

Mathematics

Analysis: Numerical analysis

Related concepts (26)

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.

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.

Lagrange polynomial

In numerical analysis, the Lagrange interpolating polynomial is the unique polynomial of lowest degree that interpolates a given set of data. Given a data set of coordinate pairs with the are called nodes and the are called values. The Lagrange polynomial has degree and assumes each value at the corresponding node, Although named after Joseph-Louis Lagrange, who published it in 1795, the method was first discovered in 1779 by Edward Waring. It is also an easy consequence of a formula published in 1783 by Leonhard Euler.

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.

Verlet integration

Verlet integration (vɛʁˈlɛ) is a numerical method used to integrate Newton's equations of motion. It is frequently used to calculate trajectories of particles in molecular dynamics simulations and computer graphics. The algorithm was first used in 1791 by Jean Baptiste Delambre and has been rediscovered many times since then, most recently by Loup Verlet in the 1960s for use in molecular dynamics. It was also used by P. H. Cowell and A. C. C.

Related lectures (33)

Numerical Integration: Lagrange Interpolation, Simpson Rules

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

Composite Quadrature Formula

Explores the composite quadrature formula, digital integration, and numerical integration techniques using interpolating polynomials.

Numerical Integration: Newton-Cotes Integration

Covers Newton-Cotes integration, Trapezoid rule, Simpson rules, and numerical quadrature conditioning.

Numerical Integration: Newton-Cotes and Trapezoidal Rule

Covers numerical integration methods, including Newton-Cotes and the Trapezoidal Rule.

Molecular dynamics under constraints