Explicit solutions to Newton's recurrence and their interpretations

zbMATH Open1128.65032MaRDI QIDQ5488341FDOQ5488341

Authors: Allen J. Schwenk 

Publication date: 14 September 2006

Recommendations

• Newton sum rules of polynomials defined by a three-term recurrence relation
• Analogs of recurrent Newton formulas
• scientific article; zbMATH DE number 2097281
• On the number of iterations of Newton's method for complex polynomials
• Newton's method in practice. II: The iterated refinement Newton method and near-optimal complexity for finding all roots of some polynomials of very large degrees

zbMATH Keywords

momentsrootspolynomialscoefficientsNewton's recurrence relations

Mathematics Subject Classification ID

General theory of numerical methods in complex analysis (potential theory, etc.) (65E05) 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)

This page was built for publication: Explicit solutions to Newton's recurrence and their interpretations

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