Yi Cao

Hi Steffen,

If Y is rank difficient, the original formular has to change because it was derived based on the assuption YY^T is not signular. As you said, this only possiblelly happens when measurement errors are ignored. In other words, we can always add very small measurement errors to avoid such singularity. You can always assume Wn = eI with a sufficiently small e to make the code works.

Hope this helps.

Yi

Well, I can see what you try to do is to increase the cost of selected assignment then to find next best assignment. However, you made a wrong change. The assignment results in dicated row 1 assigned with colume 3, but you miss understood as column 1 assigned with row 3. Wish this helps.

Thank you Prof. Yi Cao.

I have a problem at this point:
X=sigma(x,P,c) %sigma points around x

It keeps saying:

"Index exceeds matrix dimensions.
Error in sigma (line 97)
a=varargin{1}; b=varargin{2}; c=varargin{3}; d=varargin{4};"

when i run this instead:
X=sigma(x,P,c,[],1), it says:

"Error using sigma (line 107)
The A matrix must be square"

Please does anyone have a solution to this? I can't seem to get past this point.

Thank you.

v3.0 seems to give correct result every time, with a 4x speed advantage over Munkres for a 100 by 100 matrix. Thanks for the great routine, Yi.

Yi, It seems to fail for 2x2 (0.0022% of the time) and 3x3 cost matrices about 0.014% of random cases. For 4x4, it hasn't failed in over 1 million cases, but that doesn't mean that it won't in some larger sample. That means it's a real tough bug to track down, I would guess. Bill