Computing the inertia from sign patterns
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 825098 (Why is no real title available?)
- scientific article; zbMATH DE number 3048439 (Why is no real title available?)
- An identity for bipartite matching and symmetric determinant
- Faster Scaling Algorithms for Network Problems
- Matching theory
- Matrix Analysis
- Permanents, Pfaffian orientations, and even directed circuits
- Pfaffian orientations, 0-1 permanents, and even cycles in directed graphs
- Pólya's permanent problem
- Signsolvability revisited
- Symmetric sign pattern matrices that require unique inertia
Cited in
(11)- Exact computations of the inertia symmetric integer matrices
- Computing the Inertia from Sign Patterns
- scientific article; zbMATH DE number 1954385 (Why is no real title available?)
- Two classes of symmetric sign patterns that require unique inertia.
- Spectral aspects of symmetric matrix signings
- Computing of signs of eigenvalues for diagonally dominant matrix for inertia problem
- Computing inertia sets using atoms
- New numerical method for determining inertia and stability of nonsymmetric large sparse matrix
- Allow problems concerning spectral properties of sign pattern matrices: a survey
- Sign patterns requiring a unique inertia
- Matching structure of symmetric bipartite graphs and a generalization of Pólya's problem
This page was built for publication: Computing the inertia from sign patterns
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q877192)
