-
flowcalc_easy
基于前推回代法的电力系统潮流计算程序。
需要输入支路阻抗和节点功率矩阵。包括支路号、首节点号、尾节点号、支路自阻抗、尾节点给定功率。
输出各节点的电压幅值、相角和各支路电流。(Power flow calculation program based on the forward and backward substitution method. Need input the branch impedance node power matrix. Including branch number, node number, the tail node number, branch self-impedance tail node given power. The output node voltage amplitude, phase angle and current of each branch.)
- 2012-10-19 11:40:12下载
- 积分:1
-
movingcar
说明: 简支梁-车辆模型,用于ansys建模和车桥耦合分析的初级阶段(Simply Supported Beam-Vehicle Model)
- 2019-03-04 17:26:19下载
- 积分:1
-
EOF
经验正交函数分析FORTRAN程序,用于变量场的时空结构分离(配套书籍《现代气候统计诊断与预测技术》)。(empirical orthogonal function, FORTRAN procedure, used to separate the spatio-temporal structure of climate variables.)
- 2019-03-07 17:15:59下载
- 积分:1
-
polyfit
该程序用来对多种物质混合物吸收光谱数据进行分析,拟合出光谱曲线并且得到其各个峰值位置所在。(The program is used for a variety of mixtures of substances absorption spectral data analysis, curve fitting, and by their spectral location of each peak.)
- 2010-01-07 06:28:52下载
- 积分:1
-
2Dforce-based-non-prismatic-element
Mathematica计算基于力平衡变截面梁单元的质量和刚度矩阵(2D force-based finite element mathemaica)
- 2020-11-26 16:09:32下载
- 积分:1
-
FEM
有限元平面应力问题计算,总体刚度矩阵矩阵压缩存储,LU分解求解(Plane stress finite element calculation, the overall stiffness matrix of compressed storage matrix, LU decomposition Solving)
- 2021-01-26 21:28:41下载
- 积分:1
-
GUSS
多点高斯平稳随机过程模拟,运用了快速傅里叶变换进行模拟。(Multi-Gaussian stationary random process simulation, using a fast Fourier transform simulation.)
- 2020-11-02 12:39:53下载
- 积分:1
-
微分进化算法中的其中两个子程序 kk
说明: 微分进化算法中的其中两个子程序,还有未上传(Differential evolution algorithm)
- 2020-06-23 05:00:01下载
- 积分:1
-
SGA
一个用于学习GA的简单程序,自己编写的SGA,不是使用的工具箱函数(A simple GA for the learning process, I have written SGA, instead of using the toolbox function)
- 2009-04-14 16:23:00下载
- 积分:1
-
hartigansSLC_OpenCV
hartigans Sequential Leader Clustering Algorithm in terms of OpenCV (ver.1.1)
Sequential Leader algorithm:
Hartigan, J. A. (1975), Clustering Algorithms. John Wiley and Sons, Inc., New York, NY.
1. Select maximum cluster "radius"
2. Start with zero clusters
3. Add each item to be clustered to:
* Closest cluster if distance <= r
* New cluster if distance to closest cluster > r
4. Compute new center from members in cluster
5. Empty the clusters (keeping the centers)
6. Return to step 3 (until no changes are made)
- 2010-02-25 19:28:25下载
- 积分:1