摘要
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 being factored as a product of (m - n) Fiedler matrices, the other is an m×(m - 2) Fiedler matrix's factorization. Then we discuss the relation among the numbers of parameters of three generic m×n, n×p and m×p Fiedler matrices, and obtain some useful results.
In this paper, we first show that a generic m × n Fiedler matrix may have 2^m-n-1 - 1 kinds of factorizafions which are very complicated when m is much larger than n. In this work, two special cases are examirted, one is an m×n Fiedler matrix being factored as a product of （m - n） Fiedler matrices, the other is an m × （m - 2） Fiedler matrix＇s factorization. Then we discuss the relation among the numbers of parameters of three generic m × n, n × p and m × p Fiedler matrices, and obtain some useful results.
基金
This paper is supported by the National Nature Science Foundation, China （No. 60475017）.
