This function implements the method proposed by (Chauvet and Tillé 2006). It recursively transforms the vector of inclusion probabilities pik into a
sample that respects the balancing equations. The algorithm stops when the null space of the sub-matrix \(B\) is empty.
For more information see (Chauvet and Tillé 2006).
The function uses the function Null to find the null space of the sub-matrix \(B\).
References
Chauvet, G. and Tillé, Y. (2006). A fast algorithm of balanced sampling. Computational Statistics, 21/1:53-62