At Mon, 11 Feb 2008 22:56:35 +0100,
Claude Dion wrote:
> There are a couple of errors in the examples of minimization in
> section 33.8 of the manual. First, the output of the sample code
> does not correspond to what is in the manual. Also, the second
> (header) and third (0th iteration) printf have 6 fields, while 7 are
> printed in the do while. (On that subject, I would also like to
> request a feature. It would be nice if there was a wrapper for the
> minimization procedure, instead of having to iterate manually.)
>
> Also in section 16.2 of the manual, to be pedantic, the QNG
> algorithm is based on the Gauss-Kronrod-Patterson rules, not just
> Gauss-Kronrod (which concerns only the 10- and 21-point rules).
Thanks for the bug reports, I've corrected the manual.
--
best regards,
Brian Gough
Network Theory Ltd,
Publishing Free Software Manuals ---
http://www.network-theory.co.uk/
