Computing the Maximum Degree of Minors in Mixed Polynomial Matrices via Combinatorial Relaxation

被引：0
|
作者：
Satoru Iwata
Mizuyo Takamatsu
机构：
[1] Kyoto University,Research Institute for Mathematical Sciences
[2] Chuo University,Department of Information and System Engineering
来源：
Algorithmica | 2013年 / 66卷
关键词：
Combinatorial relaxation; Mixed matrix theory; Degree of minor;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
Mixed polynomial matrices are polynomial matrices with two kinds of nonzero coefficients: fixed constants that account for conservation laws and independent parameters that represent physical characteristics. The computation of their maximum degrees of minors is known to be reducible to valuated independent assignment problems, which can be solved by polynomial numbers of additions, subtractions, and multiplications of rational functions. However, these arithmetic operations on rational functions are much more expensive than those on constants.
引用
收藏
页码：346 / 368
页数：22
相关论文
共 26 条
123