Home
Problem
Status
Contest
Workbook
User
Group
Forum
Register
Login
{"managingGroups":{},"author":"2728735169","updateTime":1561909986000,"title":"数学","dislikeCnt":0,"content":"### \u003ci class\u003d\"fa fa-tags\" aria-hidden\u003d\"true\"\u003e\u003c/i\u003e线代\n[problem:HDU - 6507] 给一个矩阵,求这个矩阵分解成一系列矩阵的乘积,使得元素个数和最小。\n- 满秩分解 :对于 m×n的矩阵A,假设其秩为r,若存在秩同样为r两个矩阵:Fm×r(列满秩)和Gr×n(行满秩),使得A\u003dFG,则称其为矩阵A的满秩分解。\n- 分解以后的矩阵满秩了,再分解不会增加减少元素的可能性。当然分解本身也不一定会更好。","threadId":49058,"likeCnt":0,"createTime":1561909885000,"isWorkbook":false,"viewCnt":792,"openness":1,"fav":false,"id":1167,"trustable":false}