Introduction - If you have any usage issues, please Google them yourself
Given a tall full-rank matrix A, solves the nonnegative least squares
problem: min ||Ax-b|| s.t. x>= 0 and returns the minimizer x. The
argument err is the tolerance used in testing for zeros