Matrix-Free Approximate Equilibration

Abstract

The condition number of a diagonally scaled matrix, for appropriately chosen scaling matrices, is often less than that of the original. Equilibration scales a matrix so that the scaled matrix's row and column norms are equal. Scaling can be approximate. We develop approximate equilibration algorithms for nonsymmetric and symmetric matrices having signed elements that access a matrix only by matrix-vector products.

Cited by in corpus (3)

• Equilibrated adaptive learning rates for non-convex optimization
• A review of matrix scaling and Sinkhorn's normal form for matrices and positive maps
• Tensor decompositions and algorithms, with applications to tensor learning