Asset Details
Do you wish to reserve the book?
Rayleigh Quotient Methods for Estimating Common Roots of Noisy Univariate Polynomials
Hey, we have placed the reservation for you!
By the way, why not check out events that you can attend while you pick your title.
Oops! Something went wrong.
Looks like we were not able to place the reservation. Kindly try again later.
Are you sure you want to remove the book from the shelf?
Rayleigh Quotient Methods for Estimating Common Roots of Noisy Univariate Polynomials
Do you wish to request the book?
Rayleigh Quotient Methods for Estimating Common Roots of Noisy Univariate Polynomials
Please be aware that the book you have requested cannot be checked out. If you would like to checkout this book, you can reserve another copy
We have requested the book for you!
Your request is successful and it will be processed during the Library working hours. Please check the status of your request in My Requests.
Oops! Something went wrong.
Looks like we were not able to place your request. Kindly try again later.
Journal Article
Rayleigh Quotient Methods for Estimating Common Roots of Noisy Univariate Polynomials
2019
Overview
The problem is considered of approximately solving a system of univariate polynomials with one or more common roots and its coefficients corrupted by noise. The goal is to estimate the underlying common roots from the noisy system. Symbolic algebra methods are not suitable for this. New Rayleigh quotient methods are proposed and evaluated for estimating the common roots. Using tensor algebra, reasonable starting values for the Rayleigh quotient methods can be computed. 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. In a simulation study it is shown that Gauss–Newton and a new Rayleigh quotient method perform best, where the latter is more accurate when other roots than the true common roots are close together.
Publisher
De Gruyter,Walter de Gruyter GmbH
We currently cannot retrieve any items related to this title. Kindly check back at a later time.