### 抄録

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

### ASJC Scopus subject areas

- Software
- Mathematics(all)

### これを引用

*Mathematical Programming*,

*110*(1), 229-244. https://doi.org/10.1007/s10107-006-0056-6

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

研究成果: Article

*Mathematical Programming*, 巻. 110, 番号 1, pp. 229-244. https://doi.org/10.1007/s10107-006-0056-6

}

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 -