Naively, if at each iteration one solves a linear system, the complexity will be "k*O(n)", where "k" is number of iterations; similarly, calculating the inverse matrix and applying it at each iteration is of complexity "k*O(n)".