- Category:
- matlab
- Platform:
- C/C++
- File Size:
- 1024
- Update:
- 2021-01-12
- Downloads:
- 0
- Uploaded by:
- 浅忆12345
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 [1]. The admittance matrix is a sparse matrix with many zero elements [2]. 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.
To Search:
File list (Click to check if it's the file you need, and recomment it at the bottom):
| 文件名 | 大小 | 更新时间 |
|---|
| 基于静态优化法的节点导纳矩阵形成.txt | 3752 | 2021-01-12 |
Download