Jump to content

Talk:Neville's algorithm

Page contents not supported in other languages.
From Wikipedia, the free encyclopedia
This is the current revision of this page, as edited by Cewbot (talk | contribs) at 19:21, 6 February 2024 (Maintain {{WPBS}} and vital articles: 1 WikiProject template. Create {{WPBS}}. Keep majority rating "Start" in {{WPBS}}. Remove 1 same rating as {{WPBS}} in {{Maths rating}}. Remove 1 deprecated parameter: field.). The present address (URL) is a permanent link to this version.
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

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]
Retrieved from "https://en.wikipedia.org/w/index.php?title=Talk:Neville%27s_algorithm&oldid=1204257179"