Welcome to the new version of CaltechAUTHORS. Login is currently restricted to library staff. If you notice any issues, please email coda@library.caltech.edu
Published November 1994 | Published
Journal Article Open

Minimizing the Euclidean Condition Number

Abstract

This paper considers the problem of determining the row and/or column scaling of a matrix A that minimizes the condition number of the scaled matrix. This problem has been studied by many authors. For the cases of the ∞-norm and the 1-norm, the scaling problem was completely solved in the 1960s. It is the Euclidean norm case that has widespread application in robust control analyses. For example, it is used for integral controllability tests based on steady-state information, for the selection of sensors and actuators based on dynamic information, and for studying the sensitivity of stability to uncertainty in control systems. Minimizing the scaled Euclidean condition number has been an open question—researchers proposed approaches to solving the problem numerically, but none of the proposed numerical approaches guaranteed convergence to the true minimum. This paper provides a convex optimization procedure to determine the scalings that minimize the Euclidean condition number. This optimization can be solved in polynomial-time with off-the-shelf software.

Additional Information

© 1994 Society for Industrial and Applied Mathematics. Received October 13, 1992. Accepted June 22, 1993. This author was supported by the Fannie and John Hertz Foundation.

Attached Files

Published - BRAsiamjco94.pdf

Files

BRAsiamjco94.pdf
Files (663.0 kB)
Name Size Download all
md5:51cf29ab500b9b25ad59b15d43317dff
663.0 kB Preview Download

Additional details

Created:
August 20, 2023
Modified:
October 24, 2023