arXiv
Open Access
2019
Fast Derivatives for Multilinear Polynomials
Valeri Aronov
Abstrak
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.
Topik & Kata Kunci
Penulis (1)
V
Valeri Aronov
Akses Cepat
Informasi Jurnal
- Tahun Terbit
- 2019
- Bahasa
- en
- Sumber Database
- arXiv
- Akses
- Open Access ✓