6 research outputs found
Verified Error Bounds for Isolated Singular Solutions of Polynomial Systems: Case of Breadth One
In this paper we describe how to improve the performance of the
symbolic-numeric method in (Li and Zhi,2009, 2011) for computing the
multiplicity structure and refining approximate isolated singular solutions in
the breadth one case. By introducing a parameterized and deflated system with
smoothing parameters, we generalize the algorithm in (Rump and Graillat, 2009)
to compute verified error bounds such that a slightly perturbed polynomial
system is guaranteed to have a breadth-one multiple root within the computed
bounds.Comment: 20 page
Punctual Hilbert Schemes and Certified Approximate Singularities
In this paper we provide a new method to certify that a nearby polynomial
system has a singular isolated root with a prescribed multiplicity structure.
More precisely, given a polynomial system f , we present a Newton iteration on an extended deflated system
that locally converges, under regularity conditions, to a small deformation of
such that this deformed system has an exact singular root. The iteration
simultaneously converges to the coordinates of the singular root and the
coefficients of the so called inverse system that describes the multiplicity
structure at the root. We use -theory test to certify the quadratic
convergence, and togive bounds on the size of the deformation and on the
approximation error. The approach relies on an analysis of the punctual Hilbert
scheme, for which we provide a new description. We show in particular that some
of its strata can be rationally parametrized and exploit these parametrizations
in the certification. We show in numerical experimentation how the approximate
inverse system can be computed as a starting point of the Newton iterations and
the fast numerical convergence to the singular root with its multiplicity
structure, certified by our criteria.Comment: International Symposium on Symbolic and Algebraic Computation, Jul
2020, Kalamata, Franc
A certified iterative method for isolated singular roots
International audienceIn this paper we provide a new method to certify that a nearby polynomial system has a singular isolated root and we compute its multiplicity structure. More precisely, given a polynomial system f = (f1 ,. .. , fN) ∈ C[x1 ,. .. , xn ]^N , we present a Newton iteration on an extended deflated system that locally converges, under regularity conditions, to a small deformation of f such that this deformed system has an exact singular root. The iteration simultaneously converges to the coordinates of the singular root and the coefficients of the so-called inverse system that describes the multiplicity structure at the root. We use α-theory test to certify the quadratic convergence, and to give bounds on the size of the deformation and on the approximation error. The approach relies on an analysis of the punctual Hilbert scheme, for which we provide a new description. We show in particular that some of its strata can be rationally parametrized and exploit these parametrizations in the certification. We show in numerical experimentation how the approximate inverse system can be computed as a starting point of the Newton iterations and the fast numerical convergence to the singular root with its multiplicity structure, certified by our criteria