We study the optimal general rate of convergence of the n-point quadrature rules of Gauss and Clenshaw–Curtis when applied to functions of limited regularity: if the Chebyshev coefficients decay at a rate O(n−s−1) for some s > 0, Clenshaw–Curtis and Gauss quadrature inherit exactly this rate. The proof (for Gauss, if 0 < s < 2, there is numerical evidence only) is based on work of Curtis, Johns...

When Gauss Patterson rules are used to form a sparse grid, the indexing of the underlying 1D family is crucial. It would seem natural to use the indexing that preserves nesting, but this leads to exponential growth in the order of the 1D rules. If the aim is to efficiently construct a family of sparse grids, indexed to achieve a linearly increasing level of precision, then it is possible to pre...

Abstract In this work, three different integration techniques, which are the numerical, semi-analytical and exact integration techniques are briefly reviewed. Numerical integrations are carried out using three different Quadrature rules, which are the Classical Gauss Quadrature, Gauss Legendre and Generalized Gaussian Quadrature. Line integral method is used to perform semi-analytical integrati...

Generalized averaged Gaussian quadrature formulas may yield higher accuracy than Gauss quadrature formulas that use the same moment information. This makes them attractive to use when moments or modified moments are cumbersome to evaluate. However, generalized averaged Gaussian quadrature formulas may have nodes outside the convex hull of the support of the measure defining the associated Gauss...

Recently Laurie presented a new algorithm for the computation of (2n+1)-point Gauss-Kronrod quadrature rules with real nodes and positive weights. This algorithm first determines a symmetric tridiagonal matrix of order 2n+ 1 from certain mixed moments, and then computes a partial spectral factorization. We describe a new algorithm that does not require the entries of the tridiagonal matrix to b...

We show that the weights of extended Gauss-Legendre quadrature rules are all positive.

We study the kernel Kn,s(z) of the remainder term Rn,s( f ) of Gauss–Turán–Kronrod quadrature rules with respect to one of the generalized Chebyshev weight functions for analytic functions. The location on the elliptic contours where the modulus of the kernel attains its maximum value is investigated. This leads to effective L∞-error bounds of Gauss–Turán–Kronrod quadratures. Following Kronrod,...

Gauss–Legendre quadrature rules are of considerable theoretical and practical interest because of their role in numerical integration and interpolation. In this paper, a series expansion for the zeros of the Legendre polynomials is constructed. In addition, a series expansion useful for the computation of the Gauss–Legendre weights is derived. Together, these two expansions provide a practical ...

We address quadrature-based approximations of the bilinear inverse form u>A−1u, where A is a real symmetric positive definite matrix, and analyze properties of the Gauss, Gauss-Radau, and Gauss-Lobatto quadrature. In particular, we establish monotonicity of the bounds given by these quadrature rules, compare the tightness of these bounds, and derive associated convergence rates. To our knowledg...