Newton's method: A great algebraic algorithm

31Citations
Citations of this article
8Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The analytic concepts of approximation, convergence, differentiation, and Taylor series expansion are applied and interpreted in the context of an abstract power series domain. Newton's method is then shown to be applicable to solving for a power series root of a polynomial with power series coefficients, resulting in fast algorithms for a variety of power series manipulation problems. Sample applications of a FORMAC implementation of Newton's method as an algebraic algorithm are presented.

Cite

CITATION STYLE

APA

Lipson, J. D. (1976). Newton’s method: A great algebraic algorithm. In Proceedings of the 3rd ACM Symposium on Symbolic and Algebraic Computation, SYMSAC 1976 (pp. 260–270). Association for Computing Machinery, Inc. https://doi.org/10.1145/800205.806344

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free