RESOLUTION OF MULTIPLE ROOTS OF NONLINEAR POLYNOMIAL SYSTEMS

DOI10.1142/S021865430500075XzbMath1122.65352MaRDI QIDQ5314399

No author found.

Publication date: 5 September 2005

Published in: International Journal of Shape Modeling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s021865430500075x

zbMATH Keywords

Gauss map; topological degree; Cauchy index; univariate and bivariate polynomials

Mathematics Subject Classification ID

65H10: Numerical computation of solutions to systems of equations

Related Items

On the asymptotic and practical complexity of solving bivariate systems over the reals, Improved subdivision scheme for the root computation of univariate polynomial equations, Parallel computation of real solving bivariate polynomial systems by zero-matching method, A reliable algorithm for computing the topological degree of a mapping in \(\mathbb R^{2}\)

Cites Work

• Unnamed Item
• Unnamed Item
• Singular points of algebraic curves
• A reliable argument principle algorithm to find the number of zeros of an analytic function in a bounded domain
• Algorithms for polynomials in Bernstein form
• Solution of equations involving analytic functions
• Multipolynomial resultant algorithms
• A bibliography on roots of polynomials
• Computation of the solutions of nonlinear polynomial systems
• Ten methods to bound multiple roots of polynomials
• The Euclidean Algorithm and the Degree of the Gauss Map
• A Global Bisection Algorithm for Computing the Zeros of Polynomials in the Complex Plane