A basic family of iteration functions for polynomial root finding and its characterizations (Q1360168): Difference between revisions

Let \(p\) be a polynomial of degree \(n\geq 2\). A class of iteration formulas of the form \(x_n^{k+1}= B_m(x^k)\) with \[ B_m(x):= x-p(x) \text{det} (L_{m-1}^1(x))/ \text{det} (L_m^1(x)) \] is discussed where \(L_j^1\) is a Hessenberg matrix whose entries are coefficients of the Taylor polynomials. The convergence rate is of order \(m\). Special cases are Newton's method for \(m=2\) and Halley's method for \(m=3\). The list of references contains many papers in which extensions of Newton's method have been rediscovered.