Hi
The deterministic part is O(n^2) provided you don't run into memory issues. With 4000 time points on a laptop memory will most likely be you immediate problem - if your machine ends up swapping memory to disk then this could increase the runtime very significantly. What do you get from 'top' in the terminal?
hth
Christian
On 21 Apr 2010, at 09:58, Daniel Kalthoff wrote:
> about complexity of the ICA algorithm? Is it linear, qudaratic, etc.? Or is it impossible to tell, since runtime depends on the actual data?
|