Skip to Main content Skip to Navigation
Journal articles

Over-constrained Weierstrass iteration and the nearest consistent system

Abstract : We propose a generalization of the Weierstrass iteration for over-constrained systems of equations and we prove that the proposed method is the Gauss-Newton iteration to find the nearest system which has at least k common roots and which is obtained via a perturbation of prescribed structure. In the univariate case we show the connection of our method to the optimization problem formulated by Karmarkar and Lakshman for the nearest GCD. In the multivariate case we generalize the expressions of Karmarkar and Lakshman, and give explicitly several iteration functions to compute the optimum. The arithmetic complexity of the iterations is detailed.
Complete list of metadata

https://hal.archives-ouvertes.fr/hal-01296520
Contributor : Olivier Ruatta Connect in order to contact the contributor
Submitted on : Friday, April 1, 2016 - 9:41:13 AM
Last modification on : Wednesday, December 22, 2021 - 11:58:03 AM

Links full text

Identifiers

Collections

Citation

Olivier Ruatta, Agnes Szanto, Mark Sciabica. Over-constrained Weierstrass iteration and the nearest consistent system. Theoretical Computer Science, Elsevier, 2015, 562, pp.346-364. ⟨10.1016/j.tcs.2014.10.008⟩. ⟨hal-01296520⟩

Share

Metrics

Record views

54