[Matrix-SIG] An Experiment in code-cleanup.
Thu, 10 Feb 2000 09:04:13 +1100
Konrad Hinsen wrote:
> > silently). Consider a function
> > k0 = 100
> > k = 99
> > while k < k0:
> > ..
> > k0 = k
> > k = ...
> > which refines a calculation until the measure k stops decreasing.
> > This algorithm may terminate when k is a float, but _fail_ when
> > k is a double -- the extra precision may cause the algorithm
> I'd call this a buggy implementation. Convergence criteria should be
> explicit and not rely on the internal representation of data
> If you care at all about portability, you shouldn't even think about
But sometimes you DON'T care about portability.
Sometimes, you want the best result the architecture can support,
and so you need to perform a portable computation of an architecture
John (Max) Skaller, mailto:email@example.com
10/1 Toxteth Rd Glebe NSW 2037 Australia voice: 61-2-9660-0850