Limit points of the iterative scaling procedure

From MaRDI portal
Publication:744663




Abstract: The iterative scaling procedure (ISP) is an algorithm which computes a sequence of matrices, starting from some given matrix. The objective is to find a matrix 'proportional' to the given matrix, having given row and column sums. In many cases, for example if the initial matrix is strictly positive, the sequence is convergent. In the general case, it is known that the sequence has at most two limit points. When these are distinct, convergence can be slow. We give an efficient algorithm which finds these limit points, invoking the ISP only on instances for which the procedure is convergent.









This page was built for publication: Limit points of the iterative scaling procedure

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q744663)