Root iterations and the computation of minimum and maximum zeros of polynomials

Research output: Contribution to journalConference articlepeer-review

Abstract

In this paper, methods which are guaranteed to converge to the minimum or maximum zeros are developed. The proposed methods are based on two approaches for generating fixed point functionsof rational and radical forms. These include well known methods such as the Newton, and Halley methods as special cases, in addition to the rth root methods. Although these methods are only derived for polynomials, they are also applicable to some types of entire functions of finite number of zeros. Additionally, the proposed approach is useful to generate algorithms with any given rate of convergence.

Original languageEnglish (US)
Article number1465073
Pages (from-to)2259-2262
Number of pages4
JournalProceedings - IEEE International Symposium on Circuits and Systems
DOIs
StatePublished - Dec 1 2005
EventIEEE International Symposium on Circuits and Systems 2005, ISCAS 2005 - Kobe, Japan
Duration: May 23 2005May 26 2005

Fingerprint Dive into the research topics of 'Root iterations and the computation of minimum and maximum zeros of polynomials'. Together they form a unique fingerprint.

Cite this