commons-dev mailing list archives

Site index · List index
Message view « Date » · « Thread »
Top « Date » · « Thread »
From S├ębastien Brisard <>
Subject Re: [math] Monitoring iterative algorithms
Date Tue, 09 Aug 2011 18:25:50 GMT
In that case, I'm quite happy to test one of the options which have
been suggested within the framework of linear solvers.
I could for example try and implement the Obervable/Observer option,
and see how it goes.

2011/8/9 Mark Thomas <>:
> On 09/08/2011 18:50, Greg Sterijevski wrote:
>> I think you hit the nail on the head with the comment:
>> "... but also the time to
>> experiment. Only the latter will be able to tell if the design is good.
>> And this must take time so that all the potential pitfalls can be ..."
>> Maybe this is chumming the water with more flotsam and jetsam, but a lot of
>> the issues that arise in working out the best design ultimately revert to
>> trying out a bunch of deadends [design by monte carlo ;)] The discussion on
>> the list [from my rather limited history] seems to try to foresee all
>> possible drawbacks with a design. This inevitably devolves into heated
>> discussion and diminishing progress.
>> Would it be possible to fork the trunk of the source tree to an
>> "experimental branch"?
> The idea has been around almost as long as the ASF has:
> Mark
> ---------------------------------------------------------------------
> To unsubscribe, e-mail:
> For additional commands, e-mail:

To unsubscribe, e-mail:
For additional commands, e-mail:

View raw message