A combined method for polynomial roots using modified Newton-Raphson with minimum searching (Q1200179): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(One intermediate revision by one other user not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A Three-Stage Algorithm for Real Polynomials Using Quadratic Iteration / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A three-stage variable-shift iteration for polynomial zeros and its relation to generalized Rayleigh iteration / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: An Error Analysis for Numerical Differentiation / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3713481 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Matrix eigensystem routines - EISPACK guide. 2nd ed / rank | |||
Normal rank |
Latest revision as of 12:56, 17 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A combined method for polynomial roots using modified Newton-Raphson with minimum searching |
scientific article |
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