Recursive algorithm without extra function evaluations for the Jacobian matrix of Viéta's polynomial system with applications
From MaRDI portal
Publication:1765801
DOI10.1016/j.amc.2003.12.107zbMath1077.65050OpenAlexW2014952689MaRDI QIDQ1765801
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
algorithmnumerical exampleNewton's methodpolynomial zeroscomplex polynomialsimultaneous approximation of all zeros
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
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
