Exactness of quadrature formulas

01/23/2021
by   Lloyd N. Trefethen, et al.
0

The standard design principle for quadrature formulas is that they should be exact for integrands of a given class, such as polynomials of a fixed degree. We show how this principle fails to predict the actual behavior in four cases: Newton-Cotes, Clenshaw-Curtis, Gauss-Legendre, and Gauss-Hermite quadrature. Three further examples are mentioned more briefly.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/28/2021

Gram quadrature: numerical integration with Gram polynomials

The numerical integration of an analytical function f(x) using a finite ...
research
02/12/2021

Exactness and Convergence Properties of Some Recent Numerical Quadrature Formulas for Supersingular Integrals of Periodic Functions

In a recent work, we developed three new compact numerical quadrature fo...
research
11/20/2017

XSAT of Exact Linear CNF Classes

It is shown that l-regularity implies k-uniformity in exact linear CNF f...
research
06/01/2018

Distance Distribution to Received Words in Reed-Solomon Codes

n this paper, we obtain an asymptotic formula for the number of codeword...
research
05/18/2019

Applications of the analogy between formulas and exponential polynomials to equivalence and normal forms

We show some applications of the formulas-as-polynomials correspondence:...
research
12/02/2019

Exponential Resolution Lower Bounds for Weak Pigeonhole Principle and Perfect Matching Formulas over Sparse Graphs

We show exponential lower bounds on resolution proof length for pigeonho...
research
10/23/2022

Radical isogenies and modular curves

This article explores the connection between radical isogenies and modul...

Please sign up or login with your details

Forgot password? Click here to reset