Rayleigh quotient methods for estimating common roots of noisy univariate polynomials (Q2324359)

Solving polynomial system is a central problem in computer algebra and has many applications in applied Mathematics and engineering. A well-known tool for solving this problem is the method of Gröbner bases. However, in the case that the coefficients are obtained from data, symbolic methods are not inappropriate for this purpose and that is why we need numerical methods to solve such polynomial systems. In this paper, the authors consider a system of univariate polynomials with coefficients corrupted by noise. New Rayleigh quotient methods are proposed and evaluated for estimating the common roots of such a polynomial system. Furthermore, the new methods are compared to Gauss-Newton, solving an eigenvalue problem obtained from the generalized Sylvester matrix, and finding a cluster among the roots of all polynomials. The experiments show that the proposed methods have a good performance and in some special cases are more accurate than the other methods.