Fast computation of multinomial coefficients
| Autor: | Adriano S. Vale-Cardoso, Leonardo Carneiro de Araújo, João Pedro Hallack Sansão |
|---|---|
| Rok vydání: | 2021 |
| Předmět: |
Applied Mathematics
Computation Numerical analysis Fast Fourier transform Discrete Fourier transform Statistics::Computation ComputingMethodologies_PATTERNRECOGNITION ComputingMethodologies_SYMBOLICANDALGEBRAICMANIPULATION Theory of computation Applied mathematics Multinomial distribution Algebra over a field Binomial coefficient Mathematics |
| Zdroj: | Numerical Algorithms. 88:837-851 |
| ISSN: | 1572-9265 1017-1398 |
| DOI: | 10.1007/s11075-020-01059-5 |
| Popis: | In a previous publication, we have used the discrete Fourier transform to compute the binomial coefficients. In the present paper, we extend the previously proposed method to compute the multinomial coefficients, analyse its precision and performance. The other methods, analysed in our previous publication, are also extended to the multinomial case. The FFT method presents the best performance to compute all multinomial coefficients at a given level. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full text from SpringerLink