Talk:Square root algorithms: Difference between revisions

Revision as of 17:24, 25 September 2023

Revision as of 23:27, 3 December 2023

Line 55:

I believe that the example that is given in C is what is referred to as the [http://totton.idirect.com/soroban/KojimaSq/ Chinese Abacus Method] - confirmation from [http://medialab.freaknet.org/martin/src/sqrt/ this article] and [http://medialab.freaknet.org/martin/src/sqrt/sqrt.imp code that appears to be the same algorithm.] <!-- Template:Unsigned IP --><small class="autosigned">—&nbsp;Preceding [[Wikipedia:Signatures|unsigned]] comment added by [[Special:Contributions/70.124.38.160|70.124.38.160]] ([[User talk:70.124.38.160#top|talk]]) 15:55, 18 April 2022 (UTC)</small> <!--Autosigned by SineBot-->

== Lucas sequence method - original research? ==

I could not find any relevant research papers on the use of Lucas sequences for computing real square roots.

The closest I found is

G. Adj and F. Rodríguez-Henríquez, "Square Root Computation over Even Extension Fields," in IEEE Transactions on Computers, vol. 63, no. 11, pp. 2829-2841, Nov. 2014, doi: 10.1109/TC.2013.145.

which is concerned with square roots in finite fields and uses a different algorithm.

Should this paragraph be removed as original research?

Or it could also simply be made much shorter, by avoiding to repeat the properties of Lucas sequences. [[User:BlueRavel|BlueRavel]] ([[User talk:BlueRavel|talk]]) 23:27, 3 December 2023 (UTC)