Skip to main content
SpringerLink
Log in

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

  • Scientific Notes
  • Published:
BIT Numerical Mathematics Aims and scope Submit manuscript

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

References

  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. E. V. Krishnamurthy and S. K. Sen,Computer based numerical algorithms, Affiliated East-West Press Pvt. Ltd., New Delhi (1976), 52–75.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, Karnataka Regional Engineering College Surathkal, 574157, P.O. Srinivasnagar, Karnataka, India

    M. N. Channabasappa

Authors
  1. M. N. Channabasappa
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Channabasappa, M.N. A note on the computation of multiple zeros of polynomials by Newton's method. BIT 19, 134–135 (1979). https://doi.org/10.1007/BF01931230

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01931230

Keywords

Search

Navigation