Scaling by Binormalization
- Cite this article as:
- Livne, O.E. & Golub, G.H. Numerical Algorithms (2004) 35: 97. doi:10.1023/B:NUMA.0000016606.32820.69
- 128 Downloads
We present an iterative algorithm (BIN) for scaling all the rows and columns of a real symmetric matrix to unit 2-norm. We study the theoretical convergence properties and its relation to optimal conditioning. Numerical experiments show that BIN requires 2–4 matrix–vector multiplications to obtain an adequate scaling, and in many cases significantly reduces the condition number, more than other scaling algorithms. We present generalizations to complex, nonsymmetric and rectangular matrices.