Remote Access Mathematics of Computation
Green Open Access

Mathematics of Computation

ISSN 1088-6842(online) ISSN 0025-5718(print)

 
 

 

On using symmetric polynomials for constructing root finding methods


Author: Dmitry I. Khomovsky
Journal: Math. Comp. 89 (2020), 2321-2331
MSC (2010): Primary 30C15, 65H05
DOI: https://doi.org/10.1090/mcom/3531
Published electronically: April 6, 2020
MathSciNet review: 4109568
Full-text PDF
View in AMS MathViewer New

Abstract | References | Similar Articles | Additional Information

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.


References [Enhancements On Off] (What's this?)


Similar Articles

Retrieve articles in Mathematics of Computation with MSC (2010): 30C15, 65H05

Retrieve articles in all journals with MSC (2010): 30C15, 65H05


Additional Information

Dmitry I. Khomovsky
Affiliation: Faculty of Physics, Lomonosov Moscow State University, 1-2 Leninskie Gory, 119991 Moscow, Russia
Email: khomovskij@physics.msu.ru

DOI: https://doi.org/10.1090/mcom/3531
Keywords: Polynomials, iterative methods, Weierstrass--Durand--Kerner method
Received by editor(s): June 16, 2018
Received by editor(s) in revised form: June 23, 2018, August 2, 2019, and January 13, 2020
Published electronically: April 6, 2020
Article copyright: © Copyright 2020 American Mathematical Society