Computing the maximum degree of minors in matrix pencils via combinatorial relaxation (Q1402222): Difference between revisions
From MaRDI portal
Created a new Item |
Normalize DOI. |
||
| (3 intermediate revisions by 3 users not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1007/s00453-003-1022-9 / rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s00453-003-1022-9 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2002297246 / rank | |||
Normal rank | |||
| Property / DOI | |||
| Property / DOI: 10.1007/S00453-003-1022-9 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 19:27, 10 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Computing the maximum degree of minors in matrix pencils via combinatorial relaxation |
scientific article |
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
