A numerical realization of the conditions of Max Nöther's residual intersection theorem

DOI10.1007/s11766-014-3242-yzbMath1324.65032OpenAlexW2060716628MaRDI QIDQ2352104

Jiejin Zhang, Erbao Feng, Zhong-xuan Luo

Publication date: 29 June 2015

Published in: Applied Mathematics. Series B (English Edition) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11766-014-3242-y

zbMATH Keywords

computational complexityhomotopy continuationnumerical experimentsalgebraic curvePuiseux expansionmultiple rootplaceMax Nöther's residual intersection theorem

Mathematics Subject Classification ID

Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Global methods, including homotopy approaches to the numerical solution of nonlinear equations (65H20) Computational aspects of algebraic curves (14Q05) Complexity and performance of numerical algorithms (65Y20) Grothendieck groups, (K)-theory and commutative rings (13D15)

Uses Software

• HOM4PS
• HOMPACK90
• MultRoot
• PHCpack
• POLSYS_PLP
• PHoM

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the numerical condition of algebraic curves and surfaces. I: Implicit equations
• Rational algebraic curves. A computer algebra approach
• HOM4PS-2.0: a software package for solving polynomial systems by the polyhedral homotopy continuation method
• Complexity of Bezout's theorem. VI: Geodesics in the condition (number) metric
• On expansion of algebraic functions in power and Puiseux series. I
• On expansion of algebraic functions in power and Puiseux series. II
• Complexity of Bezout's theorem. V: Polynomial time
• PHoM -- a polyhedral homotopy continuation method for polynomial systems
• A Numerical Local Dimension Test for Points on the Solution Set of a System of Polynomial Equations
• Algorithm 857
• All Algebraic Functions Can Be Computed Fast
• Algorithm 777: HOMPACK90
• Solving a Polynomial Equation: Some History and Recent Progress
• A Fortran 90-based multiprecision system
• Algorithm 801: POLSYS_PLP
• Algorithm 795
• Computing multiple roots of inexact polynomials
• Cayley-Bacharach theorems and conjectures
• A polynomial-time complexity bound for the computation of the singular part of a Puiseux expansion of an algebraic function
• The Numerical Solution of Systems of Polynomials Arising in Engineering and Science
• Error Bounds for Zeros of a Polynomial Based Upon Gerschgorin's Theorems

This page was built for publication: A numerical realization of the conditions of Max Nöther's residual intersection theorem