Improved two-step Newton’s method for computing simple multiple zeros of polynomial systems
- 2 February 2022
- journal article
- research article
- Published by Springer Nature in Numerical Algorithms
- Vol. 91 (1) , 19-50
Abstract
No abstract availableKeywords
Funding Information
- National Natural Science Foundation of China (12071467)
- National Natural Science Foundation of China (12171324)
This publication has 49 references indexed in Scilit:
- Computing the multiplicity structure of an isolated singular solution: Case of breadth oneJournal of Symbolic Computation, 2012
- Determining singular solutions of polynomial systems via symbolic–numeric reduction to geometric involutive formsJournal of Symbolic Computation, 2012
- Multiple zeros of nonlinear systemsMathematics of Computation, 2011
- On Location and Approximation of Clusters of Zeros: Case of Embedding Dimension OneFoundations of Computational Mathematics, 2006
- On Location and Approximation of Clusters of Zeros of Analytic FunctionsFoundations of Computational Mathematics, 2005
- Newton's method for singular nonlinear equations using approximate left and right nullspaces of the JacobianApplied Numerical Mathematics, 2005
- Quadratic Newton Iteration for Systems with MultiplicityFoundations of Computational Mathematics, 2002
- On simple double zeros and badly conditioned zeros of analytic functions of 𝑛 variablesMathematics of Computation, 2000
- Computing singular solutions to polynomial systemsAdvances in Applied Mathematics, 1992
- The fundamental theorem of algebra and complexity theoryBulletin of the American Mathematical Society, 1981