HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation

Over-constrained Weierstrass iteration and the nearest consistent system

Olivier Ruatta 1 Mark Sciabica Agnes Szanto
1 GALAAD - Geometry, algebra, algorithms
CRISAM - Inria Sophia Antipolis - Méditerranée , UNS - Université Nice Sophia Antipolis (... - 2019), CNRS - Centre National de la Recherche Scientifique : UMR6621
Abstract : We propose a generalization of the Weierstrass iteration for over-constrained systems of equations and we prove that the proposed method allows us 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 ourmethod to the optimization problem formulated by Karmarkar and Lakshmanfor the nearest GCD. In the multivariate case we generalize the expressions of Karmarkar and Lakshman, and give a simple iterative method to compute the optimum. The arithmetic complexity of the iteration is detailed.
Document type :
Complete list of metadata

Cited literature [1 references]  Display  Hide  Download

Contributor : Rapport de Recherche Inria Connect in order to contact the contributor
Submitted on : Friday, May 19, 2006 - 9:36:28 PM
Last modification on : Friday, February 4, 2022 - 3:19:21 AM
Long-term archiving on: : Sunday, April 4, 2010 - 9:53:52 PM


  • HAL Id : inria-00070779, version 1


Olivier Ruatta, Mark Sciabica, Agnes Szanto. Over-constrained Weierstrass iteration and the nearest consistent system. RR-5215, INRIA. 2004, pp.17. ⟨inria-00070779⟩



Record views


Files downloads