首页 | 本学科首页   官方微博 | 高级检索  
     检索      


A fast algorithm for numerical solutions to Fortet's equation
Authors:Gorazd Brumen  
Institution:aIFMF, Department of Mathematics and Physics, University of Ljubljana, Jadranska 19, 1000 Ljubljana, Slovenija
Abstract:A fast algorithm for computation of default times of multiple firms in a structural model is presented. The algorithm uses a multivariate extension of the Fortet's equation and the structure of Toeplitz matrices to significantly improve the computation time. In a financial market consisting of Mnot double greater-than sign1 firms and N discretization points in every dimension the algorithm uses O(nlogn·M·MNM(M-1)/2) operations, where n is the number of discretization points in the time domain. The algorithm is applied to firm survival probability computation and zero coupon bond pricing.
Keywords:Operations research  Computational finance  Default time algorithm  Survival probability  Fortet's equation  FFT  Firm network economy  Securities pricing  Diffusion processes  Toeplitz matrices
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号