On using symmetric polynomials for constructing root finding methods

DOI10.1090/mcom/3531zbMath1441.30011arXiv1806.06280OpenAlexW3006374486MaRDI QIDQ5113669

D. I. Khomovskii

Publication date: 15 June 2020

Published in: Mathematics of Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1806.06280

zbMATH Keywords

polynomialsWeierstrass-Durand-Kerner methoditerative methods for finding roots

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)

Uses Software

• na10

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On some improvements of square root iteration for polynomial complex zeros
• Numerical computation of polynomial zeros by means of Aberth's method
• Point estimation of root finding methods
• A note on some improvements of the simultaneous methods for determination of polynomial zeros
• On the convergence order of a modified method for simultaneous finding polynomial zeros
• Parallel Laguerre iterations: The complex case
• On the convergence of Wang-Zheng's method
• Inverse power and Durand-Kerner iterations for univariate polynomial root-finding
• Numerical methods for roots of polynomials. II
• Ein Gesamtschrittverfahren zur Berechnung der Nullstellen von Polynomen
• Zur iterativen Auflösung algebraischer Gleichungen
• Generalised Root Iterations for the Simultaneous Determination of Multiple Complex Zeros
• On Halley's Iteration Method
• Newton's Identities
• Some higher-order methods for the simultaneous approximation of multiple polynomial zeros
• Iteration Methods for Finding all Zeros of a Polynomial Simultaneously
• A modified Newton method for polynomials

This page was built for publication: On using symmetric polynomials for constructing root finding methods