An algebraic algorithm to isolate complex polynomial zeros using sturm sequences

Citation
Maoc. Brunetto et al., An algebraic algorithm to isolate complex polynomial zeros using sturm sequences, COMPUT MATH, 39(3-4), 2000, pp. 95-105
Citations number
12
Categorie Soggetti
Computer Science & Engineering
Journal title
COMPUTERS & MATHEMATICS WITH APPLICATIONS
ISSN journal
08981221 → ACNP
Volume
39
Issue
3-4
Year of publication
2000
Pages
95 - 105
Database
ISI
SICI code
0898-1221(200002)39:3-4<95:AAATIC>2.0.ZU;2-N
Abstract
In this paper, algorithms to enumerate and isolate complex polynomial roots are developed, analyzed,and implemented. We modified an algorithm due to W ilf, in which Sturm sequences and the principle of argument are used, by em ploying algebraic methods, aiming to enumerate zeros inside a rectangle in an exact way. Several improvements are introduced, such as dealing with zer os on the boundary of the rectangle. The performance of this new algorithm is evaluated in a theoretical as well as from a practical point of view, by means of experimental tests. The robustness of the algorithm is verified b y using tests with ill-conditioned polynomials. We also compare the perform ance of this algorithm with the results of a recent paper, using different polynomial classes. (C) 2000 Elsevier Science Ltd. All rights reserved.