论文部分内容阅读
<正>In this paper, we first show that a generic m×n Fiedler matrix may have 2m-n-1 kinds of factorizations which are very complicated when m is much larger than n. In this work, two special cases are examined, one is an m×n Fiedler matrix b