Abstract
The discretization of probability density functions (pdf's) is often necessary in financial modelling, especially in derivatives pricing and hedging, where certain pdf characteristics (e.g. fat tails) can have a disproportionate effect on prices. We present an exact dynamic programming (DP) algorithm to perform such a discretization optimally. We investigate the parallelisation of the DP algorithm and show that an almost linear speed-up is possible. For a large number of dimensions an approximate algorithm for the discretization of multivariate pdf's is presented. Computational results are reported for all variants of the algorithm when applied to different pdf's with various required levels of discretization.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
