Some remarks on Dvorcuk's root-finding method
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.
- A Globally Convergent Method for Simultaneously Finding Polynomial Roots
- Factorization of a polynomial into quadratic factors by Newton method
- scientific article; zbMATH DE number 996039 (Why is no real title available?)
- scientific article; zbMATH DE number 3121940 (Why is no real title available?)
- scientific article; zbMATH DE number 621974 (Why is no real title available?)
- The fundamental theorem of algebra and complexity theory
- The behaviour of approximations of the SOR Weierstrass method
- Initial approximations in Euler-Chebyshev's method
- A note on the Le Verrier-Fadeev's method
- Finding roots of a real polynomial simultaneously by means of Bairstow's method
- Note on Jacobi's method for approximating dominant roots
- Numerical computation of polynomial zeros by means of Aberth's method
This page was built for publication: Some remarks on Dvorcuk's root-finding method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1335008)
