title: MPROB: computation of multinomial probabilities.
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.
authors.affiliation: Departamento de Metodología, Facultad de Psicología, Universidad Complutense, Madrid, Spain. miguel@psi.ucm.es
authors.forename: M A
authors.initials: MA
authors.lastname: García-Pérez
mesh_terms: D000465:Algorithms; D015233:Models, Statistical; D011336:Probability; D012984:Software