Computing the inertia from sign patterns

Naonori Kakimura, Satoru Iwata

研究成果: Article

2 引用 (Scopus)

抄録

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 symmetric matrices. The algorithm runs in O(√nm log n) time for a symmetric matrix of order n with m nonzero entries. In addition, it is shown to be NP-complete to decide whether the inertia of a given symmetric matrix is not determined by its sign pattern.

元の言語English
ページ(範囲)229-244
ページ数16
ジャーナルMathematical Programming
110
発行部数1
DOI
出版物ステータスPublished - 2007 6
外部発表Yes

Fingerprint

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

ASJC Scopus subject areas

  • Software
  • Mathematics(all)

これを引用

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

:: Mathematical Programming, 巻 110, 番号 1, 06.2007, p. 229-244.

研究成果: Article

Kakimura, Naonori ; Iwata, Satoru. / Computing the inertia from sign patterns. :: Mathematical Programming. 2007 ; 巻 110, 番号 1. pp. 229-244.
@article{f9ef92c860614813ab5f37f65b4a0911,
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 symmetric matrices. The algorithm runs in O(√nm log n) time for a symmetric matrix of order n with m nonzero entries. In addition, it is shown to be NP-complete to decide whether the inertia of a given symmetric matrix is not determined by its sign pattern.",
keywords = "Inertia, Sign patterns, Sign-nonsingular symmetric matrices",
author = "Naonori Kakimura and Satoru Iwata",
year = "2007",
month = "6",
doi = "10.1007/s10107-006-0056-6",
language = "English",
volume = "110",
pages = "229--244",
journal = "Mathematical Programming",
issn = "0025-5610",
publisher = "Springer-Verlag GmbH and Co. KG",
number = "1",

}

TY - JOUR

T1 - Computing the inertia from sign patterns

AU - Kakimura, Naonori

AU - Iwata, Satoru

PY - 2007/6

Y1 - 2007/6

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 symmetric matrices. The algorithm runs in O(√nm log n) time for a symmetric matrix of order n with m nonzero entries. In addition, it is shown to be NP-complete to decide whether the inertia of a given symmetric matrix is not determined by its 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 symmetric matrices. The algorithm runs in O(√nm log n) time for a symmetric matrix of order n with m nonzero entries. In addition, it is shown to be NP-complete to decide whether the inertia of a given symmetric matrix is not determined by its sign pattern.

KW - Inertia

KW - Sign patterns

KW - Sign-nonsingular symmetric matrices

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

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

U2 - 10.1007/s10107-006-0056-6

DO - 10.1007/s10107-006-0056-6

M3 - Article

AN - SCOPUS:33947167897

VL - 110

SP - 229

EP - 244

JO - Mathematical Programming

JF - Mathematical Programming

SN - 0025-5610

IS - 1

ER -