-
LIPDRIVE
采用fortran编写了关于方腔顶盖驱动流的lbm程序(Prepared using fortran on navies process flow lbm)
- 2021-03-30 07:29:10下载
- 积分：1
-
SIMPLE
数值传热学Simple算法，Fortran编写(Simple using Fortran)
- 2017-07-05 12:18:44下载
- 积分：1
-
cholesky
用matlab编写的cholesky分解程序，希望对大家有些帮助(Matlab prepared using Cholesky decomposition procedures, in the hope that some U.S. help)
- 2008-07-01 17:19:05下载
- 积分：1
-
mabExpress_src
任意数学表达式计算的源码及测试软件
(Calculation of arbitrary mathematical expression of the source code and test software)
- 2009-04-12 22:26:39下载
- 积分：1
-
C_classical_src
平常练习的一些程序，比较基础，包括求斐波那契数、完数等等(Some of the usual practice procedures, more infrastructure, including seeking Fibonacci numbers, number, etc. End)
- 2013-11-18 21:18:19下载
- 积分：1
-
AR
说明： 使用时间序列分析AR方法对油价进行分析，以及预测。采用BIC准则进行判阶，最小二乘法进行参数估计(AR time series analysis using the method of price analysis and forecasting. BIC criteria used sentence order, the least square method for parameter estimation)
- 2009-06-08 09:19:56下载
- 积分：1
-
LSSVR
最小二乘法和支持向量回归机相结合无线传感网络节点定位的源码.(The source of The least squares and support vector regression combining wireless sensor network node positioning .
)
- 2020-10-26 21:39:59下载
- 积分：1
-
k_means
功能完善的、代码简单清晰、注释良好的k均值聚类算法(The function is perfect, code simple clear, annotation good k-means clustering algorithm)
- 2012-04-19 12:59:51下载
- 积分：1
-
Matrix
最小二乘法的c语言程序，能求解多元方程组，具有良好的效果(The C language program of the least square method can solve the multiple equations. It has good effect.)
- 2017-12-08 10:39:40下载
- 积分：1
-
单纯形法Matlab程序-2016-11-17
一般线性规划问题具有线性方程组的变量数大于方程个数，这时会有不定的解。当决策变量个数n和约束条件个数m较大时，单纯形法是求解线性规划问题的通用方法。
从线性方程组找出一个个的单纯形，每一个单纯形可以求得一组解，然后再判断该解使目标函数值是增大还是变小了，决定下一步选择的单纯形。通过优化迭代，直到目标函数实现最大或最小值(In general linear programming problems, the number of variables with linear equations is greater than the number of equations. When the number of decision variables n and constraint number m are large, simplex method is the general method for solving linear programming problems.
Find out one by one from the linear equations of the simplex, each a simplex can get a set of solution, and then concludes that the solution is the objective function value increases or smaller and decided to choose the next simplex. By optimizing iteration, until the target function achieves the maximum or minimum value.)
- 2018-03-27 17:22:03下载
- 积分：1
