“…(2) via a standard non-negative least squares (NNLS) algorithm (Lawson and Hanson, 1974). Points with nonzero weights are stored and merged with a new randomly generated set of 200 (R 2 , D || , D ⊥ , θ, ϕ) points, and the weights of the merged set of points are found through a NNLS fit (Lawson and Hanson, 1974). The process of selecting points with nonzero weights, subsequently merging them with a random (R 2 , D || , D ⊥ , θ , ϕ) configuration, and finally fitting the merged set is repeated a total of 20 times in order to find a P (R 2 , D || , D ⊥ , θ, ϕ) distribution yielding a low residual sum of squares.…”