A product quadrature rule built from a one-dimensional rule of order has total error…

PHYSICS · Subjective · Fermi University Physics · Mathematical Methods for Physics · Computational Physics · Monte Carlo and lattice simulation of physical systems

Computational Physics, Ch Drawing numbers: random walks and Monte Carlo

Problem

A product quadrature rule built from a one-dimensional rule of order pp has total error that falls as N−p/dN^{-p/d} when its NN nodes are spread evenly over dd dimensions (so N1/dN^{1/d} nodes lie along each axis). A Monte Carlo estimate of the same integral has error that falls as N−1/2N^{-1/2}, whatever dd is. Take p=6p = 6 throughout, corresponding to a sixth-order one-dimensional rule. (a) By comparing the exponents of NN in the two error laws, show that they fall at the same rate only at one particular dimension d∗d^{*}, and give d∗d^{*} in terms of pp. (b) Evaluate d∗d^{*} for p=6p = 6. (c) For d=10d = 10 dimensions, estimate the number of quadrature nodes NQN_Q needed to reach a total error of 1%1\%, using NQ−p/d=0.01N_Q^{-p/d} = 0.01, and compare it with the NMC=104N_{MC} = 10^{4} points a Monte Carlo estimate needs for the same 1%1\% accuracy, from NMC−1/2=0.01N_{MC}^{-1/2} = 0.01. State which method costs fewer evaluations at d=10d = 10. (d) Repeat part (c) at d=16d = 16 dimensions and state which method costs fewer evaluations there.

Browse the problem library