Generalizations of the Durand-Kerner method

06/16/2018
by   Dmitry I. Khomovsky, et al.
0

We propose an approach to constructing iterative methods for simultaneously finding polynomial roots. One feature of which is the use of the fundamental theorem of symmetric polynomials. The most interesting results are the simultaneous Householder's method and some generalizations of the Durand-Kerner method.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/09/2017

Tropicalization, symmetric polynomials, and complexity

D. Grigoriev-G. Koshevoy recently proved that tropical Schur polynomials...
research
12/03/2020

Constructing Segmented Differentiable Quadratics to Determine Algorithmic Run Times and Model Non-Polynomial Functions

We propose an approach to determine the continual progression of algorit...
research
06/19/2018

An Improved Formula for Jacobi Rotations

We present an improved form of the algorithm for constructing Jacobi rot...
research
03/11/2020

A generalized Sylvester-Gallai type theorem for quadratic polynomials

In this work we prove a version of the Sylvester-Gallai theorem for quad...
research
12/15/2022

Approximate counting using Taylor's theorem: a survey

In this article we consider certain well-known polynomials associated wi...
research
02/17/2022

Optimal polynomial smoothers for multigrid V-cycles

The idea of using polynomial methods to improve simple smoother iteratio...

Please sign up or login with your details

Forgot password? Click here to reset