# Lookup-scheme for potentially large n choose k matrices

조회 수: 4(최근 30일)
Ulrik William Nash 10 Dec 2019
댓글: Rik 10 Dec 2019
I am writing a simulation that includes the variables n and k. These variable serves a part in numerous "n choose k" calculations. Since these caluclations are often identical in my simulation, and since n and k can be large (sometimes n > 20), I want to implement a scheme whereby the "n choose k" calculations are pre-computed and stored for lookup.
More specifically, k is not constant throughout my simulation. Within a simulation it can, for example, change from 5 to 4, to 6, to another number. Now, I want to avoid adding IF conditions for every value if n and k but I am unsure about the best-practice for creating a look-up scheme in my situation. To be sure, what must be looked-up are the "n choose k" matrixes, and not simply the binomial coefficients.
How might the described scheme be implemented?

로그인 to comment.

### 답변(1개)

Rik 10 Dec 2019
편집: Rik 10 Dec 2019
If the citeria below are satisfied, you can use memoize:
• Performance is important.
• The function is time consuming.
• The function has return values that are determined entirely by the input values, and has no side effects.
• System memory is adequate to store unique input and output combinations.
The last requirement is probably not true in your case, so you need to find a way to store the matrices on disk.
You could store it in a mat file that you would load partially, but I think a cleaner solution would be to use a preference group, so getpref and setpref. Note that this is a slow method for smaller sizes of n and k, because it loads data from the disk. You can probably improve on this by determining values where it is faster to memoize or generate on the fly, and values where loading from disk may be faster.
%n must be a scalar, which is expanded to 1:n
prefname=sprintf('n_%d_k_%d',n,k);
else
%create and store to disk
mat=nchoosek(1:n,k);
end
end
If you no longer have any use for this function (or if disk space becomes an issue), you can remove the entire preference group all at once:

#### 댓글 수: 2

Walter Roberson 10 Dec 2019
20!6 is only 38760 entries, so storing it in memory is probably feasible, especially if you can manage to fit the entries into uint8.
Rik 10 Dec 2019
I did some further testing, and it turns out I was trying to be cleverer than Mathworks. When I try n=30;k=20; I get the following warning (R2019b,Windows10):
Warning: Variable 'Preferences' was not saved. For variables larger than 2GB use MAT-file version 7.3 or later.
I was unable to find this limitation in the documentation (nor is there any reference in the release notes).

로그인 to comment.

이 질문에 답변하려면 로그인을(를) 수행하십시오.

Translated by