Limit points of the iterative scaling procedure (Q744663): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(4 intermediate revisions by 4 users not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1972855724 / rank | |||
Normal rank | |||
Property / arXiv ID | |||
Property / arXiv ID: 1207.5462 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5455545 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The diagonal equivalence of a nonnegative matrix to a stochastic matrix / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Information Theory and Statistics: A Tutorial / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3339003 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The Sinkhorn–Knopp Algorithm: Convergence and Applications / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Convergence of the Iterative Scaling Procedure for Non-Negative Matrices / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 02:44, 9 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Limit points of the iterative scaling procedure |
scientific article |
Statements
Limit points of the iterative scaling procedure (English)
0 references
26 September 2014
0 references
The iterative scaling procedure (ISP) generates a sequence of matrices rescaling alternately its rows and columns to arrive at a matrix with prescribed row and column sums. If the starting matrix \(A\) is connected with nonnegative elements, ISP will converge. However, when this iterative process has two limit points, convergence is slow. This paper gives an efficient algorithm to find both limit points in such a case. The idea is to partition the sets of row and column indices. These define blocks which are then iteratively refined. This gives a decomposition of the matrix, and the iteration can be performed on subblocks. This paper appeared in a special issue of the journal and another paper in that issue discusses a similar problem (cf. [\textit{F. Pukelsheim}, ibid. 215, 269--283 (2014; Zbl 1302.65114)]).
0 references
iterative scaling procedure
0 references
alternating divergence minimization
0 references
biproportional fitting
0 references
algorithm
0 references