Advertisement

BIT Numerical Mathematics

, Volume 19, Issue 1, pp 134–135 | Cite as

A note on the computation of multiple zeros of polynomials by Newton's method

  • M. N. Channabasappa
Scientific Notes

Keywords

Computational Mathematic Multiple Zero 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

References

  1. 1.
    E. Bodewig,On types of convergence and behaviour of approximations in the neighbourhood of a multiple root of an equation, Quart. Appl. Math. Vol. VII (1949), 325–333.Google Scholar
  2. 2.
    E. V. Krishnamurthy and S. K. Sen,Computer based numerical algorithms, Affiliated East-West Press Pvt. Ltd., New Delhi (1976), 52–75.Google Scholar

Copyright information

© BIT Foundations 1979

Authors and Affiliations

  • M. N. Channabasappa
    • 1
  1. 1.Department of MathematicsKarnataka Regional Engineering College SurathkalP.O. SrinivasnagarIndia

Personalised recommendations