Tight Bounds on the Radius of Nonsingularity
Radius of nonsingularity of a square matrix is the minimal distance to a singular matrix in the maximum norm. Computing the radius of nonsingularity is an NP-hard problem. The known estimations are not very tight; one of the best one has the relative error 6n. We propose a randomized approximation method with a constant relative error 0.7834. It is based on a semidefinite relaxation. Semidefinite relaxation gives the best known approximation algorithm for MaxCut problem, and we utilize similar principle to derive tight bounds on the radius of nonsingularity. This gives us rigorous upper and lower bounds despite randomized character of the algorithm.
KeywordsRadius of nonsingularity Bounds Semidefinite programming
- 1.Poljak, S., Rohn, J.: Radius of Nonsingularity. Technical report KAM Series (88–117), Department of Applied Mathematics, Charles University, Prague (1988)Google Scholar
- 3.Rohn, J.: Checking properties of interval matrices. Technical report, Institute of Computer Science, Academy of Sciences of the Czech Republic, Prague, 686 (1996)Google Scholar