On using symmetric polynomials for constructing root finding methods

DOI10.1090/MCOM/3531zbMATH Open1441.30011arXiv1806.06280OpenAlexW3006374486MaRDI QIDQ5113669FDOQ5113669

Dmitry I. Khomovsky

Publication date: 15 June 2020

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

Abstract: We propose an approach to constructing iterative methods for finding polynomial roots simultaneously. One feature of this approach is using the fundamental theorem of symmetric polynomials. Within this framework, we reconstruct many of the existing root finding methods. The new results presented in this paper are some modifications of the Durand-Kerner method.

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

Recommendations

• Symmetric functions and root-finding algorithms
• Inverse power and Durand-Kerner iterations for univariate polynomial root-finding
• The simultaneous approximation of polynomial roots
• A Globally Convergent Method for Simultaneously Finding Polynomial Roots
• Construction of zero-finding methods by Weierstrass functions

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)

Cites Work

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

Cited In (2)

• Symmetric functions and root-finding algorithms
• Relations between roots and coefficients, interpolation and application to system solving

Uses Software

• na10

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

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