Displaying similar documents to “A note on the IPF algorithm when the marginal problem is unsolvable”

Strict maximum separability of two finite sets: an algorithmic approach

Dorota Cendrowska (2005)

International Journal of Applied Mathematics and Computer Science

Similarity:

The paper presents a recursive algorithm for the investigation of a strict,linear separation in the Euclidean space. In the case when sets are linearly separable, it allows us to determine the coefficients of the hyperplanes. An example of using this algorithm as well as its drawbacks are shown. Then the algorithm of determining an optimal separation (in the sense of maximizing the distance between the two sets) is presented.

Measuring and maintaining consistency: a hybrid FTF algorithm

James Bunch, Richard Le Borne, Ian Proudler (2001)

International Journal of Applied Mathematics and Computer Science

Similarity:

Due to the versatility as well as its ease of implementation, the Fast Transversal Filters algorithm is attractive for many adaptive filtering applications. However, it is not widely used because of its undesirable tendency to diverge when operating in finite precision arithmetic. To compensate, modifications to the algorithm have been introduced that are either occasional (performed when a predefined condition(s) is violated) or structured as part of the normal update iteration. However,...