Re: Different first and non-first solvers for IterativeBootstrap

Posted by Ferdinando Ametrano-4 on Mar 22, 2017; 3:44pm
URL: http://quantlib.414.s1.nabble.com/Different-first-and-non-first-solvers-for-IterativeBootstrap-tp18151p18152.html

Hi Francois

Newton Raphson is more efficient than Brent, but it requires the calculation of the first derivative. This derivative is almost for free if you have to update a curve from a know previous state, which is not the case in the first iteration.

Moreover, in the first iteration Newton Raphson can diverge because of unstable derivative calculation and so it has to be bounded resorting to bisection in case of failure. In this case Brent is more efficient

hope it helps

Ferdinando

On Wed, Mar 22, 2017 at 12:19 PM, Francois Botha <[hidden email]> wrote:

Hi,

I noticed that in iterativebootstrap.hpp there are 2 solvers defined. Brent , which is used when an existing curve has not been bootstrapped and FiniteDifferenceNewtonSafe, for when an existing curve is updated. 

I was just wondering why the use of 2 solvers. Is it purely for performance reasons? Does the FiniteDifferenceNewtonSafe solver perform better than Brent when a curve already exists? Or are there other reasons?

thanks a lot

------------------------------------------------------------------------------
Check out the vibrant tech community on one of the world's most
engaging tech sites, Slashdot.org! http://sdm.link/slashdot
_______________________________________________
QuantLib-users mailing list
[hidden email]
https://lists.sourceforge.net/lists/listinfo/quantlib-users

------------------------------------------------------------------------------
Check out the vibrant tech community on one of the world's most
engaging tech sites, Slashdot.org! http://sdm.link/slashdot
_______________________________________________
QuantLib-users mailing list
[hidden email]
https://lists.sourceforge.net/lists/listinfo/quantlib-users