Abstract
We introduce a new methodology for computing Hessians from algorithms for function evaluation, using backwards methods. We show that the complexity of the Hessian calculation is a linear function of the number of state variables times the complexity of the original algorithm. We apply our results to computing the Gamma matrix of multi-dimensional financial derivatives including Asian Baskets and cancellable swaps. In particular, our algorithm for computing Gammas of Bermudan cancellable swaps is order O(n^2) per step in the number of rates. We present numerical results demonstrating that the computing all n(n 1)/2 Gammas in the LMM takes roughly n/3 times as long as computing the price.
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.
