Limit points of the iterative scaling procedure

From MaRDI portal
Publication:744663

DOI10.1007/S10479-013-1416-2zbMATH Open1302.65112arXiv1207.5462OpenAlexW1972855724MaRDI QIDQ744663FDOQ744663


Authors: Erik Aas Edit this on Wikidata


Publication date: 26 September 2014

Published in: Annals of Operations Research (Search for Journal in Brave)

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.


Full work available at URL: https://arxiv.org/abs/1207.5462




Recommendations




Cites Work


Cited In (7)





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)