Wikipedia:Articles for deletion/Near Root Algorithm: Difference between revisions

Revision as of 21:18, 15 August 2009

Revision as of 21:38, 15 August 2009

Line 12:

*'''Delete''' - Indeed looks like original research, I am also not familiar with the inventor (Nick Dietz). [[User:Materialscientist|Materialscientist]] ([[User talk:Materialscientist|talk]]) 08:12, 14 August 2009 (UTC)

*'''Delete''' C++ program to implement standard algorithm with poorly thought out implementation (what happens if the argument is negative? what if the last digit of the floating point fluctuates (unlikely but not impossible, since it depends on the implemenation of floating point division)?) We are not a how-to. [[User:Pmanderson|Septentrionalis]] <small>[[User talk:Pmanderson|PMAnderson]]</small> 17:08, 14 August 2009 (UTC)

*'''<s>Speedy merge</s>Delete''' Isn't this just the same as [[Methods of computing square roots#Babylonian method|the Babylonian method]]? --[[User:DanielPharos|DanielPharos]] ([[User talk:DanielPharos|talk]]) 21:07, 15 August 2009 (UTC)

:*What's so speedy about it? And you can't just merge unreferenced [[WP:OR|original research]] into another article. — [[User:Rankiri|Rankiri]] ([[User talk:Rankiri|talk]]) 21:18, 15 August 2009 (UTC)

::Oh, hang on, now I see! The first part of the article is talking about the Babylonian method, but the second part (the main part of the article) isn't. Oops. Just ignore me ;)

::I can also verify that this has to be original research: it's useless. In order to approximate a square root, he has to calculate square roots, which kinda defeats the purpose of it all. Look at the conditions of the sums: they contain square roots! He's looking for a close 'square root', and using that to prime the iteration. Of course that works, but it totally defeats the purpose! --[[User:DanielPharos|DanielPharos]] ([[User talk:DanielPharos|talk]]) 21:38, 15 August 2009 (UTC)