Power sum method and the approximative solution of algebraic equations

Turán, Paul

doi:10.1090/S0025-5718-1975-0368413-8

Mathematics of Computation

Published by the American Mathematical Society since 1960 (published as Mathematical Tables and other Aids to Computation 1943-1959), Mathematics of Computation is devoted to research articles of the highest quality in computational mathematics.

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

The 2020 MCQ for Mathematics of Computation is 1.78.

What is MCQ? The Mathematical Citation Quotient (MCQ) measures journal impact by looking at citations over a five-year period. Subscribers to MathSciNet may click through for more detailed information.

Power sum method and the approximative solution of algebraic equations
HTML articles powered by AMS MathViewer

by Paul Turán PDF

Math. Comp. 29 (1975), 311-318 Request permission

Abstract:

A universal algorithm is given for computing a root of an arbitrary polynomial with complex coefficients in a number of operations dependent only on the order n and relative error $\varepsilon$. This paper is a brief English exposition of the author’s earlier "Algebrai egyenletek közelitö megoldásáról," Vol. XVIII of the Communications of the III Class of the Hungarian Academy of Sciences (1968), pp. 223-235.

References