Computing the maximum degree of minors in matrix pencils via combinatorial relaxation
From MaRDI portal
Publication:1402222
DOI10.1007/s00453-003-1022-9zbMath1028.65046OpenAlexW2002297246MaRDI QIDQ1402222
Publication date: 19 August 2003
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-003-1022-9
determinantmatrix pencilcombinatorial relaxationmaximum degree of a minorstrict equivalence transformation.weighted bipartite matching problem
Determinants, permanents, traces, other special matrix functions (15A15) Numerical computation of determinants (65F40) Matrix pencils (15A22)
Related Items
Index Reduction via Unimodular Transformations, Index minimization of differential-algebraic equations in hybrid analysis for circuit simulation, A combinatorial algorithm for computing the entire sequence of the maximum degree of minors of a generic partitioned polynomial matrix with \(2 \times 2\) submatrices, Computing the maximum degree of minors in mixed polynomial matrices via combinatorial relaxation, Computing the Maximum Degree of Minors in Mixed Polynomial Matrices via Combinatorial Relaxation, Index reduction for differential-algebraic equations by substitution method, Combinatorial relaxation algorithm for the entire sequence of the maximum degree of minors, Legendre duality in combinatorial study of matrix pencils
