Simplifying loop for Incidence Matrix I had to work in the Transport Problem and we're asked to try to make the fastest code for big matrices, so we're advised to try to avoid loops. And the only one I've got and I cannot imagine how to simplify it is this one for making an incidence matrix (with 1s, 0s and -1s) like that:

b&lt;-diag(-1,n2)
a&lt;-b
for (i in 1:(n1-1)) {
  a&lt;-cbind(a,b)
}


Can this be simplified?
I can't think of anything faster than:

a &lt;- matrix(diag(-1, n2), nrow = n2, ncol = n1 * n2)


The n2 * n2 values inside diag(-1L, n2) will be recycled n1 times to fill the final matrix of dimensions n2-by-n1*n2.