#include "LLSSolver.h"
This class is for solving Linear Least Square (LLS) problem. The LLS is A * x = b, where A is of size m by n, x is n by one, and b is m by one
For robustness, the singular valuse decomposition (svd) is used. However, svd in lapack uses Fortran convention. note that A is a one-dimesional array, which store a 2D matrix using the Fortran comvension, i.e., store the first column, second column, and so on.
1.5.6