Introduction - If you have any usage issues, please Google them yourself
SGELSD computes the minimum-norm solution to a real linear least
* squares problem:
* minimize 2-norm(| b- A*x |)
* using the singular value decomposition (SVD) of A. A is an M-by-N
* matrix which may be rank-deficient.