This is the mail archive of the gsl-discuss@sourceware.org mailing list for the GSL project.

Index Nav:	[Date Index] [Subject Index] [Author Index] [Thread Index]
Message Nav:	[Date Prev] [Date Next]	[Thread Prev] [Thread Next]
Other format:	[Raw text]

simplicity vs. efficiency of algorithms in GSL

From: Tuomo Keskitalo <Tuomo dot Keskitalo at iki dot fi>
To: Patrick Alken <patrick dot alken at colorado dot edu>
Cc: gsl-discuss at sourceware dot org
Date: Mon, 22 Sep 2008 21:31:18 +0300
Subject: simplicity vs. efficiency of algorithms in GSL
References: <200809221621.54890.emanuele.passera@treuropa.com> <20080922162507.GA29877@hippogriff.homeunix.org>

On 09/22/2008 07:25 PM, Patrick Alken wrote:

There are much faster (and far more sophisticated) eigenvalue
algorithms that are not really suited for GSL due to their
complexity to code. LAPACK contains these types of algorithms
and it is encouraged to use that library if one needs the
fastest available algorithms.

About this point: I have been wondering where the balance of GSL should be on simplicity vs. efficiency of the code. Of course, even a simple algorithm is better than none, but I think it would be good to offer efficient routines in GSL. If somebody publishes a well written, efficient eigenvalue algorithm, would it get included in GSL? Or would it be better off as an extension library?

--
Tuomo.Keskitalo@iki.fi
http://iki.fi/tuomo.keskitalo

Follow-Ups:
- Re: simplicity vs. efficiency of algorithms in GSL
  - From: Patrick Alken

Index Nav:	[Date Index] [Subject Index] [Author Index] [Thread Index]
Message Nav:	[Date Prev] [Date Next]	[Thread Prev] [Thread Next]