A symmetry preserving algorithm for matrix scaling

Knight, Philip and Ruiz, Daniel and Ucar, Bora (2014) A symmetry preserving algorithm for matrix scaling. SIAM Journal on Matrix Analysis and Applications, 35 (3). 931–955. ISSN 0895-4798

[thumbnail of main_revised3] PDF (main_revised3)
Accepted Author Manuscript
License: Unspecified

Download (471kB)


    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 1-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.

    ORCID iDs

    Knight, Philip ORCID logoORCID: https://orcid.org/0000-0001-9511-5692, Ruiz, Daniel and Ucar, Bora;