From: Paul A. Bristow (boost_at_[hidden])
Date: 2001-09-05 08:02:02
I'll check these out - sounds more advanced than my cleanup of Morris and
PS Do you know a source of high precision values of the incomplete beta
(at least 64 bit double) to check accuracy of an improved algorithm by
Dr Paul A Bristow, hetp Chromatography
LA8 8AB UK
+44 1539 561830
Mobile +44 7714 33 02 04
> -----Original Message-----
> From: Eric Ford [mailto:eford_at_[hidden]]
> Sent: Tuesday, September 04, 2001 11:16 PM
> To: boost_at_[hidden]
> Subject: [boost] Re: Math Functions
> > I am working on some math functions like erf, beta, gamma,
> > and have some questions on preferred practice (hoping to
> > avoid lots of criticisms at a late stage)!
> I also recently implemented such functions and had planned to try to
> clean them up, but haven't gotten around to dealing with lots of the
> details, several of which you mentioned in your email. If you're
> interested in seeing what I've got (not documented well),
> http://www.astro.princeton.edu/~eford/math/ has some files.
> They include some tempaltes for dealing with inifite sequences,
> infinite series, and continued fractions, which could be used quite
> generally. A also made a template for manipulating numbers by using
> their log that was useful for gamma and beta functions. I've only
> implemented log gamma, gamma, log beta, beta, incomplete beta.
> BTW- Although some code is derived from that of Paul Godfrey, I got
> his permission to do whatever with my code, so there shouldn't be
> problems with boost and licensing should you want to use any of it.
> Info: http://www.boost.org Unsubscribe:
> Your use of Yahoo! Groups is subject to http://docs.yahoo.com/info/terms/
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk