Kronecker product by nn

!$0{M=N;m=n;n=0}N=NF{$0=a=a$0;n++}END{for(;j=i<n*m;i++){for(;--j+N*M;)printf"%5d",$(i%n*N-j%N+m*M+1)*$(int(i/n)*M-j/N+1);print""}}

Note that non-ascii characters in the above source code will be escaped (such as \x9f).

download

return to the top page