Thus, the collage distance can be made arbitrarily small by choosing a suitable number of maps and probabilities, N*. By the same authors, the inverse problem can be posed as a quadratic programming one in the following notation
Then by (2) there exists a linear operator A : D(X) → D(X) associated to M such that hN = Ag. In particular
The series above are convergent as 0 ≤ Ani ≤ 1 and the minimum can be found by minimizing the quadratic form on the simplex ΠN. This is the main result in Forte and Vrscay (1995) that can be used straight forwardly in statistical applications as we propose in Section 4. On the other side Iacus and La Torre (2001) propose a di erent and direct approach to construction on IFSs on the space of distribution function on [0, 1]. Instead of constructing the IFS by matching the moments, the idea there is to have an IFS that has the same values of the target distribution function on a finite number of points.
Stefano M. Iacus, Davide La Torre
Next: 2.2 Direct approach