Charles: Thanks for your response. I understand now that your application is ecological, but the mathematical nature and the discretization of your system is still unclear. You might consider a 'lazy' approach, in which you compute a distance when you need it, rather than computing them all and storing in a matrix. Or perhaps you should consult an applied mathematician at your university and get some help on how to represent your data set efficiently. I suspect there's a better way than just increasing the number of grid points.
John On Thursday, August 13, 2015 at 6:26:55 AM UTC-4, Charles Santana wrote: > > Hi all, > > Do you recommend a way to work with bit matrices in Julia. By "big" I mean > a 65600 x 65600 symmetric matrix (the upper triangular matrix is equal to > the lower triangular one). > > I am studying the distances between sites at different resolution maps. > For low resolution we have few sites, and for big resolution we have more > sites (S). > > For few sites (small matrices) I was doing something like this: > > S = 100;#number of sites > M = zeros(S,S); > for i in 1:(S-1) > for j in (i+1):S > M[i,j] = dist(i,j);#where dist(i,j) is the distance between sites i > and j > end > end > > However, for big matrices I get the following message: > > S=65600; > M = zeros(S,S); > ERROR: OutOfMemoryError() > in call at essentials.jl:201 > in zeros at array.jl:233 > > I am using Julia Version 0.4.0-dev+5920 in Ubuntu 14.04. > > Thanks for any tip! > > Best, > > Charles > -- > Um axé! :) > > -- > Charles Novaes de Santana, PhD > http://www.imedea.uib-csic.es/~charles >
