On the complexity of algorithms for the translation of polynomials

DOI10.1007/BF02242791zbMath0422.65011OpenAlexW413656932MaRDI QIDQ1133877

Stylianos D. Danielopoulos, Alkiviadis G. Akritas

Publication date: 1980

Published in: Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02242791

zbMATH Keywords

fast Fourier transformTaylor expansioncomplexity of algorithmscoefficients of translated polynomialsRuffini-Horner method

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computation of special functions and constants, construction of tables (65D20)

Related Items

The fastest exact algorithms for the isolation of the real roots of a polynomial equation, An implementation of Vincent's theorem, Vincent's forgotten theorem, its extension and application, On the cost of evaluating polynomials and their derivatives, Exact algorithms for polynomial real root approximation using continued fractions, Computationally efficient algorithms for a one-time pad scheme, On the solution of polynomial equations using continued fractions, Polynomial real root approximation using continued fractions

Cites Work

• Unnamed Item
• Unnamed Item
• Elementare Darstellung der schnellen Fouriertransformation
• On the forgotten theorem of Mr. Vincent
• Evaluating Polynomials at Fixed Sets of Points
• A short note on a new method for polynomial real root isolation