how can we estimate memory requirements for nchoosek?

6 次查看(过去 30 天)
nchoosek is a memory intensive command ... to the point it can easily kneel down your system ... or get something back as the below:
Error using nchoosek>combs (line 175) Out of memory. Type HELP MEMORY for your options.
Error in nchoosek>combs (line 174) Q = combs(v(k+1:n),m-1);
Error in nchoosek>combs (line 174) Q = combs(v(k+1:n),m-1);
Error in nchoosek (line 132) c = combs(v,k);
Error in NChooseKR (line 7) parfor i = kRange
  1 个评论
Stephen23
Stephen23 2018-7-29
编辑:Stephen23 2018-7-29
Original question:
"how can we estimate memory requirements for nchoosek?"
Number of combinations * number of elements per combination * bytes per element

请先登录,再进行评论。

采纳的回答

dpb
dpb 2018-7-29
>> help nchoosek
nchoosek Binomial coefficient or all combinations.
...
nchoosek(V,K) where V is a vector of length N, produces a matrix
with N!/K!(N-K)! rows and K columns. Each row of the result has K of
the elements in the vector V. This syntax is only practical for
situations where N is less than about 15.
...
TMW writes documentation for a reason...
  4 个评论
Andy
Andy 2018-8-4
编辑:dpb 2018-8-4
Nonetheless in our case there ARE many equal sequences of values so compression could make sense. But I don't see anything baked in that could do this, is it?
dpb
dpb 2018-8-4
编辑:dpb 2018-8-4
>> nchoosek(int16(1:5),3)
ans =
10×3 int16 matrix
...
>> whos ans
Name Size Bytes Class Attributes
ans 10x3 60 int16
>> nchoosek((1:5),3)
ans =
...
>> whos ans
Name Size Bytes Class Attributes
ans 10x3 240 double
>>
Is 4:1; uint8 would be 8:1 and handle values up to 255; as implemented it may require double() first I don't know and there's still the issue of the specific recursive algorithm used that probably could be improved on.

请先登录,再进行评论。

更多回答(0 个)

类别

Help CenterFile Exchange 中查找有关 Elementary Math 的更多信息

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!

Translated by