## A symmetry preserving algorithm for matrix scaling

### Philip A. Knight, Daniel Ruiz and Bora Uçar

Abstract.
We present an iterative algorithm which asymptotically scales the
$\infty$-norm of each row and each column of a matrix to one. This
scaling algorithm preserves symmetry of the original matrix and shows fast linear convergence
with an asymptotic rate of $1/2$. We discuss extensions of the
algorithm to the one-norm, and by inference to other norms. For the
1-norm case, we show again that convergence is linear, with the rate dependent on the spectrum of the scaled matrix. We demonstrate experimentally that the scaling algorithm improves
the conditioning of the matrix and that it helps direct solvers by reducing the need for pivoting. In particular, for symmetric matrices the theoretical and experimental results highlight the potential of the proposed algorithm over existing alternatives

Key words. Matrix scaling, sparse matrix factorization