Characterization of the speed of convergence of the trapezoidal rule

Abstract

Summary. Our aim is to determine the precise space of functions for which the trapezoidal rule converges with a prescribed rate as the number of nodes tends to infinity. Excluding or controlling odd functions in some way it is possible to establish a correspondence between the speed of convergence and regularity properties of the function to be integrated. In this way we characterize Sobolev spaces, certain spaces of infinitely differentiable functions, of functions holomorphic in a strip, of entire functions of order greater than 1 and of entire functions of exponential type by the speed of convergence.

On fluctuations of eigenvalues of random permutation matrices

“…is in ℓ 2 by Lemma 4 of [31], p. 131. Thus, using the Poisson summation formula (1.23), 15) which is more than enough to prove that the series ∞ j=1 jR j (f ) 2 is convergent.…”

“…First, we can control directly the size of the R j 's by Jackson type inequalities as in [10], [13] or [31]. Or we may use the Poisson summation formula given in (1.23) and use the decay of the Fourier coefficients of f .…”

Optimal trajectory planning for trains using mixed integer linear programming

“…For the differential equation of time (9), we approximate it by using a trapezoidal integration rule [19], written as the following equation…”

“…The MLD model is subject to the linear constraints (19), (20), and (21), which can be written more compactly as…”

Quadrature formulae with free nodes for periodic functions

“…Let us, by analogy with [6], consider the space C ∞ ( , a, N m ) of functions f : R → C of period 1 and their Fourier coefficients satisfying the inequality…”