Talk:Neville's algorithm

Latest comment: 9 years ago by Brirush in topic Added to maths wikiproject

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

edit

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