Re: [math] Testing for convergence in iterative algorithms

2011-08-09 Thread Sébastien Brisard
> > The tricky bit here is a) how to encapsulate state in a generic way > that has enough substance to it to be actually useful and b) > similarly how to do the same for convergence.  I am probably too > influenced by the topological connotation of the latter term which > makes it seem basically di

Re: [math] Testing for convergence in iterative algorithms

2011-08-09 Thread Phil Steitz
On 8/8/11 10:41 PM, Sébastien Brisard wrote: > 2011/8/8 Phil Steitz : >> Sounds reasonable. Have a look at the StoppingCondition interface >> and its implementations in the genetics package. Something like >> that would probably work. >> >> Phil >> > I wasn't aware of o.a.c.m.genetics.StoppingCon

Re: [math] Testing for convergence in iterative algorithms

2011-08-08 Thread Sébastien Brisard
2011/8/8 Phil Steitz : > > Sounds reasonable.  Have a look at the StoppingCondition interface > and its implementations in the genetics package.  Something like > that would probably work. > > Phil > I wasn't aware of o.a.c.m.genetics.StoppingCondition. It's exactly what I would need, only slightl

Re: [math] Testing for convergence in iterative algorithms

2011-08-08 Thread Phil Steitz
On 8/8/11 11:46 AM, Sébastien Brisard wrote: > Hi, > discussions regarding the development of iterative linear solvers > (MATH-581) triggered the following issue. Usually, a default > (efficiently implemented) convergence checker is provided for each > standard linear iterative solver. However, it

[math] Testing for convergence in iterative algorithms

2011-08-08 Thread Sébastien Brisard
Hi, discussions regarding the development of iterative linear solvers (MATH-581) triggered the following issue. Usually, a default (efficiently implemented) convergence checker is provided for each standard linear iterative solver. However, it would be very useful to have the ability to use a custo