I don't know how often, but there is an application of higher-ranked arrays: FFT. http://code.jsoftware.com/wiki/Essays/FFT . For argument vectors of length 2^n, the algorithm creates rank n binary hypercubes, shape n$2. (Subfunction "cube".)
On Fri, Dec 29, 2017 at 8:10 PM, TongKe Xue <[email protected]> wrote: > Hi, > > > 1. I agree that the concept of rank + cell + frames + implicit > parallel8ism is very cool. > > > 2. 5 dimension is commonly defined as N, C, D, H, W: > N = number of images > C = channels > D = depth > H = height > W = width > > In practice, how often do we use algorithms with > 5 dim tensors? > > > 3. In particular, in the case of GPU, if we consider a float array with > 10,000 image samples, 10 features, each being 100x100, we're already at: > > 10^(4+1+2+2) = 10^9 floats. At 4 bytes/float, we're at 4GB already, on > video consumer cards that are generally <= 12GB. > > Going back to the original question -- for numerical computing in J, how > often do we use algorithms with > 5 dimension tensors? > > > Thanks, > --TongKe > ---------------------------------------------------------------------- > For information about J forums see http://www.jsoftware.com/forums.htm ---------------------------------------------------------------------- For information about J forums see http://www.jsoftware.com/forums.htm
