Hi,

I know that Lapack, because of its historical link to Fortran, was written to handle matrices in column major order. It can also handle matrices in row major order through the LAPACKE interface. But I have realized that many algorithms (LU decomposition for instance) transpose the matrix when given in row major order and then call the code written for column major order. As a consequence, the same algorithm can be up to 30% slower when the matrix is given in row major order.

Here are my questions:

- Is there any LAPACK algorithm that can't be coded as efficiently in both of the ordering?

- Do you plan to implement efficient algorithm for row ordered matrix so the transposition could be avoided?

Best regards,

François