Multi-point evaluation in higher dimensions
Abstract
In this paper, we propose efficient new algorithms for multi-dimensional multi-point evaluation and interpolation on certain subsets of so called tensor product grids. These point-sets naturally occur in the design of efficient multiplication algorithms for finite-dimensional C-algebras of the form A=C[x1,...,xn]/I, where I is finitely generated by monomials of the form x1^i1 ... xn^in; one particularly important example is the algebra of truncated power series C[x1,...xn]/(x1,...,xn)^d. Similarly to what is known for multi-point evaluation and interpolation in the univariate case, our algorithms have quasi-linear time complexity. As a known consequence, we obtain fast multiplication algorithms for algebras A of the above form.
Origin : Files produced by the author(s)
Loading...