Newton's method: A great algebraic algorithm

Proceedings of the 3rd ACM Symposium on Symbolic and Algebraic Computation, SYMSAC 1976

Volumn , Issue , 1976, Pages 260-270

  Lipson, John D ^a  

^a UNIVERSITY OF TORONTO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

CONVERGENCE OF NUMERICAL METHODS; NEWTON-RAPHSON METHOD;

ALGEBRAIC ALGORITHMS; FAST ALGORITHMS; NEWTON'S METHODS; POWER SERIES; POWER SERIES ROOTS; SAMPLE APPLICATIONS; TAYLOR SERIES EXPANSIONS;

ALGEBRA;

EID: 85032205261     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/800205.806344     Document Type: Conference Paper

References (15)

1. Borodin, A. and Moenck, R. (1974) Fast modular transforms. J. Comput. System Sci. 8: 366-386
2. Borodin, A. and Munro, I. (1975) The computational complexity of algebraic and numeric problems. American Elsevier, New York.
3. Brent, R.P. and Kung, H.T. (1976) 3/2 OCCn log n)) algorithms for com position and reversion of power series. In: Analytic computational compie xity, J.F. Traub (ed.). Academic Press, New York.
4. Cook, S.A. (1966) On the minimum computation time of functions. Ph.D. thesis. Harvard U.
5. Godement, R. (1968) Algebra. Houghton Mifflin, Boston.
6. Henrici, P. (1964) Elements of numerical analysis. Wiley, New York.
7. Henrici, P. (1974) Applied and computational complex analysis (Vol. 1). Wiley, New York.
8. Knuth, D.E. (1969) The art of computer programming. Vol. 2 (Seminumerical algorithms). Addison-Wesley, Reading, Mass.
9. Kung, H.T. (1974) On computing reciprocals of power series. Numer. Math. 22: 341-348.
10. Moenck, R. and Allen, J. (1975) Efficient division algorithms in Euclidean domains. Research report CS-75-18, U. of Waterloo.
11. Norman, A.C. (1975) Computing with formal power series. ACM Trans. Math. Software 1: 346-356.
12. Schönhage, A. and Strassen, V. (1971) Schelle Multiplikation grosser Zahlen (Fast multiplication of large integers). Computing 7: 281-292.
13. Sieveking, M. (1972) An algorithm for division of power series. Computing 10: 153-156.
14. Strassen, V. (1973) Die Berechnungskomplexität von el ementarsymmetrischen Funktionen und von Interpolationskoeffizienten. Numer. Math. 20: 238-251.
15. Tobey, R., et al (1969) PL/I FORMAC symbolic mathematics interpreter. IBM Contributed Program Library, 360D-03.3.004, Hawthorne, N.Y.