We investigate the pricing performance of eight trinomial trees and one binomial tree, which was found to be most effective in an earlier study, under 20 different implementation methodologies for pricing American put options. We conclude that the binomial tree, the Tian third‐order...

We develop an efficient algorithm to implement the adjoint method that computes sensitivities of an interest rate derivative to different underlying rates in the co-terminal swap-rate market model. The order of computation per step of the new method is shown to be proportional to the number of...

We develop a new method for finding upper bounds for Bermudan swaptions in a swap-rate market model. By comparing with lower bounds found by exercise boundary parametrization, we find that the bounds are well within bid-offer spread. As an application, we study the dependence of Bermudan...

We introduce a new calibration methodology that allows perfect fitting of the displaced diffusion LIBOR market model to caplets and co-terminal swaptions, whilst avoiding global optimizations. The approach works by regarding a forward rate as a difference of swap rates and then bootstrapping...

We present an extension of the LIBOR market model which allows for stochastic instantaneous volatilities of the forward rates in a displaced-diffusion setting. We show that virtually all the powerful and important approximations that apply in the deterministic setting can be successfully and...

We introduce a set of improvements which allow the calculation of very tight lower bounds for Bermudan derivatives using Monte Carlo simulation. These tight lower bounds can be computed quickly, and with minimal hand-crafting. Our focus is on accelerating policy iteration to the point where it...

We first develop an efficient algorithm to compute Deltas of interest rate derivatives for a number of standard market models. The computational complexity of the algorithms is shown to be proportional to the number of rates times the number of factors per step. We then show how to extend the...

We present a new non-nested approach for computing additive upper bounds for callable derivatives using Monte Carlo simulation. It relies on the regression of Greeks computed using adjoint methods. We also show that it is possible to early terminate paths once points of optimal exercise have...

We compare the bias in binomial trees against that in certain analytical/numerical valuation techniques with which they disagree. We consider the CRR tree, the COS method and the Leisen--Reimer as well as the Prekopa--Szantai exponentially smoothed method. We conclude that the binomial trees are...

We present a new method for truncating binomial trees based on using a tolerance to control truncation errors and apply it to the Tian tree together with acceleration techniques of smoothing and Richardson extrapolation. For both the current (based on standard deviations) and the new (based on...