A fast algorithm for matrix balancing

DOI10.1093/imanum/drs019zbMath1276.65025OpenAlexW2102368172WikidataQ107377263 ScholiaQ107377263MaRDI QIDQ2841064

Philip A. Knight, Daniel Ruiz

Publication date: 24 July 2013

Published in: IMA Journal of Numerical Analysis (Search for Journal in Brave)

Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2007/1073/

zbMATH Keywords

sparse matricesdoubly stochastic matrixinexact Newton methodconjugate gradient iterationmatrix balancingSinkhorn-Knopp algorithm

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Numerical computation of matrix norms, conditioning, scaling (65F35) Preconditioners for iterative methods (65F08)

Related Items (15)

Lagrangian numerical methods for ocean biogeochemical simulations ⋮ Semidual Regularized Optimal Transport ⋮ Boosting of Image Denoising Algorithms ⋮ Accelerating the Sinkhorn-Knopp iteration by Arnoldi-type methods ⋮ Translocation Detection from Hi-C Data via Scan Statistics ⋮ Introducing the Class of SemiDoubly Stochastic Matrices: A Novel Scaling Approach for Rectangular Matrices ⋮ Unnamed Item ⋮ Matrix Balancing Based Interior Point Methods for Point Set Matching Problems ⋮ An empirical Bayes approach for the identification of long-range chromosomal interaction from Hi-C data ⋮ Constructive quantum scaling of unitary matrices ⋮ Preconditioning techniques based on the Birkhoff-von Neumann decomposition ⋮ Network modelling of topological domains using Hi-C data ⋮ Arbitrarily regularizable graphs ⋮ Scaling matrices and counting the perfect matchings in graphs ⋮ A note on overrelaxation in the Sinkhorn algorithm

This page was built for publication: A fast algorithm for matrix balancing