On using symmetric polynomials for constructing root finding methods

DOI10.1090/MCOM/3531MaRDI QIDQ5113669zbMATH OpenOpenAlexFDO

Authors Dmitry I. Khomovsky

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)

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.

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

Cites work

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

Cited in

(2)

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

Describes a project that uses

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)