MA-581K/CSC-691K Homework 3 (due October 29 at 5pm)
Extend to LUP factorization algorithm for matrices, which is
based on a fast matrix multiplication algorithm, to an algorithm
that can compute in O(nmx-1) arithmetic operations the right
null space and a single solution, or indicate that
none exists, of a rectangular linear system
of dimensions m,n where m < n. Here k by k matrix multiplication
can be achieved in O(kx) for x > 2 and the dimensions
of the system are either m by n or n by m.