Abstract
An algorithm for computing exact multinomial probabilities is presented that uses the fewest number of operations that are possible without symbolic simplification of the multinomial coefficient and performs them in a sequence that minimizes the potential for overflow or underflow errors. Multinomial probabilities computed with this algorithm are accurate to machine precision, unlike those based on logarithmic transformations and/or the evaluation of factorials, using Stirling's approximation.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Behavior research methods, instruments, & computers : a journal of the Psychonomic Society, Inc
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
