Talk:Neville's algorithm

The printable version is no longer supported and may have rendering errors. Please update your browser bookmarks and please use the default browser print function instead.

I added the complexity of Neville's algorithm to the article. An algorithm always needs to specify what it's complexity is... :) I had no time however to add the proof in a nice understandable way. I also couldn't find a reference... Even without reference it's a good addition, and I'm hoping (assuming) someone in the near future will add this :) --Aphexer 14:27, 20 January 2007 (UTC)[reply]

Added to maths wikiproject

Wasn't sure whether to use mid or low importance. Left blank for now. Polynomial interpolation itself has mid important but this subtopic is a very important one. Jason Quinn (talk) 19:40, 19 October 2011 (UTC)[reply]

Rated as mid. Brirush (talk) 00:51, 15 December 2014 (UTC)[reply]