Numerical solution of stochastic differential equations with jumps in finance

Publication Type:
Thesis
Issue Date:
2007
Full metadata record
Files in This Item:
Filename Description Size
Front01.pdf1.01 MB
Adobe PDF
ThumbnailWhole02.pdf18.22 MB
Adobe PDF
This thesis concerns the design and analysis of new discrete time approximations for stochastic differential equations (SDEs) driven by Wiener processes and Poisson random measures. In financial modelling, SDEs with jumps are often used to describe the dynamics of state variables such as credit ratings, stock indices, interest rates, exchange rates and electricity prices. The jump component can capture event-driven uncertainties, such as corporate defaults, operational failures or central bank announcements. The thesis proposes new, efficient, and numerically stable strong and weak approximations. Strong approximations provide efficient tools for problems such as filtering, scenario analysis and hedge simulation, while weak approximations are useful for handling problems such as derivative pricing, the evaluation of moments, and the computation of risk measures and expected utilities. The discrete time approximations proposed are divided into regular and jump-adapted schemes. Regular schemes employ time discretizations that do not include the jump times of the Poisson measure. Jump-adapted time discretizations, on the other hand, include these jump times. The first part of the thesis introduces stochastic expansions for jump diffusions and proves new, powerful lemmas providing moment estimates of multiple stochastic integrals. The second part presents strong approximations with a new strong convergence theorem for higher order general approximations. Innovative strong derivative-free and predictor-corrector schemes are derived. Furthermore, the strong convergence of higher order schemes for pure jump SDEs is established under conditions weaker than those required for jump diffusions. The final part of the thesis presents a weak convergence theorem for jump-adapted higher order general approximations. These approximations include new derivative-free, predictor-corrector, and simplified schemes. Finally, highly efficient implementations of simplified weak schemes based on random bit generators and hardware accelerators are developed and tested.
Please use this identifier to cite or link to this item: