Conventional numerical methods for finding multiple roots of polynomials are inaccurate. The accuracy is unsatisfactory because the derivatives of the polynomial in the intermediate steps of the associated root-finding procedures are eliminated. Engineering applications require that this problem be
โฆ LIBER โฆ
Polynomial Root-Finding Methods Whose Basins of
โ Scribed by Bahman Kalantari
- Publisher
- Springer
- Year
- 2011
- Tongue
- English
- Weight
- 563 KB
- Volume
- 46
- Category
- Article
- ISSN
- 0179-5376
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
Method for finding multiple roots of pol
โ
Chang-Dau Yan; Wei-Hua Chieng
๐
Article
๐
2006
๐
Elsevier Science
๐
English
โ 851 KB
A method for finding the roots of a poly
โ
Jiลรญ Soukup
๐
Article
๐
1969
๐
Springer-Verlag
๐
English
โ 273 KB
The Durand-Kerner polynomials roots-find
โ
Pierre Fraigniaud
๐
Article
๐
1991
๐
Springer Netherlands
๐
English
โ 494 KB
The amended DSeSC power method for polyn
โ
V.Y. Pan
๐
Article
๐
2005
๐
Elsevier Science
๐
English
โ 724 KB
Cardinal's matrix version of the Sebastiao e Silva polynomial root-finder rapidly approximates the roots as the eigenvalues of the associated Frobenius matrix. We preserve rapid convergence to the roots but amend the algorithm to allow input polynomials with multiple roots and root clusters. As in C
A class of root finding methods
โ
Zhiyong Bi; Paul H. Calamai
๐
Article
๐
1989
๐
Springer Netherlands
๐
English
โ 313 KB
A family of root finding methods
โ
Eldon Hansen; Merrell Patrick
๐
Article
๐
1976
๐
Springer-Verlag
๐
English
โ 561 KB