Some remarks on Dvorcuk's root-finding method (Q1335008): Difference between revisions

Let \(f(x)= x^ n+ a_{n-1} x^{n-1}+\cdots+ a_ 1 x+ a_ 0\), be a polynomial with real coefficients and simple roots. The factorization of \(f(x)\) into quadratic factors with real coefficients may be performed iteratively by using certain formulas, due to \textit{J. Dvorcuk} [Apl. Mat. 14, 54-80 (1969; Zbl 0164.175)], involving the roots \(t^ k_ i\), \(t^ k_{i+m}\) and the coefficients \(p^ k_ i\), \(q^ k_ i\) of the polynomials \(x^ 2+ p^ k_ i x+ q^ k_ i\), \(i= 1,2,\dots, [n/2]\), \(k= 0,1,\dots\;\). The main result of this paper is a system of relations for \(p^{k+1}_ i\), \(q^{k+1}_ i\) and the coefficients of \(f(x)\) that can be applied to the global convergence of iterative processes.