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 ✦
A study of accelerated Newton methods for multiple polynomial roots
✍ Scribed by Aurél Galántai; Csaba J. Hegedűs
- Publisher
- Springer US
- Year
- 2009
- Tongue
- English
- Weight
- 446 KB
- Volume
- 54
- Category
- Article
- ISSN
- 1017-1398
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
Manifolds of polynomials having a root o
✍
A. B. Givental’
📂
Article
📅
1982
🏛
Springer US
🌐
English
⚖ 321 KB
Accelerating generators of iterative met
✍
M.S. Petković; L.D. Petković; J. Džunić
📂
Article
📅
2010
🏛
Elsevier Science
🌐
English
⚖ 397 KB
a b s t r a c t Two accelerating generators that produce iterative root-finding methods of arbitrary order of convergence are presented. Primary attention is paid to algorithms for finding multiple roots of nonlinear functions and, in particular, of algebraic polynomials. First, two classes of algor
A method for finding the roots of a poly
✍
Jiří Soukup
📂
Article
📅
1969
🏛
Springer-Verlag
🌐
English
⚖ 273 KB
Some Methods for Simultaneous Extraction
✍
A. Iliev; N. Kyurkchiev
📂
Article
📅
2005
🏛
Springer Vienna
🌐
English
⚖ 136 KB
A note on the computation of multiple ze
✍
M. N. Channabasappa
📂
Article
📅
1979
🏛
Springer Netherlands
🌐
English
⚖ 97 KB