Summary
We shall in this paper consider the problem of determination a row or column scaling of a matrixA, which minimizes the condition number ofA. This problem was studied by several authors. For the cases of the maximum norm and of the sum norm the scale problem was completely solved by Bauer [1] and Sluis [5]. The condition ofA subordinate to the pair of euclidean norms is the ratio Λ/λ, where Λ and λ are the maximal and minimal eigenvalue of (A H A)1/2 respectively. The euclidean case was considered by Forsythe and Strauss [3]. Shapiro [6] proposed some approaches to a numerical solution in this case. The main result of this paper is the presentation of necessary and sufficient conditions for optimal scaling in terms of maximizing and minimizing vectors. A uniqueness proof for the solution is offered provided some normality assumption is satisfied.
Similar content being viewed by others
References
Bauer, F.L.: Optimally scaled matrices. Numer. Math.5, 73–87 (1963).
Ioffe, A.D., Tihomirov, V.M.: Theory of extremal problems. Studies in mathematics and its applications. Amsterdam: North-Holland Publ. Comp. 1979.
Forsythe, G.E., Straus, E.G.: On best conditioned matrices. Proc. Amer. Math. Soc.6, 340–345 (1955)
Rockafellar, R.T.: Convex analysis. University Press, Princeton, NJ, 1970
Sluis, van der, A.: Condition numbers and equilibration of matrices. Numer. Math.14, 14–23 (1969)
Shapiro, A.: Weighted minimum trace factor analysis. Psychometrika, in press.