Relations between roots and coefficients, interpolation and application to system solving (Q697492)

For a univariate polynomial, the relations between its roots and its coefficients involving the elementary symmetric functions can be used to compute approximations of those roots iteratively [see \textit{K. Weierstrass}, ``Neuer Beweis des Satzes, dass jede ganze rationale Function einer Veränderlichen dargestellt werden kann als ein Product aus linearen Functionen derselben Veränderlichen'', Mathematische Werke. Dritter Band (1903; JFM 34.0023.01)]. The authors generalize this method to the case when an ideal \({\mathcal I}= (f_1,\dots, f_n)\) in \(\mathbb{K} [x_1,\dots, x_n]\) defines a zero-dimensional reduced complete intersection. They use the fact that one has determinantal formulae in this case which generalize elementary symmetric functions. The result is an iteration function which computes simultaneous approximations of the roots of such systems of equations which has a quadratic convergence in the neighbourhood of the solutions. A large part of this paper consists of a survey of known facts which are useful for the task at hand, although only few of them are attributed to specific items in the long list of references. The paper ends with a discussion of timings and of the theoretical complexity of the proposed iteration method.