I would like to figure out which row in a two-dimensional matrix has
the lowest mean value. I suppose I could scissors the matrix up into
a bunch of one-dimensional matrices then use a bunch of jit.3m's to
compute the mean of each row, but that doesn't sound very efficient
or scalable. Anyone have a better idea?