- File Size:
- Uploaded by:
Description: n order to solve the network equation repeatedly, the admittance matrix is usually decomposed by trigonometry first, and then the forward and backward operations can be performed on different right-hand constant terms to obtain the solution of the network equation . The admittance matrix is a sparse matrix with many zero elements . The triangular matrix obtained by decomposition is also a sparse matrix. Generally, the distribution of non-zero elements of admittance matrix is different from that of triangular matrix after decomposition, because new non-zero elements, namely injection elements, will be generated in the process of elimination or decomposition.
(Click to check if it's the file you need, and recomment it at the bottom):
|基于静态优化法的节点导纳矩阵形成.txt|| 3752 || 2021-01-12|