Furthermore, in the case that W N and X has n non-zeroes, the calculation of the SVD is of complexity O(nN + W N 2 ) and requires O(W N ) bytes of memory.
oNETA requires computation time of o(N a ) for a > 2, which is the complexity of the matrix inversion algorithm 3 , and only o(n + N 2 ) bytes of memory.