A combined method for polynomial roots using modified Newton-Raphson with minimum searching (Q1200179)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A combined method for polynomial roots using modified Newton-Raphson with minimum searching |
scientific article; zbMATH DE number 96887
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A combined method for polynomial roots using modified Newton-Raphson with minimum searching |
scientific article; zbMATH DE number 96887 |
Statements
A combined method for polynomial roots using modified Newton-Raphson with minimum searching (English)
0 references
17 January 1993
0 references
A combined algorithm for polynomial roots is constructed. At first, a local geometric property of an analytic function \(f\) is derived which in the case that \(f\) is a polynomial, is used to construct a root-finding algorithm MS which is always convergent. Then a modified Newton-Raphson method (MNR) is presented which is fast but unreliable. At last the method MNR is combined with the algorithm MS to yield a new method MNRMSc for which numerical experiments show to be significantly faster and more reliable than the Newton-Raphson method and some other algorithms of the same level of accuracy. It is also capable of greater accuracy.
0 references
polynomial roots
0 references
analytic function
0 references
root-finding algorithm
0 references
modified Newton-Raphson method
0 references
numerical experiments
0 references
0 references
0.8877367
0 references
0.87995416
0 references
0.8769015
0 references
0.87675166
0 references
0.87659943
0 references
0.8746487
0 references
0.8717867
0 references
0.8683535
0 references
