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

Lecture

Numerical Testing

Description

This lecture covers numerical testing methods, including trapezoidal rule, Gauss two-point formula, and Gauss three-point formula. It explains the integration process with examples and calculations using Octave.

In MOOC

Numerical Analysis for Engineers

Official source

Related concepts (16)

Trapezoidal rule

In calculus, the trapezoidal rule (also known as the trapezoid rule or trapezium rule; see Trapezoid for more information on terminology) is a technique for approximating the definite integral. The trapezoidal rule works by approximating the region under the graph of the function as a trapezoid and calculating its area. It follows that The trapezoidal rule may be viewed as the result obtained by averaging the left and right Riemann sums, and is sometimes defined this way.

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.

Simpson's rule

In numerical integration, Simpson's rules are several approximations for definite integrals, named after Thomas Simpson (1710–1761). The most basic of these rules, called Simpson's 1/3 rule, or just Simpson's rule, reads In German and some other languages, it is named after Johannes Kepler, who derived it in 1615 after seeing it used for wine barrels (barrel rule, Keplersche Fassregel). The approximate equality in the rule becomes exact if f is a polynomial up to and including 3rd degree.

Riemann sum

In mathematics, a Riemann sum is a certain kind of approximation of an integral by a finite sum. It is named after nineteenth century German mathematician Bernhard Riemann. One very common application is approximating the area of functions or lines on a graph, but also the length of curves and other approximations. The sum is calculated by partitioning the region into shapes (rectangles, trapezoids, parabolas, or cubics) that together form a region that is similar to the region being measured, then calculating the area for each of these shapes, and finally adding all of these small areas together.

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

Quadrature Formulas: Numerical Integration

Covers the concept of numerical integration using quadrature formulas.

Numerical Integration: Newton-Cotes Integration

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

Numerical Integration: Quadrature Formulas MOOC: Numerical Analysis for Engineers

Covers numerical integration using quadrature formulas to approximate integrals of continuous functions over intervals.

Numerical Integration MOOC: Numerical Analysis for Engineers

Explores numerical methods for approximating integrals and discusses various integration formulas' accuracy and order of approximation.

Numerical Integration: Newton-Cotes and Trapezoidal Rule