Skip to main content
Log in

Quadratic Newton Iteration for Systems with Multiplicity

  • Published:
Foundations of Computational Mathematics Aims and scope Submit manuscript

Abstract.

Newton's iterator is one of the most popular components of polynomial equation system solvers, either from the numeric or symbolic point of view. This iterator usually handles smooth situations only (when the Jacobian matrix associated to the system is invertible). This is often a restrictive factor. Generalizing Newton's iterator is still an open problem: How to design an efficient iterator with a quadratic convergence even in degenerate cases? We propose an answer for an m -adic topology when the ideal m can be chosen generic enough: compared to a smooth case we prove quadratic convergence with a small overhead that grows with the square of the multiplicity of the root.

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

Access this article

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

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Lecerf, . Quadratic Newton Iteration for Systems with Multiplicity . Found. Comput. Math. 2, 247–293 (2002). https://doi.org/10.1007/s102080010026

Download citation

  • Issue Date:

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

Navigation