A computable figure of merit for quasi-Monte Carlo point sets

From MaRDI portal
(Redirected from Publication:5401700)




Abstract: Let mathcalPsubset[0,1)S be a finite point set of cardinality N in an S-dimensional cube, and let f:[0,1)SomathbbR be an integrable function. A QMC integration of f by mathcalP is the average of values of f at each point in mathcalP, which approximates the integration of f over the cube. Assume that mathcalP is constructed from an mathbbF2-vector space Psubset(F2n)S by means of a digital net with n-digit precision. As an n-digit discretized version of Josef Dick's method, we introduce Walsh figure of merit (WAFOM) extnormalWF(P) of P, which satisfies a Koksma-Hlawka type inequality, namely, QMC integration error is bounded by CS,n||f||nextnormalWF(P) under n-smoothness of f, where CS,n is a constant depending only on S,n. We show a Fourier inversion formula for extnormalWF(P) which is computable in O(nSN) steps. This effectiveness enables us a random search for P with small value of extnormalWF(P), which would be difficult for other figures of merit such as discrepancy. From an analogy to coding theory, we expect that random search may find better point sets than mathematical constructions. In fact, a na"{i}ve search finds point sets P with small extnormalWF(P). In experiments, we show better performance of these point sets in QMC integration than widely used QMC rules. We show some experimental evidence on the effectiveness of our point sets to even non-smooth integrands appearing in finance.









This page was built for publication: A computable figure of merit for quasi-Monte Carlo point sets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5401700)