Monte Carlo scalable algorithms for Computational Finance

Citations of this article
Mendeley users who have this article in their library.


With the latest developments in the area of advanced computer architectures, we are already seeing large scale machines at petascale level and we are faced with the exascale computing challenge. All these require scalability at system, algorithmic and mathematical model level. In particular, efficient scalable algorithms are required to bridge the performance gap. In this paper, examples of various approaches of designing scalable algorithms for such advanced architectures will be given. We will briefly present our approach to Monte Carlo scalable algorithms for Linear Algebra and explain how these approaches are extended to the field of Computational Finance. Implementation examples will be presented using Linear Algebra Problems and problems from Computational Finance. Furthermore, the corresponding properties of these algorithms will be outlined and discussed. © 2011 Published by Elsevier Ltd.




Alexandrov, V. N., Martel, C. G., & Strasburg, J. (2011). Monte Carlo scalable algorithms for Computational Finance. In Procedia Computer Science (Vol. 4, pp. 1708–1715).

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free