According to the methodology of [6], many measures of distance arising in problems in numerical linear algebra and control can be bounded by a factor times the reciprocal of an appropriate condition number, where the distance is thought of as the distance between a given problem to the nearest ill-posed problem. In this paper, four major problems in numerical linear algebra and control are further considered: the computation of system Hessenberg form, the solution of the algebraic Riccati equation, the pole assignment problem and the matrix exponential. The distances considered here are the distance to uncontrollability and the distance to instability.
