A fast algorithm for numerical solutions to Fortet's equation
作者:
Highlights:
•
摘要
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 M⪢1 firms and N discretization points in every dimension the algorithm uses O(nlogn·M·M!·NM(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.
论文关键词:Operations research,Computational finance,Default time algorithm,Survival probability,Fortet's equation,FFT,Firm network economy,Securities pricing,Diffusion processes,Toeplitz matrices
论文评审过程:Received 27 August 2007, Revised 30 August 2007, Available online 11 September 2007.
论文官网地址:https://doi.org/10.1016/j.cam.2007.09.001