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

DOI10.1016/J.AMC.2003.12.107MaRDI QIDQ1765801zbMATH OpenOpenAlexFDO

Authors Xinyuan 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

algorithmcomplex polynomialNewton's methodnumerical examplepolynomial zerossimultaneous 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)

Review text

The authors want to formulate an algorithm to compute all zeros of a complex polynomial simultaneously. To this end they formulate the problem for a polynomial of degree \(m\) in a complex space of dimension \(m\). The system of equations is based on Viéta's relations for the coefficients of the polynomial with its roots. The system of equations is evaluated recursively, and it is shown how the Jacobian of this system can be computed on the side without much extra cost. This gives the basis to use Newton's method. Of course Newton's method will require the solution of equations with this Jacobian, i. e. the action of its inverse. It is shown that the Jacobian is nonsingular for distinct roots. The paper ends with a small numerical example.

Recommendations

• On zeros of polynomial and vector solutions of associated polynomial system from Viëta theorem
• Jacobi-free and complex-free method for finding simultaneously all zeros of polynomials having only real zeros
• A composite polynomial zerofinding matrix algorithm
• scientific article; zbMATH DE number 4209462
• Ein numerisches Verfahren zur simultanen Ermittlung aller Nullstellen eines Polynoms. (A numerical method for the simultaneous computation of all zeros of a polynomial)

Cites work

• A family of simultaneous zero-finding methods
• Finding roots of a real polynomial simultaneously by means of Bairstow's method
• scientific article; zbMATH DE number 1472783 (Why is no real title available?)
• On initial conditions for the convergence of simultaneous root finding methods
• On zeros of polynomial and vector solutions of associated polynomial system from Viëta theorem
• Solving a Polynomial Equation: Some History and Recent Progress

Cited in

(8)

• Solving triangular algebraic systems by means of simultaneous iterations
• On zeros of polynomial and vector solutions of associated polynomial system from Viëta theorem
• scientific article; zbMATH DE number 4209462 (Why is no real title available?)
• scientific article; zbMATH DE number 645800 (Why is no real title available?)
• scientific article; zbMATH DE number 1112751 (Why is no real title available?)
• Relationship Theorem between Nonlinear Polynomial Equations and the Corresponding Jacobian Matrix
• scientific article; zbMATH DE number 2219554 (Why is no real title available?)
• Jacobi-free and complex-free method for finding simultaneously all zeros of polynomials having only real zeros

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1765801)