Advertisement

Convergence behaviour of the Newton iteration for first order differential equations

  • K. O. Geddes
5. Differential Equations
Part of the Lecture Notes in Computer Science book series (LNCS, volume 72)

Abstract

In a typical application of the Newton iteration in a power series domain (e.g. to compute an algebraic function), the number of correct power series coefficients in the k-th iterate is exactly double the number of correct coefficients in the preceding iterate. This paper considers the application of the Newton iteration to compute the power series solution of a first-order nonlinear differential equation. It is proved that in one iteration the number of correct coefficients is more than doubled in the case of an explicit differential equation, and is less than doubled in the most general case.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    W.E. Boyce and R.C. DiPrima, Elementary Differential Equations and Boundary Value Problems, 3rd ed. John Wiley and Sons, New York, 1977.Google Scholar
  2. [2]
    R.P. Brent, Multiple-precision zero-finding methods and the complexity of elementary function evaluation. In Analytic Computational Complexity, J.F. Traub, Ed., Academic Press, New York, 1976, pp. 151–176.Google Scholar
  3. [3]
    R.P. Brent and H.T. Kung, Fast Algorithms for manipulating formal power series. J.ACM 25, 4 (Oct. 1978), pp. 581–595.Google Scholar
  4. [4]
    H.T. Kung and J.F. Traub, All algebraic functions can be computed fast. J.ACM 25, 2 (Apr. 1978), pp. 245–260.Google Scholar
  5. [5]
    J.D. Lipson, Newton's method: a great algebraic algorithm. In Proc. 1976 ACM Symp. on Symbolic and Algebraic Comput., R.D. Jenks, Ed., pp. 260–270.Google Scholar
  6. [6]
    A.C. Norman, Computing with formal power series. ACM Trans. Math. Software 1, 4 (Dec. 1975), pp. 346–356.Google Scholar
  7. [7]
    D.Y.Y. Yun, Hensel meets Newton — Algebraic constructions in an analytic setting. In Analytic Computational Complexity, J.F. Traub, Ed., Academic Press, New York, 1976, pp. 205–216.Google Scholar
  8. [8]
    D.Y.Y. Yun, Algebraic algorithms using p-adic constructions. In Proc. 1976 ACM Symp. on Symbolic and Algebraic Comput., R.D. Jenks, Ed., pp. 248–259.Google Scholar
  9. [9]
    R.E. Zippel, Univariate power series expansions in algebraic manipulation. In Proc. 1976 ACM Symp. on Symbolic and Algebraic Comput., R.D. Jenks, Ed., pp. 198–208.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1979

Authors and Affiliations

  • K. O. Geddes
    • 1
  1. 1.University of WaterlooWaterlooCanada

Personalised recommendations