Recent changes to 125: Problem in construction of trinomial treehttps://sourceforge.net/p/quantlib/bugs/125/2014-06-19T16:40:58Z#125 Problem in construction of trinomial tree2014-06-19T16:40:58Z2014-06-19T16:40:58ZLuigi Ballabiohttps://sourceforge.net/u/lballabio/https://sourceforge.netf507047b62b2d102ff9d17260977d7fc4165fbb7<div class="markdown_content"><ul>
<li><strong>status</strong>: closed-out-of-date --> open</li>
</ul></div>#125 Problem in construction of trinomial tree2014-06-19T08:39:24Z2014-06-19T08:39:24ZLuigi Ballabiohttps://sourceforge.net/u/lballabio/https://sourceforge.net91e11cfe311fe8ce72e6336141dd866a05749fe8<div class="markdown_content"><ul>
<li><strong>status</strong>: open --> closed-out-of-date</li>
<li><strong>Group</strong>: --> </li>
</ul></div>Problem in construction of trinomial tree2010-08-15T01:18:06Z2010-08-15T01:18:06ZDILIP MANDALhttps://sourceforge.net/u/mandaldi/https://sourceforge.net5cee124576feb30917f2bb71c0cebd927aff7c88<div class="markdown_content"><p>I am studying this code myself with a hope to get a professional job in this area. I have a PhD in Mechanical Engineering with computational mechanics. <br />
I was studying Hull-White numerical solution with Ornstein Uhlenbeck Process for valuation of Bermuda swaption. There are few mandatory times where the price of the Bermuda swaption will be calculated. But the time steps in the discretization of trinomial tree could be different. I believe there is a potential bug in the construction of trinomial tree when time step is smaller compare to average time step. In the following picture, time step dt4 is very small. Because dt4 is very small, the variance is also very small and dx4 (at line 44 of trinomialtree.cpp) are also very small. The expectation of the stochastic process between time t3 and t4 are almost same, but the number of branching is getting increased by a lot (temp at line 50 of trinomialtree.cpp). Some of the nodes at time step 4 are floating i.e. (the red dots in the picture will have state price of zero). However, it increases the unnecessary computational time. Furthermore some of the active nodes at time step 4 will have probability of one going from one node at time step 4 to another time step 5. Even though, the results are not wrong, the code could be improved a lot for computational efficiency while using trinomial tree. It seems to me that there is a problem in computation of “temp” at line 50 of trinomialtree.cpp. There is an adjustment needed for the computation of “temp” so that tree does not get many unnecessary branches when time step is small. Any comment is appreciated.<br />
Please see the attached document.<br />
Thank you,</p></div>Problem in construction of trinomial tree2010-08-15T01:18:06Z2010-08-15T01:18:06ZDILIP MANDALhttps://sourceforge.net/u/mandaldi/https://sourceforge.neta306b45b4f908685476c03930e2592d0794fdcfe<div class="markdown_content"><p>Ticket 125 has been modified: Problem in construction of trinomial tree<br />
Edited By: Luigi Ballabio (lballabio)<br />
Status updated: u'open' => u'closed-out-of-date'</p></div>Problem in construction of trinomial tree2010-08-15T01:18:06Z2010-08-15T01:18:06ZDILIP MANDALhttps://sourceforge.net/u/mandaldi/https://sourceforge.net69c7770cc7009684ab15645e9e1661c335bb951a<div class="markdown_content"><p>Ticket 125 has been modified: Problem in construction of trinomial tree<br />
Edited By: Luigi Ballabio (lballabio)<br />
Status updated: u'closed-out-of-date' => u'open'</p></div>