Fast computation of multinomial coefficients

DOI10.1007/S11075-020-01059-5MaRDI QIDQ820731zbMATH OpenOpenAlexFDO

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

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)

Recommendations

• scientific article; zbMATH DE number 3907734
• scientific article; zbMATH DE number 4132254
• scientific article; zbMATH DE number 1354891
• Some Counting Problems Involving the Multinomial Expansion
• scientific article; zbMATH DE number 3856407

Cites work

• Accuracy of the Discrete Fourier Transform and the Fast Fourier Transform
• Fast computation of binomial coefficients
• Fermat's Little Theorem from the Multinomial Theorem
• Handbook of Floating-Point Arithmetic
• scientific article; zbMATH DE number 3443655 (Why is no real title available?)
• scientific article; zbMATH DE number 3389046 (Why is no real title available?)
• Maximum likelihood estimation for constrained parameters of multinomial distributions -- appli\-cation to Zipf-Mandelbrot models

Cited in

(4)

• Calculation of binomial and multinomial coefficients by sequences of summations
• Computing Binomial Coefficients
• scientific article; zbMATH DE number 5257529 (Why is no real title available?)
• A fast method for obtaining convex combination coefficients

Describes a project that uses

Uses Software

• Octave
• Matlab
• GitHub

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q820731)