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. The modern formulation using orthogonal polynomials was developed by Carl Gustav Jacobi in 1826. The most common domain of integration for such a rule is taken as [−1, 1], so the rule is stated as which is exact for polynomials of degree 2n − 1 or less. This exact rule is known as the Gauss-Legendre quadrature rule. The quadrature rule will only be an accurate approximation to the integral above if f (x) is well-approximated by a polynomial of degree 2n − 1 or less on [−1, 1]. The Gauss-Legendre quadrature rule is not typically used for integrable functions with endpoint singularities. Instead, if the integrand can be written as where g(x) is well-approximated by a low-degree polynomial, then alternative nodes x_i' and weights w_i' will usually give more accurate quadrature rules. These are known as Gauss-Jacobi quadrature rules, i.e., Common weights include (Chebyshev–Gauss) and . One may also want to integrate over semi-infinite (Gauss-Laguerre quadrature) and infinite intervals (Gauss–Hermite quadrature). It can be shown (see Press, et al., or Stoer and Bulirsch) that the quadrature nodes x_i are the roots of a polynomial belonging to a class of orthogonal polynomials (the class orthogonal with respect to a weighted inner-product). This is a key observation for computing Gauss quadrature nodes and weights. For the simplest integration problem stated above, i.e., f(x) is well-approximated by polynomials on , the associated orthogonal polynomials are Legendre polynomials, denoted by Pn(x).

About this result
This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.
Ontological neighbourhood
Related courses (10)
MATH-251(c): Numerical analysis
Le cours présente des méthodes numériques pour la résolution de problèmes mathématiques comme des systèmes d'équations linéaires ou non linéaires, approximation de fonctions, intégration et dérivation
CIVIL-449: Nonlinear analysis of structures
This course provides an introduction to the nonlinear modelling of civil engineering structures.
MATH-250: Advanced numerical analysis I
Construction and analysis of numerical methods for the solution of problems from linear algebra, integration, approximation, and differentiation.
Show more
Related lectures (49)
Numerical Analysis: Quadrature Formulas
Explores the theory and application of quadrature formulas for numerical analysis.
Nonlinear Geometric Transformation: Analysis and Approximations
Explores nonlinear geometric transformations in structural engineering, emphasizing accurate integration methods and practical applications.
Finite Element Development: Higher Order Basis Functions
Explores higher-order basis functions in finite element development and precision of models.
Show more
Related publications (54)

Factorized structure of the long-range two-electron integrals tensor and its application in quantum chemistry

Laura Grigori

We introduce two new approximation methods for the numerical evaluation of the long-range component of the range-separated Coulomb potential and the approximation of the resulting high dimensional Two-Electron Integrals tensor (TEI) with long-range interac ...
San Diego2023

Quadrature-free immersed isogeometric analysis

Pablo Antolin Sanchez, Thibaut Hirschler

This paper presents a novel method for solving partial differential equations on three-dimensional CAD geometries by means of immersed isogeometric discretizations that do not require quadrature schemes. It relies on a newly developed technique for the eva ...
SPRINGER2022

Support and approximation properties of Hermite splines

Michaël Unser, Julien René Pierre Fageot, Virginie Sophie Uhlmann, Shayan Aziznejad

In this paper, we formally investigate two mathematical aspects of Hermite splines that are relevant to practical applications. We first demonstrate that Hermite splines are maximally localized, in the sense that the size of their support is minimal among ...
2020
Show more
Related concepts (11)
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 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.
Chebyshev polynomials
The Chebyshev polynomials are two sequences of polynomials related to the cosine and sine functions, notated as and . They can be defined in several equivalent ways, one of which starts with trigonometric functions: The Chebyshev polynomials of the first kind are defined by Similarly, the Chebyshev polynomials of the second kind are defined by That these expressions define polynomials in may not be obvious at first sight, but follows by rewriting and using de Moivre's formula or by using the angle sum formulas for and repeatedly.
Show more

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.