Computing the inertia from sign patterns

Authors:
Naonori Kakimura;Satoru Iwata
Affiliations:
Department of Mathematical Informatics, Graduate School of Information Science and Technology, University of Tokyo, Tokyo, Japan;Department of Mathematical Informatics, Graduate School of Information Science and Technology, University of Tokyo, Tokyo, Japan
Venue:
IPCO'05 Proceedings of the 11th international conference on Integer Programming and Combinatorial Optimization
Year:
2005

Citing 3
Cited 1

Matrix analysis

Matrix analysis
Pfaffian orientations 0-1 permanents, and even cycles in directed graphs

Discrete Applied Mathematics - Combinatorics and complexity
Network flows: theory, algorithms, and applications

Network flows: theory, algorithms, and applications

Upper degree-constrained partial orientations

SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm

Quantified Score

Hi-index	0.01

Visualization

Abstract

A symmetric matrix A is said to be sign-nonsingular if every symmetric matrix with the same sign pattern as A is nonsingular. Hall, Li and Wang showed that the inertia of a sign-nonsingular symmetric matrix is determined uniquely by its sign pattern. The purpose of this paper is to present an efficient algorithm for computing the inertia of such matrices. The algorithm runs in O(nm) time for a symmetric matrix of order n with m nonzero entries. The correctness of the algorithm provides an alternative proof of the result by Hall et al. In addition, for a symmetric matrix in general, it is shown to be NP-complete to decide whether the inertia of the matrix is not determined by the sign pattern.