The DOI matches its Crossref record; 14 of the 14 references it cites were found in a registry or an index.
A fast algorithm for matrix balancing
Open accessAbstract
As long as a square non-negative matrix A has total support then it can be balanced, that is, we can find a diagonal scaling of A that has row and column sums equal to one. A number of algorithms have been proposed to achieve the balancing, the most well known of these being Sinkhorn–Knopp. In this paper, we derive new algorithms based on inner–outer iteration schemes. We show that Sinkhorn–Knopp belongs to this family, but other members can converge much more quickly. In particular, we show that while stationary iterative methods offer little or no improvement in many cases, a scheme using a preconditioned conjugate gradient method as the inner iteration converges at much lower cost (in terms of matrix–vector products) for a broad range of matrices; and succeeds in cases where the Sinkhorn–Knopp algorithm fails.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Methods of conjugate gradients for solving linear systems
Hestenes, M. R., & Stiefel, E. (1952) · Journal of Research of the National Bureau of Standards · doi:10.6028/jres.049.044 · Cited by 8,132
Iterative Solution of Nonlinear Equations in Several Variables
Ortega, J. M., & Rheinboldt, W. C. (2000) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9780898719468 · Cited by 6,860
Iterative Solution of Nonlinear Equations in Several Variables
I., E., Ortega, J. M., & Rheinboldt, W. C. (1971) · Mathematics of Computation · doi:10.2307/2004942 · Cited by 4,408
Minimization of functions having Lipschitz continuous first partial derivatives
Armijo, L. (1966) · Pacific Journal of Mathematics · doi:10.2140/pjm.1966.16.1 · Cited by 1,983
Solving Nonlinear Equations with Newton's Method
Kelley, C. T. (2003) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9780898718898 · Cited by 1,105
Concerning nonnegative matrices and doubly stochastic matrices
Sinkhorn, R., & Knopp, P. (1967) · Pacific Journal of Mathematics · doi:10.2140/pjm.1967.21.343 · Cited by 887
The Sinkhorn–Knopp Algorithm: Convergence and Applications
Knight, P. A. (2008) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/060659624 · Cited by 372
Self-citationOn the scaling of multidimensional matrices
Franklin, J., & Lorenz, J. (1989) · Linear Algebra and its Applications · doi:10.1016/0024-3795(89)90490-4 · Cited by 213
Users' guide for the Harwell-Boeing sparse matrix collection (Release 1)
Duff, I., Grimes, R., & Lewis, J. (1992) · Technical report. RAL - Council for the Central Laboratory of the Research Councils · Cited by 157
A Deterministic Strongly Polynomial Algorithm for Matrix Scaling and Approximate Permanents
Linial, N., Samorodnitsky, A., & Wigderson, A. (2000) · COMBINATORICA · doi:10.1007/s004930070007 · Cited by 143
Scaling of matrices to achieve specified row and column sums
Marshall, A. W., & Olkin, I. (1968) · Numerische Mathematik · doi:10.1007/bf02170999 · Cited by 105
Bounds for characteristic roots of matrices
Taussky, O. (1948) · Duke Mathematical Journal · doi:10.1215/s0012-7094-48-01593-2 · Cited by 58
The rate of convergence of Sinkhorn balancing
Soules, G. W. (1991) · Linear Algebra and its Applications · doi:10.1016/0024-3795(91)90157-r · Cited by 45
Methods for scaling to doubly stochastic form
Parlett, B. Ν., & Landis, T. L. (1982) · Linear Algebra and its Applications · doi:10.1016/0024-3795(82)90099-4 · Cited by 43
Cited by
A 3D Map of the Human Genome at Kilobase Resolution Reveals Principles of Chromatin Looping
Rao, S. S. P., Huntley, M. H., Durand, N. C., Stamenova, E. K., Bochkov, I. D., Robinson, J. T., Sanborn, A. L., Machol, I., Omer, A. D., Lander, E. S., et al. (2014) · Cell · doi:10.1016/j.cell.2014.11.021 · Cited by 9,212
Juicer Provides a One-Click System for Analyzing Loop-Resolution Hi-C Experiments
Durand, N. C., Shamim, M. S., Machol, I., Rao, S. S. P., Huntley, M. H., Lander, E. S., & Aiden, E. L. (2016) · Cell Systems · doi:10.1016/j.cels.2016.07.002 · Cited by 3,836
Computational Optimal Transport
Peyré, G., & Cuturi, M. (2019) · now publishers, Inc. eBooks · doi:10.1561/9781680835519 · Cited by 847
Resolving the 3D Landscape of Transcription-Linked Mammalian Chromatin Folding
Hsieh, T.-H. S., Cattoglio, C., Slobodyanyuk, E., Hansen, A. S., Rando, O. J., Tjian, R., & Darzacq, X. (2020) · Molecular Cell · doi:10.1016/j.molcel.2020.03.002 · Cited by 661
Minajigi, A., Froberg, J. E., Wei, C., Sunwoo, H., Kesner, B., Colognori, D., Lessing, D., Payer, B., Boukhali, M., Haas, W., et al. (2015) · Science · doi:10.1126/science.aab2276 · Cited by 486
Metadata
- Authors
- Knight, P. A., & Ruiz, D.
- Venue
- IMA Journal of Numerical Analysis
- Publisher
- Oxford University Press (OUP)
- Published
- 2012-10-26
- Volume
- 33
- Issue
- 3
- Pages
- 1029-1047
- ISSN
- 0272-4979 (ISSN-L)
- 1464-3642
- OpenAlex
- W2102368172
- Cited by
- 507
- References
- 14
- FWCI
- 7.47
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.