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
Additional Information
- © Copyright 1975 American Mathematical Society
- Journal: Math. Comp. 29 (1975), 311-318
- MSC: Primary 65H05
- DOI: https://doi.org/10.1090/S0025-5718-1975-0368413-8
- MathSciNet review: 0368413