Computing the maximum degree of minors in matrix pencils via combinatorial relaxation (Q1402222): Difference between revisions

← Older edit

@@ Property / DOI @@
-.1007/s00453-003-1022-9
@@ Property / DOI: 10.1007/s00453-003-1022-9 / rank @@
-Normal rank
@@ Property / DOI @@
+.1007/S00453-003-1022-9
@@ Property / DOI: 10.1007/S00453-003-1022-9 / rank @@
+Normal rank
@@ Property / Recommended article @@
+Q4252323
@@ Property / Recommended article: Q4252323 / rank @@
+Normal rank
@@ Property / Recommended article: Q4252323 / qualifier @@
+Similarity Score: 1.0000002Amount 1.0000002
Unit 1
-Amount
+.0000002
 Unit
@@ Property / Recommended article: Q4252323 / qualifier @@
+Recommender Run: Recommender Run 2
@@ Property / Recommended article @@
+Computing the Maximum Degree of Minors in Mixed Polynomial Matrices via Combinatorial Relaxation
+Normal rank
+Similarity Score: 0.9476232Amount 0.9476232
Unit 1
-Amount
+.9476232
 Unit
+Recommender Run: Recommender Run 2
@@ Property / Recommended article @@
+Computing the maximum degree of minors in mixed polynomial matrices via combinatorial relaxation
+Normal rank
+Similarity Score: 0.9476232Amount 0.9476232
Unit 1
-Amount
+.9476232
 Unit
+Recommender Run: Recommender Run 2
@@ Property / Recommended article @@
+Combinatorial relaxation algorithm for the entire sequence of the maximum degree of minors in mixed polynomial matrices
+Normal rank
+Similarity Score: 0.9237335Amount 0.9237335
Unit 1
-Amount
+.9237335
 Unit
+Recommender Run: Recommender Run 2
@@ Property / Recommended article @@
+Primal-Dual Combinatorial Relaxation Algorithms for the Maximum Degree of Subdeterminants
+Normal rank
+Similarity Score: 0.8982336Amount 0.8982336
Unit 1
-Amount
+.8982336
 Unit
+Recommender Run: Recommender Run 2
@@ Property / Recommended article @@
+Matrix Relaxations in Combinatorial Optimization
+Normal rank
+Similarity Score: 0.88938093Amount 0.88938093
Unit 1
-Amount
+.88938093
 Unit
+Recommender Run: Recommender Run 2
@@ Property / Recommended article @@
+Combinatorics of Column Minimal Indices and Matrix Pencil Completion Problems
+Normal rank
+Similarity Score: 0.8828603Amount 0.8828603
Unit 1
-Amount
+.8828603
 Unit
+Recommender Run: Recommender Run 2
@@ Property / Recommended article @@
+On the computation of maximum minors of Hadamard matrices
+Normal rank
+Similarity Score: 0.8814747Amount 0.8814747
Unit 1
-Amount
+.8814747
 Unit
+Recommender Run: Recommender Run 2
@@ Property / Recommended article @@
+Combinatorial relaxation algorithm for the entire sequence of the maximum degree of minors
+Normal rank
+Similarity Score: 0.8811356Amount 0.8811356
Unit 1
-Amount
+.8811356
 Unit
+Recommender Run: Recommender Run 2
@@ Property / Recommended article @@
+Computing the Degree of Determinants via Combinatorial Relaxation
+Normal rank
+Similarity Score: 0.8730251Amount 0.8730251
Unit 1
-Amount
+.8730251
 Unit
+Recommender Run: Recommender Run 2

Latest revision as of 19:58, 4 April 2025

scientific article

Language	Label	Description	Also known as
English	Computing the maximum degree of minors in matrix pencils via combinatorial relaxation	scientific article

Statements

instance of

scholarly article

0 references

title

Computing the maximum degree of minors in matrix pencils via combinatorial relaxation (English)

0 references

0 references

0 references

19 August 2003

0 references

review text

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

zbMATH Keywords

combinatorial relaxation

0 references

determinant

0 references

matrix pencil

0 references

strict equivalence transformation.

0 references

maximum degree of a minor

0 references