首页> 外文会议>IEEE International Symposium on Circuits and Systems >Construction of the nodal conductance matrix of a planar resistive grid and derivation of the analytical expressions of its eigenvalues and eigenvectors using the Kronecker product and sum
【24h】

Construction of the nodal conductance matrix of a planar resistive grid and derivation of the analytical expressions of its eigenvalues and eigenvectors using the Kronecker product and sum

机译:平面电阻网格的节点电导矩阵的构造及其特征值和特征向量的解析表达式,使用Kronecker乘积和求和

获取原文

摘要

This paper considers the task of constructing an (M×A+1)-node rectangular planar resistive grid as: first forming two (M×A+1)-node planar sub-grids; one made up of M of (N+1)-node horizontal, and the other of N of (M+1)-node vertical linear resistive grids, then joining their corresponding nodes. By doing so it is sho wn that the nodal conductance matrices GH and GV of the two sub-grids can be expressed as the Kronecker products GH = IM ⊗ GN, GV = GM ⊗ In, and G of the resultant planar grid as the Kronecker sum G = GN ⊕ GM, where GM and IM are, respectively, the nodal conductance matrix of a linear resistive grid and the identity matrix, both of size M. Moreover, since the analytical expression s for the eigenvalues and eigenvectors of GM - which is a symmetric tridiagonal matrix - are well known, this approach enables the derivation of the analytical expressions of the eigenvalues and eigenvectors of GH, GV and G in terms of those of GM and GN, thereby drastically simplifying their computation and rendering the use of any matrix-inversion-based method unnecessary in the solution of nodal equations of very large grids.
机译:本文认为构造一个(M×A + 1)个节点的矩形平面电阻网格的任务是:首先形成两个(M×A + 1)个节点的平面子网格;第二个形成两个(M×A + 1)个节点的平面子网格。一个由M个(N + 1)个节点水平的线性电阻网格组成,另一个由N个(M + 1)个节点垂直的线性电阻网格组成,然后将它们对应的节点连接起来。通过这样做,可以将两个子网格的节点电导矩阵GH和GV表示为Kronecker乘积GH = IM⊗GN,GV = GM⊗In,而所得平面网格的G表示为Kronecker总和G = GN⊕GM,其中GM和IM分别是大小均为M的线性电阻网格的节点电导矩阵和单位矩阵。此外,由于GM的特征值和特征向量的解析表达式s-是一个对称的三对角矩阵-众所周知,这种方法可以根据GM和GN推导GH,GV和G的特征值和特征向量的解析表达式,从而大大简化了它们的计算并可以使用任何在大型网格节点方程的求解中,无需使用基于矩阵求逆的方法。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号