arXiv Analytics

Sign in

arXiv:2201.08424 [math.NA]AbstractReferencesReviewsResources

An Analysis of Approximation Algorithms for Iterated Stochastic Integrals and a Julia and MATLAB Simulation Toolbox

Felix Kastner, Andreas Rößler

Published 2022-01-20Version 1

For the approximation and simulation of twofold iterated stochastic integrals and the corresponding L\'{e}vy areas w.r.t. a multi-dimensional Wiener process, we review four algorithms based on a Fourier series approach. Especially, the very efficient algorithm due to Wiktorsson and a newly proposed algorithm due to Mrongowius and R\"ossler are considered. To put recent advances into context, we analyse the four Fourier-based algorithms in a unified framework to highlight differences and similarities in their derivation. A comparison of theoretical properties is complemented by a numerical simulation that reveals the order of convergence for each algorithm. Further, concrete instructions for the choice of the optimal algorithm and parameters for the simulation of solutions for stochastic (partial) differential equations are given. Additionally, we provide advice for an efficient implementation of the considered algorithms and incorporated these insights into an open source toolbox that is freely available for both Julia and MATLAB programming languages. The performance of this toolbox is analysed by comparing it to some existing implementations, where we observe a significant speed-up.

Related articles:
arXiv:2012.03092 [math.NA] (Published 2020-12-05)
Approximation Algorithms for Sparse Best Rank-1 Approximation to Higher-Order Tensors
arXiv:1512.08408 [math.NA] (Published 2015-12-28)
Multiscale models and approximation algorithms for protein electrostatics
arXiv:2506.17992 [math.NA] (Published 2025-06-22)
Algorithms for pointwise and piecewise polynomial approximations to the trigonometric functions