Lattice rules and polynomial lattice rules are quadrature rules for approximating integrals over the s-dimensional unit cube. Since no explicit constructions of such quadrature methods are known for dimensions s > 2, one usually has to resort to computer search algorithms. The fast component-by-component approach is a useful algorithm for finding suitable quadrature rules. We present a modifica...

This paper is concerned with the approximation of matrix functionals defined by a large, sparse or structured, symmetric definite matrix. These functionals are Stieltjes integrals with a measure supported on a compact real interval. Rational Gauss quadrature rules that are designed to exactly integrate Laurent polynomials with a fixed pole in the vicinity of the support of the measure may yield...

Several algorithms are given and compared for computing Gauss quadrature rules. It is shown that given the three term recurrence relation for the orthogonal polynomials generated by the weight function, the quadrature rule may be generated by computing the eigenvalues and first component of the orthornormalized eigenvectors of a symmetric tridiagonal matrix. An algorithm is also presented for c...

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...

Abstract. Gauss quadrature is a popular approach to approximate the value of a desired integral determined by a measure with support on the real axis. Laurie proposed an (n+1)-point quadrature rule that gives an error of the same magnitude and of opposite sign as the associated n-point Gauss quadrature rule for all polynomials of degree up to 2n + 1. This rule is referred to as an anti-Gauss ru...

A new class of quadrature rules for the integration of both regular and singular functions is constructed and analyzed. For each rule the quadrature weights are positive and the class includes rules of arbitrarily high-order convergence. The quadratures result from alterations to the trapezoidal rule, in which a small number of nodes and weights at the ends of the integration interval are repla...

After some remarks on the convergence order of the classical gaussian formula for the numerical evaluation of integrals on unbounded interval, the authors develop a new quadrature rule for the approximation of such integrals of interest in the practical applications. The convergence of the proposed algorithm is considered and some numerical examples are given.

Newton-Cotes quadrature rules are based on polynomial interpolation in a set of equidistant points. They are very useful in applications where sampled function values are only available on a regular grid. Yet, these rules rapidly become unstable for high orders. In this paper we review two techniques to construct stable high-order quadrature rules using equidistant quadrature points. The stabil...

WENJUN LIU, YONG JIANG, AND ADNAN TUNA Abstract. By introducing a parameter, we give a unified generalization of some quadrature rules, which not only unify the recent results about error bounds for generalized mid-point, trapezoid and Simpson’s rules, but also give some new error bounds for other quadrature rules as special cases. Especially, two sharp error inequalities are derived when n is ...

Abstract. This paper presents a modification of Krylov subspace spectral (KSS) methods, which build on the work of Golub, Meurant and others, pertaining to moments and Gaussian quadrature to produce high-order accurate approximate solutions to variable-coefficient time-dependent PDEs. Whereas KSS methods currently use Lanczos iteration to compute the needed quadrature rules, our modification us...