Computing the inertia from sign patterns

Naonori Kakimura, Satoru Iwata

Research output: Contribution to journalArticle

1 Citation (Scopus)

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 languageEnglish
Pages (from-to)236-248
Number of pages13
JournalLecture Notes in Computer Science
Volume3509
Publication statusPublished - 2005
Externally publishedYes

Fingerprint

Sign Pattern
Symmetric matrix
Inertia
Computing
Nonsingular or invertible matrix
Correctness
Efficient Algorithms
NP-complete problem
Alternatives

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Computing the inertia from sign patterns. / Kakimura, Naonori; Iwata, Satoru.

In: Lecture Notes in Computer Science, Vol. 3509, 2005, p. 236-248.

Research output: Contribution to journalArticle

@article{7ac70c3ba99e464ba0e54529739722b1,
title = "Computing the inertia from sign patterns",
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.",
author = "Naonori Kakimura and Satoru Iwata",
year = "2005",
language = "English",
volume = "3509",
pages = "236--248",
journal = "Lecture Notes in Computer Science",
issn = "0302-9743",
publisher = "Springer Verlag",

}

TY - JOUR

T1 - Computing the inertia from sign patterns

AU - Kakimura, Naonori

AU - Iwata, Satoru

PY - 2005

Y1 - 2005

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

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

UR - http://www.scopus.com/inward/record.url?scp=24944529898&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=24944529898&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:24944529898

VL - 3509

SP - 236

EP - 248

JO - Lecture Notes in Computer Science

JF - Lecture Notes in Computer Science

SN - 0302-9743

ER -