Abstract
AbstractIn numerical integration, cubature methods are effective, especially when the integrands can be well-approximated by known test functions, such as polynomials. However, the construction of cubature formulas has not generally been known, and existing examples only represent the particular domains of integrands, such as hypercubes and spheres. In this study, we show that cubature formulas can be constructed for probability measures provided that we have an i.i.d. sampler from the measure and the mean values of given test functions. Moreover, the proposed method also works as a means of data compression, even if sufficient prior information of the measure is not available.
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,General Engineering
Reference30 articles.
1. Bardenet, R., Hardy, A.: Monte Carlo with determinantal point processes. Ann. Appl. Probab. 30(1), 368–417 (2016)
2. Bayer, C., Teichmann, J.: The proof of Tchakaloff’s theorem. Proc. Am. Math. Soc. 134(10), 3035–3040 (2006)
3. Bittante, C., De Marchi, S., Elefante, G.: A new quasi-Monte Carlo technique based on nonnegative least squares and approximate Fekete points. Numer. Math. Theory Methods Appl. 9(4), 640–663 (2016)
4. Bonnice, W., Klee, V.L.: The generation of convex hulls. Mathematische Annalen 152(1), 1–29 (1963)
5. Carathéodory, C.: Über den variabilitätsbereich der koeffizienten von potenzreihen, die gegebene werte nicht annehmen. Mathematische Annalen 64(1), 95–115 (1907)
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献