Re: [julia-users] Efficient way to iteratively grow a matrix up to a predefined maximum number of columns and pop/append columns after the maximum is reached

If you don't need to do anything order-dependent until after the pop-appending is done, you could probably use cyclic access when calculating the matrices in your algorithm, and then re-order based on the number of permutations you've performed. If your algorithm generates N+d columns, and you

Re: [julia-users] Efficient way to iteratively grow a matrix up to a predefined maximum number of columns and pop/append columns after the maximum is reached

I think the order is important, although I am not sure. I can test for that. However what is very important is that V and W have the same order.

Re: [julia-users] Efficient way to iteratively grow a matrix up to a predefined maximum number of columns and pop/append columns after the maximum is reached

Do you actually care about the order of columns? Or can you just use a cyclic representation? V[:, mod1(col, N)] = v --Tim On Sunday, May 11, 2014 04:48:08 PM Carlos Baptista wrote: > I have an iterative algorithm in which two matrices with a fixed number of > rows grow in number of columns. Th

[julia-users] Efficient way to iteratively grow a matrix up to a predefined maximum number of columns and pop/append columns after the maximum is reached

I have an iterative algorithm in which two matrices with a fixed number of rows grow in number of columns. The algorithm requires only the last *N*columns (where N is a predefined fixed integer). If the number of columns grow to *N + d*, then the first *d* columns are no longer required and can