Legendre duality in combinatorial study of matrix pencils
DOI10.1007/S13160-011-0051-ZzbMATH Open1259.15015OpenAlexW2085125059MaRDI QIDQ691986FDOQ691986
Publication date: 4 December 2012
Published in: Japan Journal of Industrial and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s13160-011-0051-z
Recommendations
- Combinatorial Analysis of Singular Matrix Pencils
- Combinatorial Analysis of Generic Matrix Pencils
- Duality of matrix pencils, Wong chains and linearizations
- LINKING SYSTEMS AND MATROID PENCILS(<Special Issue>the 50th Anniversary of the Operations Research Society of Japan)
- Combinatorics of column minimal indices and matrix pencil completion problems
ranksmatroidsmatrix pencilsKronecker canonical formdiscrete convexityLegendre transformationcombinatorial matrix theorysubdeterminants
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Matroids in convex geometry (realizations in the context of convex polytopes, convexity in combinatorial structures, etc.) (52B40) Combinatorial aspects of matroids and geometric lattices (05B35) Matrix pencils (15A22)
Cites Work
- Title not available (Why is that?)
- Discrete Convex Analysis
- The computation of Kronecker's canonical form of a singular pencil
- Kronecker's canonical form and the QZ algorithm
- Matrices and matroids for systems analysis
- An improved algorithm for the computation of Kronecker's canonical form of a singular pencil
- The generalized Schur decomposition of an arbitrary pencil A–λB—robust software with error bounds and applications. Part I
- Valuated matroids
- Title not available (Why is that?)
- The generalized Schur decomposition of an arbitrary pencil A–λB—robust software with error bounds and applications. Part II
- Valuated matroids: A new look at the greedy algorithm
- On the Degree of Mixed Polynomial Matrices
- Computing the maximum degree of minors in matrix pencils via combinatorial relaxation
- Combinatorial relaxation algorithm for the maximum degree of subdeterminants: Computing Smith-McMillan form at infinity and structural indices in Kronecker form
- Finding optimal minors of valuated bimatroids
- Computing the Maximum Degree of Minors in Mixed Polynomial Matrices via Combinatorial Relaxation
- Matroids and linking systems
- Structural solvability of systems of equations —A mathematical formulation for distinguishing accurate and inaccurate numbers in structural analysis of systems—
- Bimatroids and invariants
- On the Kronecker Canonical Form of Mixed Matrix Pencils
- LINKING SYSTEMS AND MATROID PENCILS(<Special Issue>the 50th Anniversary of the Operations Research Society of Japan)
- Combinatorial Analysis of Singular Matrix Pencils
- Combinatorial relaxation algorithm for mixed polynomial matrices
Cited In (4)
This page was built for publication: Legendre duality in combinatorial study of matrix pencils
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q691986)
