童梅老师电路原理课件ENCHAPTER8MATRIXEQUATIONS(971KB).pptVIP

  • 3
  • 0
  • 约4.94千字
  • 约 31页
  • 2018-04-09 发布于广东
  • 举报

童梅老师电路原理课件ENCHAPTER8MATRIXEQUATIONS(971KB).ppt

§8 THE MATRIX EQUATIONS FOR NETWORK Incidence Matrix Augmented incidence matrix (增广关联矩阵) Aa=(ajk) ajk = +1 if branch k leaves node j = ?1 if branch k enters node j = 0 if branch k does not touch node j Each column of Aa has exactly two nonzero elements, one of which is +1 and the other ?1. The rows of Aa are not linearly independent. The rank of the augmented incidence matrix Aa of a connected graph with n nodes and b branches is n?1. (Reduced) Incidence matrix (降阶)关联矩阵 The incidence matrix A of a graph with n nodes and b branches is an (n?1)*b matrix

文档评论(0)

1亿VIP精品文档

相关文档