Time complexity of scipy.linalg.solve (LAPACK gesv) on large matrix?

Question

If I use scipy.linalg.solve (which I believe calls LAPACK\'s gesv function) on a ~12000 unknown problem (with a ~12000-square, dense, non-symmetrical matrix) on my workstati

Answer 1

The time complexity of DGESV for an NxN matrix is O(N^3). See Table 3.13 here: http://www.netlib.org/lapack/lug/node71.html