Share:


Parallelization of the α‐stable modelling algorithms

    Igoris Belovas Affiliation
    ; Vadimas Starikovičius Affiliation

Abstract

Stable distributions have a wide sphere of application: probability theory, physics, electronics, economics, sociology. Particularly important role they play in financial mathematics, since the classical models of financial market, which are based on the hypothesis of the normality, often become inadequate. However, the practical implementation of stable models is a nontrivial task, because the probability density functions of α‐stable distributions have no analytical representations (with a few exceptions). In this work we exploit the parallel computing technologies for acceleration of numerical solution of stable modelling problems. Specifically, we are solving the stable law parameters estimation problem by the maximum likelihood method. If we need to deal with a big number of long financial series, only the means of parallel technologies can allow us to get results in a adequate time. We have distinguished and defined several hierarchical levels of parallelism. We show that coarse‐grained Multi‐Sets parallelization is very efficient on computer clusters. Fine‐grained Maximum Likelihood level is very efficient on shared memory machines with Symmetric multiprocessing and Hyper‐threading technologies. Hybrid application, which is utilizing both of those levels, has shown superior performance compared to single level (MS) parallel application on cluster of Pentium 4 HT nodes.


First Published Online: 14 Oct 2010

Keyword : Parallel algorithms, stable modelling, financial mathematics

How to Cite
Belovas, I., & Starikovičius, V. (2007). Parallelization of the α‐stable modelling algorithms. Mathematical Modelling and Analysis, 12(4), 409-418. https://doi.org/10.3846/1392-6292.2007.12.409-418
Published in Issue
Dec 31, 2007
Abstract Views
501
PDF Downloads
258
Creative Commons License

This work is licensed under a Creative Commons Attribution 4.0 International License.