Abstract
It is shown that root-finding iterations can be used in the field of power series. As a consequence, we obtain a class of new algorithms for computing reciprocals of power series. In particular, we show that the recent sieveking algorithm for computing reciprocals is just Newton iteration. Moreover, ifL n is the number of non scalar multiplications needed to compute the firstn+1 terms of the reciprocal of a power series, we show that
and conjecture that
Similar content being viewed by others
References
Böhm, C.: Perfezionamento di un processo iterativo atto alla divisione automatica. La Ricerca Scientifica25, 2077–2080 (1955)
Borodin, A.: On the number of arithmetics required to computer certain functions-Circa May 1973, in: Complexity of sequential and parallel numerical algorithms, edited by J. F. Traub, p. 149–180. New York: Academic Press 1973
Knuth, D. E.: The art of computer programming, vol. II, Seminumerical algorithms. Reading, Mass: Addison-Wesley 1969
Rabinowitz, P.: Multiple-precision division. Comm. ACM4, 98 (1961)
Schulz, G.: Iterative Berechnung der reziproken Matrix. Z. Angew. Math. and Mech.13, 57–59 (1933)
Sieveking, M.: An algorithm for division of power series. Computing10, 153–156 (1972)
Strassen, V.: Vermeidung von Divisionen. J. Reine Angew. Math.264, 184–202 (1973)
Traub, J. F.: Iterative methods for the solution of equations. Englewood Cliffs, N. J.: Prentice-Hall 1964
van der Waerden, B. L.: Modern algebra, vol. 1. New York: Frederick Ungar Publishing Co. 1953
Author information
Authors and Affiliations
Additional information
This research was supported in part by the National Science Foundation under Grant GJ 32111 and the Office of Naval Research under Contract N00014-67-A-0314-0010, NR 044-422.
Rights and permissions
About this article
Cite this article
Kung, H.T. On computing reciprocals of power series. Numer. Math. 22, 341–348 (1974). https://doi.org/10.1007/BF01436917
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01436917