This is the mail archive of the
gsl-discuss@sources.redhat.com
mailing list for the GSL project.
Re: Speed Issues
- From: Brian Gough <bjg at network-theory dot co dot uk>
- To: ronis at onsager dot chem dot mcgill dot ca
- Cc: gsl-discuss at sources dot redhat dot com
- Date: Tue, 18 Dec 2001 21:38:28 +0000 (GMT)
- Subject: Re: Speed Issues
- References: <15391.34013.675987.972662@ronispc.chem.mcgill.ca>
David Ronis writes:
> I've also tried the IMSL routine ZSPOW (written in fortran from an
> early version of the IMSL library). As I mentioned at the outset, the
> gsl version is about 30% slower, although the two give identical
> roots.
Hi,
Before I look into this you're refering to the the speed per function
evaluation (or iteration) being 30% slower, not total runtime, and
ZSPOW is the same Powell scaled-hybrid algorithm?
regards
--
Brian Gough
> P.S., it doesn't seem to be in the documentation, but is there any
> convention as to what the initial stride of a gsl_vector is? When can
> I assume that it's 1 and will remain so?
Yes, it's assumed to be 1 if you use gsl_vector_alloc.