Principal minors, Part I: A method for computing all the principal minors of a matrix

By Kent Griffin, Michael J. Tsatsomeros. 2006

57 citations recorded by the source corpus.

Subfields: Computational Theory and Mathematics, Numerical Analysis

View Paper: https://www.semanticscholar.org/paper/12ec781e7ae9528db5f0148a32a6949eb5f19608

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computational Theory and Mathematics

1. Bernd Sturmfels
2. Olga Holtz
3. Kent Griffin
4. Michael J. Tsatsomeros
5. Federico Ardila
6. Eric Katz
7. Martyn Marshall
8. Michael Joswig

In Numerical Analysis

1. Kent Griffin
2. Michael J. Tsatsomeros
3. Bernd Sturmfels
4. Martyn Marshall
5. Petter Brand'en

Citations in the corpus

• Principal minors, Part II: The principal minor assignment problem (2006, methodology): “This is, in fact, the same as the order of the output of MAT2PM in [2].”
• Hyperdeterminantal relations among symmetric principal minors (2006, background): “mine whether a given vector A∗ of length 2n is realizable as the vector of all principal minors of some n×n-matrix A. Very recently, Griffin and Tsatsomeros gave an algorithmic solution to this problem [6, 7]. Their work gives an algorithm, which, under a certain “genericity” condition, either outputs”