Row Reduced Echelon Form of a Matrix

[jwells777]

Hi,

I am relatively new to the Intel MKL package and I was wondering what the most efficient way to obtain the RREF form of a Node Incidence Matrix (Ani)of a bidirectional graph would be given that I have Ani in either sparse or full form. Is there a straight forward single call for this, or can it be extracted easily from one of the LAPACK routines?

Thanks,

Jason

[Intel_C_Intel]

Jason,

I see that no one responded to you question. I suspect you may have found an answer by now, but on the chance that you have not, I will put my 2 in. You have essentially answered your own question in your last sentence. The LAPACK GEneral TRiangular Factorization functions will provide the LU factorization of the matrix. Scaling each row by the inverse of the diagonal will create the form you need.

Bruce