A simple efficient parallel method of time-varying polynomials rooting

Author

Il´Kiv, Volodymyr ; Kulynych, Yaroslav ; Pelekh, Yaroslav ; Sokhan, Petro ; Svizinsky, Vasyl´

Author_Institution

Inst. Appl. Math., Lviv Polytech. Nat. Univ., Ukraine

fYear

2003

fDate

18-22 Feb. 2003

Firstpage

324

Abstract

A new simple effective algorithm, which determines all roots of polynomial and also updates all roots of time-varying polynomials simultaneously, is presented. It is a generalization of the modified Newton method and has quadratic convergence rate. The total number operations of algorithm is less than in the classical Newton method. The proposed method is usefully for parallel computing.

Keywords

Newton method; convergence of numerical methods; parallel algorithms; poles and zeros; polynomials; complex conjugate approximations; complex conjugate initial values; modified Newton method; parallel algorithm; polynomial factorization; power series; quadratic convergence rate; simple efficient parallel method; time-varying polynomials rooting; total number operations; Adaptive signal processing; Convergence; Iterative algorithms; Newton method; Parallel processing; Polynomials; Sensor arrays; Signal processing algorithms; Spectral analysis; Speech processing;

fLanguage

English

Publisher

ieee

Conference_Titel

CAD Systems in Microelectronics, 2003. CADSM 2003. Proceedings of the 7th International Conference. The Experience of Designing and Application of

Print_ISBN

966-553-278-2

Type

conf

DOI

10.1109/CADSM.2003.1255079

Filename

1255079