Update FGFT pyfaust benchmark to compute errors on 'optimal' signed permutation of Uhat.

The test of Thomas Frerix algorithm is commented out but kept here in case it would be needed later (on my own tests it is not more accurate and is for sure slower).
The idea of using the optimal permutation comes from his article.