A constraint on extensible quadrature rules

By Art B. Owen. 2014

14 citations recorded by the source corpus.

Here we consider integration methods with error bounded below by $$mn^{-\alpha }$$mn-α for a constant $$m>0$$m>0 and rate $$\alpha >1$$α>1. Suppose that simple averages along an extensible sequence have error at most $$Mn^{-\alpha }$$Mn-α for all $$n$$n in an infinite sequence of sample sizes $$n_1<n_2<\cdots $$n1<n2<⋯. The main result in this paper is a lower bound $$n_{k+1}/n_k\ge \rho $$nk+1/nk≥ρ where $$1<\rho <2$$1<ρ<2, so that the special sample sizes must grow at least geometrically. The bound $$\rho $$ρ increases with $$\alpha $$α and with $$m/M$$m/M. This result always rules out arithmetic sequences but never rules out sample size doubling. The same constraint holds in a root mean square error setting for any random sequence of points. Those random points need not be independent, nor uniformly distributed.

Subfields: Applied Mathematics, Computer Graphics and Computer-Aided Design, Numerical Analysis

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Applied Mathematics

  1. Michael A. Osborne
  2. Nicolas Chopin
  3. Chris J. Oates
  4. Mark A. Girolami

In Computer Graphics and Computer-Aided Design

  1. Chris J. Oates
  2. Mark A. Girolami

In Numerical Analysis

  1. Chris J. Oates
  2. Mark A. Girolami
  3. François‐Xavier Briol
  4. Michael A. Osborne
  5. Nicolas Chopin
  6. Qiang Liu
  7. Dilin Wang
  8. Jason D. Lee

Citations in the corpus