### 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.

Original language | English |
---|---|

Pages (from-to) | 236-248 |

Number of pages | 13 |

Journal | Lecture Notes in Computer Science |

Volume | 3509 |

DOIs | |

Publication status | Published - 2005 Jan 1 |

Externally published | Yes |

Event | 11th International IPCO Conference on Integer Programming and Combinatorial Optimization - Berlin, Germany Duration: 2005 Jun 8 → 2005 Jun 10 |

### ASJC Scopus subject areas

- Theoretical Computer Science
- Computer Science(all)

## Fingerprint Dive into the research topics of 'Computing the inertia from sign patterns'. Together they form a unique fingerprint.

## Cite this

*Lecture Notes in Computer Science*,

*3509*, 236-248. https://doi.org/10.1007/11496915_18