Over-constrained Weierstrass iteration and the nearest consistent system - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports Year : 2004

Over-constrained Weierstrass iteration and the nearest consistent system

Olivier Ruatta
Mark Sciabica
  • Function : Author
Agnes Szanto
  • Function : Author

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.
Fichier principal
Vignette du fichier
RR-5215.pdf (271.49 Ko) Télécharger le fichier
Loading...

Dates and versions

inria-00070779 , version 1 (19-05-2006)

Identifiers

  • HAL Id : inria-00070779 , version 1

Cite

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

Share

Gmail Facebook Twitter LinkedIn More