Mathematics of Computation · 1999 · 15 citations · 6 references
Numerical AnalysisEngineeringStochastic OptimizationQuasi-monte Carlo ApproximationMonte CarloMonte Carlo MethodQuasi-randomized Runge-kutta MethodMonte Carlo MethodsQuasi-monte Carlo MethodQuasi-monte Carlo EstimateMonte Carlo SamplingSequential Monte CarloApproximation TheoryStochastic Differential Equation
We analyze a quasi-Monte Carlo method to solve the initial-value problem for a system of differential equations $yâ (t) = f (t,y(t))$. The function $f$ is smooth in $y$ and we suppose that $f$ and $D_y^1f$ are of bounded variation in $t$ and that $D_{y}^2 f$ is bounded in a neighborhood of the graph of the solution. The method is akin to the second order Heun method of the Runge-Kutta family. It uses a quasi-Monte Carlo estimate of integrals. The error bound involves the square of the step size as well as the discrepancy of the point set used for quasi-Monte Carlo approximation. Numerical experiments show that the quasi-randomized method outperforms a recently proposed randomized numerical method.
6
Irregularities of distribution, VII
Wolfgang Schmidt · Acta Arithmetica · 1972 · 266 citations · Full text
On irregularities of distribution
William Chen · Mathematika · 1980 · 64 citations