Rayleigh quotient methods for estimating common roots of noisy univariate polynomials
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.
- Common factor estimation and two applications in signal processing
- The computation of multiple roots of a polynomial
- Nearest common root of polynomials, approximate greatest common divisor and the structured singular value
- New progress in real and complex polynomial root-finding
- scientific article; zbMATH DE number 1254271
- A simple proof of a known blind channel identifiability result
- An ODE-based method for computing the approximate greatest common divisor of polynomials
- Approximate greatest common divisor of many polynomials, generalised resultants, and strength of approximation
- Backward stability of polynomial root-finding using Fiedler companion matrices
- Convergence analysis of the general Gauss-Newton algorithm
- Generalized Eigenvalue Problems for Rectangular Matrices
- scientific article; zbMATH DE number 3839766 (Why is no real title available?)
- scientific article; zbMATH DE number 3857249 (Why is no real title available?)
- scientific article; zbMATH DE number 4150052 (Why is no real title available?)
- scientific article; zbMATH DE number 47363 (Why is no real title available?)
- scientific article; zbMATH DE number 578220 (Why is no real title available?)
- scientific article; zbMATH DE number 1012640 (Why is no real title available?)
- scientific article; zbMATH DE number 1100439 (Why is no real title available?)
- scientific article; zbMATH DE number 961607 (Why is no real title available?)
- Iterative computation of the smallest singular value and the corresponding singular vectors of a matrix.
- Matrix eigenproblems are at the heart of polynomial system solving
- Nearest common root of polynomials, approximate greatest common divisor and the structured singular value
- New progress in real and complex polynomial root-finding
- Numerical Polynomial Algebra
- On the Computation of Null Spaces of Sparse Rectangular Matrices
- On the convergence of the Rayleigh quotient iteration for the computation of the characteristic roots and vectors. V: Usual Rayleigh quotient for non-Hermitian matrices and linear elementary divisors. VI: Usual Rayleigh quotient for nonlinear elementary d
- On the null spaces of the Macaulay matrix
- Perturbation theory for rectangular matrix pencils
- Polynomial Roots from Companion Matrix Eigenvalues
- Résolution des systèmes d'équations algébriques
- Solving overdetermined eigenvalue problems
- Solving polynomial equations. Foundations, algorithms, and applications
- The Generalized Eigenvalue Problem for Nonsquare Pencils Using a Minimal Perturbation Approach
- The singular value decomposition and long and short spaces of noisy matrices
- Using Algebraic Geometry
This page was built for publication: Rayleigh quotient methods for estimating common roots of noisy univariate polynomials
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2324359)
