Computing the inertia from sign patterns

DOI10.1007/s10107-006-0056-6zbMath1149.65025OpenAlexW2112731657MaRDI QIDQ877192

Naonori Kakimura, Satoru Iwata

Publication date: 19 April 2007

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10107-006-0056-6

zbMATH Keywords

inertiasign patternssign-nonsingular symmetric matrices

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15)

Related Items (2)

Matching structure of symmetric bipartite graphs and a generalization of Pólya's problem ⋮ Allow problems concerning spectral properties of sign pattern matrices: a survey

Cites Work

• Unnamed Item
• Unnamed Item
• Signsolvability revisited
• Pfaffian orientations, 0-1 permanents, and even cycles in directed graphs
• Matching theory
• Pólya's permanent problem
• An identity for bipartite matching and symmetric determinant
• Permanents, Pfaffian orientations, and even directed circuits
• Matrix Analysis
• Faster Scaling Algorithms for Network Problems
• Symmetric sign pattern matrices that require unique inertia

This page was built for publication: Computing the inertia from sign patterns