Most computational efficient way to solve a tiny (15x15) non symmetrical square matrix?

Question

So I\'m working on a project that relies on solving a really big amount of matrices (in the order of a couple of millions) and it has to do it quite fast, maybe less than 1