Abstract

A popular way to value (Bermudan) swaption in a Hull-White or extended Vasicek model is to use a tree or PDE approach. A more direct approach through iterated numerical integration is developed. A brute force numerical integration would lead to a complexity exponential in the number of exercise dates in the base of the number of points (p^N). By carefully choosing the integration points and their order, the complexity can be reduced to 4pN versus the quadratic complexity (pN)^2 in the tree. A semi-explicit formula leading to a faster converging implementation is also proposed.

Full Text
Published version (Free)

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 call