* Bill Gosper <billgosper@gmail.com> [Jul 07. 2016 08:20]:
[...] The analysis of Karatsuba's multiplication speedup recurses on bisected word length. Or precision, anyway. https://en.wikipedia.org/wiki/Anatoly_Karatsuba pictures him as not the least Japanese, so the stress is on the TSU: Карацу́ба
About the Wikipedia page: "His eponymous algorithm is a fast procedure for multiplying large numbers, a divide and conquer algorithm later asymptotically improved by the Schönhage–Strassen algorithm which is based on Karatsuba's ideas and their development.[4][5]" I think the "which is based on" is misleading at least or plain wrong (IMO the latter). This references [5] his daughter with whom I had the misfortune to communicate. See the very end of (Richard Brent, Paul Zimmermann) http://maths-people.anu.edu.au/~brent/pub/pub226.html for what I refer as "misfortune": ------- Start ------- The FEE method of E. A. Karatsuba The reader may wonder why our book does not refer to the FEE method of E. A. Karatsuba. In fact, various drafts of Chapter 4 of the book did refer to this method, but our publisher (CUP) asked us to remove such references to avoid any possibility of legal problems. For brief comments on the FEE method, see for example the draft of the book that is available at arXiv:1004.4710. ------- End ------- If anyone on this list does edit Wikipedia, could this be corrected? Best regards, jj
_______________________________________________ math-fun mailing list math-fun@mailman.xmission.com https://mailman.xmission.com/cgi-bin/mailman/listinfo/math-fun