Donald M. Olsson

A Sequential Simplex Program for Solving Minimization Problems

Nelder and Mead [2] have developed a simple, robust direct-search procedure for finding the minimum of a function. It consists of evaluating a function of n variables at the (n + 1) vertices of a g...

Estimation for Mixtures of Distributions by Direct Maximization of the Likelihood Function

Computer programs are given for a procedure for representing a set of grouped data by 1). a mixture of two normal distributions, and 2). a mixture of two Weibull distributions, using maximum likelihood estimates...

Randomized Complete Block Design

A computer program is given which assists in analyzing data obtained from a randomized complete block experimental design with one observation per treatment-block combination. One worked example is...

Fitting Johnson's SB and SU Systems of Curves using the Method of Maximum Likelihood

The computer program listed fits either a Johnson SB or SU curve to grouped data. This gives the user a general procedure for fitting a wide range of data. The routine utilizes the Nelder-Mead simp...