A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is
We present a new method for the approximation of Wiener integrals and provide an explicit error bound for a class F of smooth integrands. The purely deterministic algorithm is a sequence of quadrature formulas for the Wiener measure, where the knots are piecewise linear functions. It uses ideas of Smolyak, as well as the multiscale decomposition of the Wiener measure due to Le vy and Ciesielski. For the class F we obtain n(=) max(1, 2= &4 ), where n(=) is the number of integrand evaluationsdoi:10.1006/jcom.1999.0518 fatcat:kewuq5p5jfcpfmgnieirnlsvr4