It doesn't seem to be efficient to me? Will the interpolation be fast?
How do you handle it? Thanks!

On 6/28/07, Evgeny Kurbatov <[EMAIL PROTECTED]> wrote:
Hi, Michael.

> Moreover, is there a better adaptive quadature based "smart" integration
> method that can help me deal with the above situation efficiently? I am
> thinking of doing a cache for the Fourier Transform of g(t), which is
> FT[g(t)](v), since adaptive quadature based integration may sample
> different
> point of FT[g(t)](v) each time... but perhaps the overhead introduced in
> the
> cache may outweigh the smart adaptive integration itself...

If I understood your question right... you can interpolate precalculated
FT[g](v) between nodes of the grid of 'v' variable.  In GSL this can be
done with 'gsl_spline_...' class of functions.

Best witches,
Evgeny



_______________________________________________
Help-gsl mailing list
[email protected]
http://lists.gnu.org/mailman/listinfo/help-gsl

Reply via email to