Talk:Neville's algorithm
Page contents not supported in other languages.
From Wikipedia, the free encyclopedia
This article is rated Start-class on Wikipedia's content assessment scale.
It is of interest to the following WikiProjects:
It is of interest to the following WikiProjects:
WikiProject icon This article is within the scope of WikiProject Mathematics , a collaborative effort to improve the coverage of mathematics on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.MathematicsWikipedia:WikiProject MathematicsTemplate:WikiProject Mathematicsmathematics
Mid This article has been rated as Mid-priority on the project's priority scale.
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 ]