-
Workshop7
An example of using a matrix object in order to pass values and complete a function.
- 2015-12-10 23:32:02下载
- 积分:1
-
zantaifenxi
非常实用的时域仿真法暂态分析工具,利用牛顿法求解系统的微分方程组和代数方程组,得到转子摇摆曲线,判断暂态是否稳定(Very useful time-domain simulation tool for transient analysis method, using Newton method for solving systems of differential equations and algebraic equations, the rotor swing curves, to determine the stability of transient)
- 2011-09-02 14:48:18下载
- 积分:1
-
LU
说明: 这是LU分解法求线性方程组的资料,讲解了LU分解的原理及过程,非常实用(LU decomposition seeking linear equations to explain the principles and process of the LU decomposition, very practical)
- 2012-08-26 09:59:07下载
- 积分:1
-
SMM
说明: 几种模幂算法,有传统模幂,SMM模幂,基于2的K次方的模幂和最一般的模幂算法,还有为这些模幂算法建立的WINDOWS对话框。可以方便的运行。(algorithm, the traditional mode power, SMM Modular Power, Based on two of the K-th power module and the most common mode power algorithm, These modules also for the establishment of the algorithm Power Windows dialog box. To facilitate the operation.)
- 2006-04-27 22:49:38下载
- 积分:1
-
Desktop
说明: 在进行激光熔覆或者焊接时可用到的移动热源命令流(Command flow of moving heat source available during laser cladding or welding)
- 2020-07-01 22:55:37下载
- 积分:1
-
half
计算半方差,如果按克里金法计算插值要求计算半方差,用此程序可实现。(Calculation of semi-variance, if the Kriging interpolation method call for the calculation of semi-variance, using this procedure can be realized.)
- 2008-05-15 13:48:06下载
- 积分:1
-
EMD-C
EMD分解C语言算法,内含EMD分解所需的三次样条插值C语言算法。(EMD decomposition algorithm C language, containing the decomposition EMD cubic spline interpolation algorithm C language.)
- 2021-02-03 01:10:00下载
- 积分:1
-
thermal-1
说明: 用LBM代码编写的由于温差而产生的自然对流小程序(As with the LBM code written in natural convection resulting from temperature applet)
- 2021-05-15 11:30:02下载
- 积分:1
-
3
说明: 用刷选法求出100之内的素数。并输出数有多少个。(100 prime number is calculated by the method of selection. And the output count how many.)
- 2013-09-11 19:40:35下载
- 积分:1
-
CPPsimplex
单纯形法,求解线性规划问题的通用方法。单纯形是美国数学家G.B.丹齐克于1947年首先提出来的。它的理论根据是:线性规划问题的可行域是 n维向量空间Rn中的多面凸集,其最优值如果存在必在该凸集的某顶点处达到。顶点所对应的可行解称为基本可行解。单纯形法的基本思想是:先找出一个基本可行解,对它进行鉴别,看是否是最优解;若不是,则按照一定法则转换到另一改进的基本可行解,再鉴别;若仍不是,则再转换,按此重复进行。因基本可行解的个数有限,故经有限次转换必能得出问题的最优解。如果问题无最优解也可用此法判别。
(Simplex method for the minimum)
- 2011-09-18 22:57:30下载
- 积分:1