Re: gnumeric's solver and parallel computing

I also noticed that the newton iterations converge a lot more quickly than
the Rosenbrock iterations, at least in some circumstances.
Would it be possible to make an option for the algorithm which is chosen?

That's not really feasible interface-wise: the current solver bounces
back and forth between the Rosenbrock steps and Newton steps.

Note that when Newton iteration is attempted basically for as long
as it improves the situation.  In other words, there would be no way
of continuing if you were just using just Newton iteration.

How many variables are you playing with?  We're recomputing the
NxN Hessian for every Newton step.  that might be expensive with
lots of variables.


[Date Prev][Date Next]   [Thread Prev][Thread Next]   [Thread Index] [Date Index] [Author Index]