A popular way to value (Bermudan) swaption in a Hull-White or extended Vasicek model is to use a tree approach. In this note we show that a more direct approach through iterated numerical integration is also possible. 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 we can reduce it to a complexity $pN^2$ versus a quadratic $(pN)^2$ in the tree. We also provide a semi-explicit formula that leads to a faster converging implementation.
Download Info
To download:
If you experience problems downloading a file, check if you have the
proper application to
view it first. Information about this may be contained
in the File-Format links below. In case of further problems read
the IDEAS help
page. Note that these files are not on the IDEAS
site. Please be patient as the files may be large.
Publisher Info
Paper provided by EconWPA in its series Finance with number
0505023.
References listed on IDEAS Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
Cited by: (explanations, Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.)