Random number generation and quasi-Monte Carlo methods
Random number generation and quasi-Monte Carlo methods
Numerical Recipes in C++: the art of scientific computing
Numerical Recipes in C++: the art of scientific computing
Compact FPGA-based True and Pseudo Random Number Generators
FCCM '03 Proceedings of the 11th Annual IEEE Symposium on Field-Programmable Custom Computing Machines
An embedded true random number generator for FPGAs
FPGA '04 Proceedings of the 2004 ACM/SIGDA 12th international symposium on Field programmable gate arrays
Simplified order 4.0 weak Taylor schemes for additive noise
Journal of Computational and Applied Mathematics
Higher-order semi-implicit Taylor schemes for Itô stochastic differential equations
Journal of Computational and Applied Mathematics
Mathematics and Computers in Simulation
Hi-index | 0.00 |
Monte Carlo simulation of weak approximations of stochastic differential equations constitutes an intensive computational task. In applications such as finance, for instance, to achieve ''real time'' execution, as often required, one needs highly efficient implementations of the multi-point distributed random number generator underlying the simulations. In this paper, a fast and flexible dedicated hardware solution on a field programmable gate array is presented. A comparative performance analysis between a software-only and the proposed hardware solution demonstrates that the hardware solution is bottleneck-free, retains the flexibility of the software solution and significantly increases the computational efficiency. Moreover, simulations in applications such as economics, insurance, physics, population dynamics, epidemiology, structural mechanics, chemistry and biotechnology can benefit from the obtained speedups.