Structured matrix methods for a polynomial root solver using approximate greatest common divisor computations and approximate polynomial factorisations
This thesis discusses the use of structure preserving matrix methods for the numerical approximation of all the zeros of a univariate polynomial in the presence of noise. In particular, a robust polynomial root solver is developed for the calculation of the multiple roots and their multiplicities, s...
| Main Author: | |
|---|---|
| Published: |
University of Sheffield
2011
|
| Subjects: | |
| Online Access: | http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.543782 |