The rate of convergence of Sinkhorn balancing
From MaRDI portal
Publication:802704
DOI10.1016/0024-3795(91)90157-RzbMath0726.15017MaRDI QIDQ802704
Publication date: 1991
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
15A60: Norms of matrices, numerical range, applications of functional analysis to matrix theory
65F10: Iterative numerical methods for linear systems
15B51: Stochastic matrices
Related Items
Extending the minc-brègman upper bound for the permanent, Order independence and factor convergence in iterative scaling, Implications of convergence rates in Sinkhorn balancing, Approximating the permanent via importance sampling with application to the dimer covering problem, Classical complexity and quantum entanglement
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Applications of an inequality in information theory to matrices
- On the scaling of multidimensional matrices
- Methods for scaling to doubly stochastic form
- Concerning nonnegative matrices and doubly stochastic matrices
- Growth transformations for functions on manifolds
- On nonnegative matrices
- On matrices with doubly stochastic pattern
- The Jacobian of a growth transformation
- The diagonal equivalence of a nonnegative matrix to a stochastic matrix
- Convergence of the Iterative Scaling Procedure for Non-Negative Matrices
- A Relationship Between Arbitrary Positive Matrices and Doubly Stochastic Matrices
- Estimating Nonnegative Matrices from Marginal Data
- Maximum Entropy for Hypothesis Formulation, Especially for Multidimensional Contingency Tables
- The Distribution of Positive Elements in Doubly-Stochastic Matrices
- Diagonal Equivalence to Matrices with Prescribed Row and Column Sums
- Problems Involving Diagonal Products in Nonnegative Matrices
- Generalized Iterative Scaling for Log-Linear Models
- On a Least Squares Adjustment of a Sampled Frequency Table When the Expected Marginal Totals are Known
