Computing real witness points of positive dimensional polynomial systems (Q2357373)

The authors continue their work [\textit{W. Wu} and \textit{G. Reid}, in: Proceedings of the 38th international symposium on symbolic and algebraic computation, ISSAC 2013, Boston, MA, USA, June 26--29, 2013. New York, NY: Association for Computing Machinery (ACM). 339--346 (2013; Zbl 1360.14145)] on finding well-conditioned points in the real connected components of solutions of polynomial systems. This article starts with a complexity bound for computing real points by the plane-distance construction, using the usual perturbation, path tracking and projection scheme. Then, they explore the numerical aspects of finding better-conditioned solutions assuming local convergence of Newton iteration. They compare their results to those of [\textit{C. Beltrán} and \textit{A. Leykin}, Found. Comput. Math. 13, No. 2, 253--295 (2013; Zbl 1267.14075)], claiming that, although no rigorous bound on the step size is given, their proposal is guaranteed to detect path jumping, in which case it should suffice to reduce the step size.