知识卡片
矩阵乘法匹配内部维数
A为n×m、B为m×p时,AB为n×p,每项是A行与B列的点积。条件是A列数等于B行数,原文后一句把行列条件说反;顺序交换可能不可乘,即使可乘也通常不相等。
这张卡片看不懂?
这张卡片已通过人工审查,不再接受失败反馈。
已有反馈 · 0 条
还没有人提交反馈。
在整书笔记中的位置
- · 附录B:线性代数
原书出处 · 1 处
- · 查看原书依据
Given an n×m matrix A and a m×p matrix B, the matrix product AB is defined by where the index ij indicates the i-th row and j-th column entry of the resulting n×p matrix. Each entry therefore consists of the scalar product of the i-th row of A with the j-th column of B. Note that for this to work, the right-hand matrix (here B)
参考来源
- 位置:《Introduction to Autonomous Robots Mechanisms, Sensors, Actuators, and Algorithms (Nikolaus Correll, Bradley Hayes etc.)》附录B《附录B:线性代数》(来源项目:a19c7933-4eda-4176-aebd-30fe7e1ad292;源文件:extracted/Introduction to Autonomous Robots Mechanisms, Sensors, Actuators, and Algorithms (Nikolaus Correll, Bradley Hayes etc.)/_epub-src/OEBPS/xhtml/appendixB.xhtml)
- 结论依据:摘录中关于矩阵乘法匹配内部维数的定义、比较或条件支撑卡片;原书表述不严谨的范围已在覆盖记录逐项限定,不把案例结果外推为普遍结论。
- 原始内容:Given an n×m matrix A and a m×p matrix B, the matrix product AB is defined by where the index ij indicates the i-th row and j-th column entry of the resulting n×p matrix. Each entry therefore consists of the scalar product of the i-th row of A with the j-th column of B. Note that for this to work, the right-hand matrix (here B)