This is the mail archive of the
gsl-discuss@sourceware.cygnus.com
mailing list for the GSL project.
Re: Some ideas
- To: Juhana Sadeharju <kouhia at nic dot funet dot fi>
- Subject: Re: Some ideas
- From: Brian Gough <bjg at network-theory dot co dot uk>
- Date: Sat, 15 Jan 2000 17:17:54 +0000 (GMT)
- Cc: gsl-discuss at sourceware dot cygnus dot com
- References: <20000104144852Z38580-9077+176@nic.funet.fi>
Juhana Sadeharju writes:
> Quick question: can GSL find a sampled function f[100] with approximate
> derivatives fd[100] (computed each time from f) which satisfy some
> equation S(fd) == 0 with boundary conditions f[0] = 0 and -m < f[i] < m?
Currently, we do not have any constrained minimisation or solver
routines -- only unconstrained ones.
> I think an educative documentation would be needed. A quick look at
> your documentation revealed that there is a place for improvements.
> A documentation which would serve people like me, who doesn't even
> know what method to use and how, is a must.
At the moment we are only documenting the API and the algorithms, to
reduce the effort. We would plan to add more documentation later as
the library stabilises.
> Ok, please let me know what you think about going systematically through
> various library documentations, journal papers, books, and softwares.
> It would be quite boring and systematic work to go through all this
> but it would produce a list of all possible algorithms etc. and also
> an extensive reference listing.
See "Numerical Computation", volumes 1 and 2, by C. Ueberhuber. I
think these books cover most of what you want.
best regards
Brian Gough