Fast Derivatives for Multilinear Polynomials
Symbolic Computation
2020-09-25 v2
Abstract
The article considers linear functions of many (n) variables - multilinear polynomials (MP). The three-steps evaluation is presented that uses the minimal possible number of floating point operations for non-sparse MP at each step. The minimal number of additions is achieved in the algorithm for fast MP derivatives (FMPD) calculation. The cost of evaluating all first derivatives approaches to only 1/8 of MP evaluation with a growing number of variables. The FMPD algorithm structure exhibits similarity to the Fast Fourier Transformation (FFT) algorithm.
Cite
@article{arxiv.1911.02235,
title = {Fast Derivatives for Multilinear Polynomials},
author = {Valeri Aronov},
journal= {arXiv preprint arXiv:1911.02235},
year = {2020}
}
Comments
7 pages, 3 figures