Article ID Journal Published Year Pages File Type
438714 Theoretical Computer Science 2013 11 Pages PDF
Abstract

In this paper we describe how to improve the performance of the symbolic–numeric method in [19,20] for computing the multiplicity structure and refining approximate isolated singular solutions in the breadth-one case. By introducing a parameterized deflated system with smoothing parameters, we generalize the algorithm in [33] 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.

Related Topics
Physical Sciences and Engineering Computer Science Computational Theory and Mathematics