Multi-point evaluation in higher dimensions
From MaRDI portal
Publication:1938507
DOI10.1007/s00200-012-0179-3zbMath1280.68303MaRDI QIDQ1938507
Joris van der Hoeven, Éric Schost
Publication date: 21 February 2013
Published in: Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00200-012-0179-3
complexity; algorithm; multi-point evaluation; multi-point interpolation; power series multiplication
68W30: Symbolic computation and algebraic computation
Related Items
On the Complexity of Multivariate Polynomial Division, Implicitization of curves and (hyper)surfaces using predicted support, Fast transforms over finite fields of characteristic two, Fast Gröbner basis computation and polynomial reduction for generic bivariate ideals, Fast multivariate multi-point evaluation revisited, Fast systematic encoding of multiplicity codes, Algebraic diagonals and walks: algorithms, bounds, complexity, Counting points on hyperelliptic curves of genus 2 with real models
Cites Work
- Unnamed Item
- Unnamed Item
- On multivariate interpolation by generalized polynomials on subsets of grids
- Remarks on Newton type multivariate interpolation for subsets of grids
- On fast multiplication of polynomials over arbitrary algebras
- Fast modular transforms
- Simple multivariate polynomial multiplication
- De nugis Groebnerialium. II: Applying Macaulay's trick in order to easily write a Gröbner basis
- Relax, but don't be too lazy
- On the bit-complexity of sparse polynomial and series multiplication
- Polynomial evaluation and interpolation on special sets of points
- The probability to select the correct model using likelihood-ratio based criteria in choosing between two nested models of which the more extended one is true
- Lagrange interpolation on subgrids of tensor product grids
- The truncated fourier transform and applications
- Multivariate power series multiplication