title: Lapack's row reduction
body: <p>I am trying to write a function that produces a single solution to an underrepresented system of equations (e.g. the matrix that describes the system is wider than it is tall). In order to do this, I have been looking in the LAPACK documentation for a way to row-reduce a matrix to it's reduced-echelon form, similar to the function rref() in both Mathematica and TI calculators. The closest I came across was <a href="http://software.intel.com/en-us/forums/intel-math-kernel-library/topic/53107/" rel="nofollow noreferrer">http://software.intel.com/en-us/forums/intel-math-kernel-library/topic/53107/</a> this tiny thread. This thread, however, seems to imply that simply taking the "U" upper triangular matrix (and dividing each row by the diagonal) is the same as the reduced echelon form of a matrix, which I do not believe to be the case. I could code up rref() myself, but I do not believe I could achieve the performance LAPACK is famous for.</p>
  
  <p>1) Is there a better way to simply get any one specific solution to an underrepresented system?<br>
  2) If not, is there a way for LAPACK to row-reduce a matrix?</p>
  
  <p>Thanks!</p>