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 ✦
Numerical integration error method – a new method for polynomial root-finding
✍ Scribed by Tomohiro Suzuki; Toshio Suzuki
- Publisher
- Elsevier Science
- Year
- 2001
- Tongue
- English
- Weight
- 294 KB
- Volume
- 47
- Category
- Article
- ISSN
- 0362-546X
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
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 new method of interpolation and numeri
✍
N. Catsaros; P. Ribon
📂
Article
📅
1987
🏛
Elsevier Science
🌐
English
⚖ 560 KB
A method for real time numerical integra
✍
G.P. Koinakov; L.S. Dunchev; V.I. Furnadziev
📂
Article
📅
1984
🏛
Elsevier Science
⚖ 292 KB
A method of finding the roots of polynom
✍
A.V. Ivanisov; V.K. Polishchuk
📂
Article
📅
1985
🏛
Elsevier Science
⚖ 674 KB
The discretization error of newmark's me
✍
J. M. B. Brown
📂
Article
📅
1985
🏛
John Wiley and Sons
🌐
English
⚖ 484 KB
👁 1 views