TY - JOUR
T1 - Root iterations and the computation of minimum and maximum zeros of polynomials
AU - Hasan, Mohammed A.
PY - 2005
Y1 - 2005
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=67649124692&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=67649124692&partnerID=8YFLogxK
U2 - 10.1109/ISCAS.2005.1465073
DO - 10.1109/ISCAS.2005.1465073
M3 - Conference article
AN - SCOPUS:67649124692
SN - 0271-4310
SP - 2259
EP - 2262
JO - Proceedings - IEEE International Symposium on Circuits and Systems
JF - Proceedings - IEEE International Symposium on Circuits and Systems
M1 - 1465073
T2 - IEEE International Symposium on Circuits and Systems 2005, ISCAS 2005
Y2 - 23 May 2005 through 26 May 2005
ER -