Journal of Computational Finance

The modified willow tree algorithm

Ulrich G. Haussmann, Liqing Yan


We develop a modified willow tree algorithm for option pricing. Our numerical results show that the modified algorithm approximates the true prices more quickly and precisely than the binomial tree algorithm, especially in d-factor models for d = 2, 3, 4, 5. A bound on the theoretical rate of convergence of the modified willow tree algorithm is established.

Sorry, our subscription options are not loading right now

Please try again later. Get in touch with our customer services team if this issue persists.

New to View our subscription options

You need to sign in to use this feature. If you don’t have a account, please register for a trial.

Sign in
You are currently on corporate access.

To use this feature you will need an individual account. If you have one already please sign in.

Sign in.

Alternatively you can request an individual account here