We present two iterative algorithms in this chapter, for the actual computation of the key matrix U. Both are based on the fixed point equation of Theorem 2.8 . Proof of convergence for the first algorithm is built on the physical, probabilistic interpretation of the successive iterations. The second, quadratically convergent algorithm is based on Newton’s method, and its analysis relies mostly on linear algebraic arguments.