A notes on algorithms for determining the copositivity of a given symmetric matriz
Reference 6 gives six algorithms of determining whether a given symmetric matrix is strictly copositive or not. The algorithms there for matrices of order n≥8 can not guarantee to produce an answer,specially for 1000 symmetric random matrices of order 8, 9, 10 all having unit diagonal and with positive entries all being less than or equal to 1 and negative entries all being greater than or equal to -1 there are 8, 6,2 matrices remaining undetermined, respectively. In this paper we give two more algorithms for n=8, 9 and our experiment shows that for 1000 symmetric random matrices of order n>8 of these type, there are exactly no matrix for n=8, 9; almost always no matrix for n=10 remaining undetermined. We also do some discussion based on our experimental results.
Copositive Strictly copositive Symmetric matrices M-matrices Simplez
Shangjun Yang Guanghui Xu Changqing Xu
School of Mathematical Sciences, Anhui University, Hefei, Anhui, China Department of Applied Mathematics, Zhejiang Forestry University, Hangzhou, China
国际会议
The Third International Workshop on Applied Matriz Theory(第三届国际矩阵分析与应用会议)
杭州
英文
1165-1168
2009-07-09（万方平台首次上网日期，不代表论文的发表时间）