Recursive algorithm without extra function evaluations for the Jacobian matrix of Viéta's polynomial system with applications

DOI10.1016/J.AMC.2003.12.107zbMath1077.65050OpenAlexW2014952689MaRDI QIDQ1765801

Xin-Yuan Wu

Publication date: 23 February 2005

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2003.12.107

zbMATH Keywords

algorithmnumerical exampleNewton's methodpolynomial zeroscomplex polynomialsimultaneous approximation of all zeros

Mathematics Subject Classification ID

Zeros of polynomials, rational functions, and other analytic functions of one complex variable (e.g., zeros of functions with bounded Dirichlet integral) (30C15) Numerical computation of solutions to single equations (65H05)

Cites Work

• Unnamed Item
• A family of simultaneous zero-finding methods
• On zeros of polynomial and vector solutions of associated polynomial system from Viëta theorem
• Finding roots of a real polynomial simultaneously by means of Bairstow's method
• On initial conditions for the convergence of simultaneous root finding methods
• Solving a Polynomial Equation: Some History and Recent Progress

This page was built for publication: Recursive algorithm without extra function evaluations for the Jacobian matrix of Viéta's polynomial system with applications