A new proximity test for polynomial zeros

We combine some known techniques and results of Turan and Schönhage to improve substantially numerical performance of the computation of the minimum and the maximum distances from a fixed complex point to roots (zeros) of a fixed univariate polynomial.

Saved in:
Bibliographic Details
Published in:Computers & mathematics with applications (1987) 2001-06, Vol.41 (12), p.1559-1560
Main Author: Pan, V.Y.
Format: Article
Language:English
Subjects:
Polynomial roots
Proximity test
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:We combine some known techniques and results of Turan and Schönhage to improve substantially numerical performance of the computation of the minimum and the maximum distances from a fixed complex point to roots (zeros) of a fixed univariate polynomial.
ISSN:0898-1221
1873-7668
DOI:10.1016/S0898-1221(01)00120-1