Computing the maximum degree of minors in matrix pencils via combinatorial relaxation (Q1402222)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1967771
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computing the maximum degree of minors in matrix pencils via combinatorial relaxation |
scientific article; zbMATH DE number 1967771 |
Statements
Computing the maximum degree of minors in matrix pencils via combinatorial relaxation (English)
0 references
19 August 2003
0 references
The author presents an algorithm for computing the maximum degree of a minor of order \(k\) in a matrix pencil. The algorithm solves the weighted bipartite matching problem. If the upper bound is not tight then the algorithm performs the matrix modification of an equivalence transformation with constant matrices.
0 references
combinatorial relaxation
0 references
determinant
0 references
matrix pencil
0 references
strict equivalence transformation.
0 references
maximum degree of a minor
0 references
weighted bipartite matching problem
0 references
0.9476232
0 references
0.9476232
0 references
0.9237335
0 references
0.8982336
0 references
0.88938093
0 references
0.8828603
0 references
0.8814747
0 references
0.8811356
0 references
