BackwardSubstitution 
Backward substitution solves a matrix equation in the form Ux = b
by an iterative process for an upper triangular matrix U.

ForwardSubstitution 
Forward substitution solves a matrix equation in the form Lx = b
by an iterative process for a lower triangular matrix L.

Kernel 
The kernel or null space (also nullspace) of a matrix A is the set of all vectors x for which Ax = 0.

LinearSystemSolver 
Solve a system of linear equations in the form:
Ax = b,
We assume that, after row reduction, A has no more rows than columns.

LSProblem 
This is the problem of solving a system of linear equations.

LUSolver 
Use LU decomposition to solve Ax = b where A is square and
det(A) != 0.

OLSSolver 
This class solves an overdetermined system of linear equations in the
ordinary least square sense.

OLSSolverByQR 
This class solves an overdetermined system of linear equations in the
ordinary least square sense.

OLSSolverBySVD 
This class solves an overdetermined system of linear equations in the
ordinary least square sense.

ThomasAlgorithm 
Thomas algorithm is an efficient algorithm to solve a linear tridiagonal matrix equation.
