Evaluating Polynomials at Fixed Sets of Points

Cited in

(27)

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

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)