Fast computation of multinomial coefficients

DOI10.1007/S11075-020-01059-5zbMath1485.65018OpenAlexW3119406166MaRDI QIDQ820731

João P. H. Sansão, Adriano S. Vale-Cardoso, Leonardo C. Araujo

Publication date: 27 September 2021

Published in: Numerical Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11075-020-01059-5

zbMATH Keywords

discrete Fourier transformmultinomial coefficient

Mathematics Subject Classification ID

Computation of special functions and constants, construction of tables (65D20) Complexity and performance of numerical algorithms (65Y20)

Uses Software

• GitHub
• Unnamed Item
• Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Maximum likelihood estimation for constrained parameters of multinomial distributions -- appli\-cation to Zipf-Mandelbrot models
• Fast computation of binomial coefficients
• Handbook of Floating-Point Arithmetic
• Fermat's Little Theorem from the Multinomial Theorem
• Accuracy of the Discrete Fourier Transform and the Fast Fourier Transform

This page was built for publication: Fast computation of multinomial coefficients