DocumentCode :
1231294
Title :
The Laguerre method for finding the zeros of polynomials
Author :
Orchard, H.J.
Author_Institution :
Dept. of Electr. Eng., California Univ., Los Angeles, CA, USA
Volume :
36
Issue :
11
fYear :
1989
fDate :
11/1/1989 12:00:00 AM
Firstpage :
1377
Lastpage :
1381
Abstract :
In both the analysis and the design of linear networks, a commonly occurring task is that of locating the zeros of a polynomial. Among the many methods available for doing this, the one due to Laguerre has some remarkable properties that include a guarantee of convergence for polynomials with only real zeros. Moreover, for simple zeros, real or complex, this convergence is cubic. In practice, the method has proved very successful. Since this method is not widely known, the author explains its properties in an elementary fashion
Keywords :
linear network analysis; linear network synthesis; poles and zeros; polynomials; Laguerre method; convergence; linear networks; polynomials; properties; zeros; Circuits; Convergence; Filters; Frequency domain analysis; Helium; Polynomials; Transfer functions;
fLanguage :
English
Journal_Title :
Circuits and Systems, IEEE Transactions on
Publisher :
ieee
ISSN :
0098-4094
Type :
jour
DOI :
10.1109/31.41294
Filename :
41294
Link To Document :
بازگشت