Abstract
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.
D. Hartman—Supported by grants 13-17187S and 13-10660S of the Czech Science Foundation.
M. Hladík—Supported by grant 13-10660S of the Czech Science Foundation.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Poljak, S., Rohn, J.: Radius of Nonsingularity. Technical report KAM Series (88–117), Department of Applied Mathematics, Charles University, Prague (1988)
Poljak, S., Rohn, J.: Checking robust nonsingularity is NP-hard. Math. Control Signals Syst. 6(1), 1–9 (1993)
Rohn, J.: Checking properties of interval matrices. Technical report, Institute of Computer Science, Academy of Sciences of the Czech Republic, Prague, 686 (1996)
Kreinovich, V., Lakeyev, A., Rohn, J., Kahl, P.: Computational Complexity and Feasibility of Data Processing and Interval Computations. Kluwer Academic Publishers, Dordrecht (1998)
Rump, S.M.: Almost sharp bounds for the componentwise distance to the nearest singular matrix. Linear Multilinear Algebra 42(2), 93–107 (1997)
Rump, S.M.: Bounds for the componentwise distance to the nearest singular matrix. SIAM J. Matrix Anal. Appl. 18(1), 83–103 (1997)
Gärtner, B., Matoušek, J.: Approximation Algorithms and Semidefinite Programming. Springer, Heidelberg (2012)
Moore, R.E., Kearfott, R.B., Cloud, M.J.: Introduction to Interval Analysis. SIAM, Philadelphia (2009)
Neumaier, A.: Interval Methods for Systems of Equations. Cambridge University Press, Cambridge (1990)
Packard, A., Doyle, J.C.: The complex structured singular value. Automatica 29, 71–109 (1993)
Stein, G., Doyle, J.C.: Beyond singular values and loop shapes. J. Guidance Control Dyn. 14(1), 5–16 (1991)
Grötschel, M., Lovász, L., Schrijver, A.: The ellipsoid method and its consequences in combinatorial optimization. Combinatorica 1, 169–197 (1981)
Kolev, L.V.: A method for determining the regularity radius of interval matrices. Reliable Comput. 16(1), 1–26 (2011)
Jansson, C., Chaykin, D., Keil, C.: Rigorous error bounds for the optimal value in semidefinite programming. SIAM J. Numer. Anal. 46(1), 180–200 (2007)
Goemans, M.X., Williamson, D.P.: Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. J. ACM 42(6), 1115–1145 (1995)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing Switzerland
About this paper
Cite this paper
Hartman, D., Hladík, M. (2016). Tight Bounds on the Radius of Nonsingularity. In: Nehmeier, M., Wolff von Gudenberg, J., Tucker, W. (eds) Scientific Computing, Computer Arithmetic, and Validated Numerics. SCAN 2015. Lecture Notes in Computer Science(), vol 9553. Springer, Cham. https://doi.org/10.1007/978-3-319-31769-4_9
Download citation
DOI: https://doi.org/10.1007/978-3-319-31769-4_9
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-31768-7
Online ISBN: 978-3-319-31769-4
eBook Packages: Computer ScienceComputer Science (R0)