Evaluating Polynomials at Fixed Sets of Points

Cited in

(28)

Polynomial division and its computational complexity
Algebraic complexity of computing polynomial zeros
Sequential and parallel complexity of approximate evaluation of polynomial zeros
On the complexity of algorithms for the translation of polynomials
Matrix identities of the fast Fourier transform
Selection of good algorithms from a family of algorithms for polynomial derivative evaluation
A new approach to fast polynomial interpolation and multipoint evaluation
Fast and efficient parallel evaluation of the zeros of a polynomial having only real zeros
Approximating complex polynomial zeros: modified Weyl's quadtree construction and improved Newton's iteration.
Fast Hermite interpolation and evaluation over finite fields of characteristic two
Polynomial evaluation and interpolation on special sets of points
Fast systematic encoding of multiplicity codes
An efficient algorithm for multivariate Maclaurin-Newton transformation
Fast multidimensional Bernstein-Lagrange algorithms
Fast computation of special resultants
On the complexity of skew arithmetic
Symbolic treatment of geometric degeneracies
A point counting algorithm using cohomology with compact support
Genus 2 point counting over prime fields
Implementing the tangent Graeffe root finding method
On matrices with displacement structure: generalized operators and faster algorithms
Nearly optimal computations with structured matrices
Conformal mapping in linear time
Homotopy techniques for multiplication modulo triangular sets
Factoring sparse polynomials fast
On the complexities of multipoint evaluation and interpolation
On arithmetical algorithms over finite fields
Fast evaluation and interpolation at the Chebyshev sets of points

This page was built for publication: Evaluating Polynomials at Fixed Sets of Points

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4091364)