Computing the Maximum Degree of Minors in Matrix Pencils via Combinatorial Relaxation


This paper presents a new algorithm for computing the maximum degree δk (A) of a minor of order k in a matrix pencil A(s) . The problem is of practical significance in the field of numerical analysis and systems control. The algorithm adopts a general framework of ``combinatorial relaxation'' due to Murota. It first solves the weighted bipartite matching… (More)
DOI: 10.1007/s00453-003-1022-9

1 Figure or Table


  • Presentations referencing similar topics