搜索资源列表
基于最优流的配电网络重构程序
- 提出了一种基于改进最优流和遗传算法的配电网重构算法.该算法先利用配电网的同胚图将重构问题的全局寻优空间划分为若干子空间,然后利用改进最优流法寻找子空间内的最优解,之后再利用遗传算法搜索全局最优解所在的子空间,从而实现在局部最优解中寻找全局最优解.(A distribution network reconfiguration algorithm based on improved optimal flow and genetic algorithm is proposed. First, the
bksvd-master
- block krylov 子空间近似 SVD 分解(Approximate SVD decomposition of block Krylov subspace)
子空间
- 基本的子空间辨识程序,求解系统矩阵A、B、C、D(The basic subspace identification program is used to solve the system matrix A, B, C and D)
子空间辨识
- 基本的子空间辨识程序,先求解系统矩阵A、B,再求C、D(In the basic subspace identification procedure, the system matrices A and B are solved first, and then C and D are obtained)
LMSC
- zhang laten multi-view subspace clustering