search for: n1xn2

...ng and simulating social systems with matlab. Tech. rep., Swiss Federal Institute of Technology (December 2009). 27. Ahora estoy convirtiendo la siguiente funcin: function sizes = gridsizes(N,varargin) % gridsizes(N) calculates the best factorization of N into two integers N1 and % N2 such that : N1xN2 == N and N2-N1 -> min (optimal grid) % gridsizes(N,C1,C2) calculates the best factorization of N into two integers N1 and % N2 such that : N1xN2 == N and N2-N1 -> min, under the condition that N1 % divides C1 and N2 divides C2 (optimal subgrids for an already existing % grid of size C1xC2 N)...

Dear all, I think that my question is very simple but I failed to solve it. I have a list which elements are matrices like this: >mylist [[1]] [,1] [,2] [,3] [1,] 1 3 5 [2,] 2 4 6 [[2]] [,1] [,2] [,3] [1,] 7 9 11 [2,] 8 10 12 I'd like to create a matrix M<-mylist[[1]]+mylist[[2]] [,1] [,2] [,3] [1,] 8 12 16 [2,] 10 14 18

...`, but we are writing an array of size `(s0, s1) = (3, 6)` starting from `(o0, o1) = (4, 6)`. Clearly, we will exceed the width of the array, since `(s1 + o1 = 6 + 6 = 12) > (n1 = 9)`. However, now think of the array as a flattened 1D representation. In this case, the total size of the array is `n1xn2 = 8x9 = 72`, while the largest element we will access is at the largest value of `(i, j)`. That is, `i = s0 - 1 = 2`, and `j = s1 - 1 = 5`. The largest index will be `ix(i=2, j=5, n0=8, n1=9, o0=4, o1=6) = 8*2+8*4+5+6=59`. Since `59 < 72`, we are clearly at _legal_ array indices, by C semantics...

...ze >> `(s0, s1) = (3, 6)` starting from `(o0, o1) = (4, 6)`. Clearly, we will >> exceed the width of the array, since `(s1 + o1 = 6 + 6 = 12) > (n1 = 9)`. >> However, now think of the array as a flattened 1D representation. In this >> case, the total size of the array is `n1xn2 = 8x9 = 72`, while the largest >> element we will access is at the largest value of `(i, j)`. That is, >> `i = s0 - 1 = 2`, and `j = s1 - 1 = 5`. >> >> The largest index will be `ix(i=2, j=5, n0=8, n1=9, o0=4, o1=6) = 8*2+8*4+5+6=59`. >> Since `59 < 72`, we are clea...

...ze > `(s0, s1) = (3, 6)` starting from `(o0, o1) = (4, 6)`. Clearly, we will > exceed the width of the array, since `(s1 + o1 = 6 + 6 = 12) > (n1 = 9)`. > However, now think of the array as a flattened 1D representation. In this > case, the total size of the array is `n1xn2 = 8x9 = 72`, while the largest > element we will access is at the largest value of `(i, j)`. That is, > `i = s0 - 1 = 2`, and `j = s1 - 1 = 5`. > > The largest index will be `ix(i=2, j=5, n0=8, n1=9, o0=4, o1=6) = 8*2+8*4+5+6=59`. > Since `59 < 72`, we are clearly...

...`(s0, s1) = (3, 6)` starting from `(o0, o1) = (4, 6)`. Clearly, we will >>> exceed the width of the array, since `(s1 + o1 = 6 + 6 = 12) > (n1 = 9)`. >>> However, now think of the array as a flattened 1D representation. In this >>> case, the total size of the array is `n1xn2 = 8x9 = 72`, while the largest >>> element we will access is at the largest value of `(i, j)`. That is, >>> `i = s0 - 1 = 2`, and `j = s1 - 1 = 5`. >>> >>> The largest index will be `ix(i=2, j=5, n0=8, n1=9, o0=4, o1=6) = 8*2+8*4+5+6=59`. >>> Since `59 &...

...` starting from `(o0, o1) = (4, 6)`. Clearly, we will > > > exceed the width of the array, since `(s1 + o1 = 6 + 6 = 12) > (n1 = 9)`. > > > However, now think of the array as a flattened 1D representation. In this > > > case, the total size of the array is `n1xn2 = 8x9 = 72`, while the largest > > > element we will access is at the largest value of `(i, j)`. That is, > > > `i = s0 - 1 = 2`, and `j = s1 - 1 = 5`. > > > > > > The largest index will be `ix(i=2, j=5, n0=8, n1=9, o0=4, o1=6) = 8*2+8*4+5+6=59`. >...