Fast Derivatives for Multilinear Polynomials

2019/11/06 by Valeri Aronov, Aronov, Valeri
Mathematics · Computer Science · #Advanced Topics in Algebra #Matrix Theory and Algorithms #Algebraic structures and combinatorial models

paper · pdf · doi:10.48550/arxiv.1911.02235

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.

Related

• Fast evaluation and root finding for polynomials with floating-point coefficients
• Accelerated Polynomial Evaluation and Differentiation at Power Series in\n Multiple Double Precision
• Evaluating polynomials in several variables and their derivatives on a\n GPU computing processor
• FFT-based Computation of Polynomial Coefficients and Related Tasks
• Fast polynomial transforms based on Toeplitz and Hankel matrices