From: "Dmitry A. Kazakov" <mailbox@dmitry-kazakov.de>
Subject: Re: interpolation polynomial
Date: Sun, 18 Sep 2005 11:10:50 +0200
Date: 2005-09-18T11:10:49+02:00 [thread overview]
Message-ID: <14rdr7zqxqx89.d0wrr7j66geh$.dlg@40tude.net> (raw)
In-Reply-To: 1126988546.797033.304660@z14g2000cwz.googlegroups.com
On 17 Sep 2005 13:22:26 -0700, adaman wrote:
> Where can i found an ada implementation of interpolation polynomial
> algorithms (lagrange, newton, spline ...)?
That depends on which method you need. Note that all methods have their
application areas, advantages and disadvantages.
> A class "polynomial" is may be the must.
Well, who is interested in numerical methods these days? (:-))
> Moreover i search a comparison between this differents
> algorithms in order to know which is the fastest.
As always, it depends. Though usually Chebyshev's polynomials should be
first to check. I'd recommend any good book on numerical methods.
Especially for approximations, the fundamental work I still enjoy is:
"Mathematical functions and their approximations" by Yudell L. Luke.
--
Regards,
Dmitry A. Kazakov
http://www.dmitry-kazakov.de
prev parent reply other threads:[~2005-09-18 9:10 UTC|newest]
Thread overview: 3+ messages / expand[flat|nested] mbox.gz Atom feed top
2005-09-17 20:22 interpolation polynomial adaman
2005-09-17 21:43 ` Dan Nagle
2005-09-18 9:10 ` Dmitry A. Kazakov [this message]
replies disabled
This is a public inbox, see mirroring instructions
for how to clone and mirror all data and code used for this inbox