-
work
追赶法，拉格朗日插值，高斯塞德尔迭代，牛顿迭代(Catch-up method, Lagrange interpolation, high斯塞德尔iteration, Newton iteration)
- 2007-11-13 01:30:59下载
- 积分：1
-
seismic_plots
画地震信号同相轴或者其他剖面时候的必备代码。适用于地球物理学习和工作者。(codes of ploting all kinds of seismic events and other display ways,which is so necessary for the geophysics learners and workers.)
- 2020-10-28 08:59:58下载
- 积分：1
-
APPgetLargeConnectedEdges
效果很好的直线提取算法，抗噪声能力很好，希望对大家有用(Uses the method of Video Compass to get long， straight edges)
- 2012-05-10 17:08:55下载
- 积分：1
-
figure2epsV1_2
CONVERTING FIGURES TO MATRIX IN MATLAB
- 2013-09-10 18:03:23下载
- 积分：1
-
matlab
用于matlab中图像后处理，将图像灰度化，二值化(For processing the image in MATLAB, the gray image, the value of the two)
- 2014-12-27 11:24:11下载
- 积分：1
-
odev_1-hamza-oran
Example of Matlab code
- 2015-03-14 21:32:06下载
- 积分：1
-
wind_integration
Matlab/Simulink下的风力发电仿真程序，可用于研究风电并网下稳态、暂态以及故障运行时的系统状态，内附与程序相对应的论文。(Matlab/Simulink simulation program under wind power can be used to study wind power under steady state, transient and fault runtime system state, containing papers that corresponds with the program.)
- 2021-04-07 09:59:02下载
- 积分：1
-
分支定界法
说明： 分支定界法（branch and bound）是一种求解整数规划问题的最常用算法。这种方法不但可以求解纯整数规划，还可以求解混合整数规划问题。分支定界法是一种搜索与迭代的方法，选择不同的分支变量和子问题进行分支。
对于两个变量的整数规划问题，使用网格的方法有时更为简单。 [1]
通常，把全部可行解空间反复地分割为越来越小的子集，称为分支；并且对每个子集内的解集计算一个目标下界（对于最小值问题），这称为定界。在每次分枝后，凡是界限超出已知可行解集目标值的那些子集不再进一步分枝，这样，许多子集可不予考虑，这称剪枝。这就是分枝定界法的主要思路。(Branch and bound method is one of the most commonly used algorithms to solve integer programming problems. This method can solve not only pure integer programming but also mixed integer programming. Branch and bound algorithm is a method of search and iteration, which selects branches with different branch variables and sub problems.
For integer programming problems with two variables, the grid method is sometimes simpler[ 1]
Generally, all feasible solution spaces are divided into smaller and smaller subsets repeatedly, which is called bifurcation; And a lower bound of the objective (for the minimum value problem) is calculated for the solution set in each subset, which is called the bound. After each branch, those subsets whose bounds exceed the objective value of the known feasible solution set will not be further branched, so many subsets can not be considered, which is called pruning. This is the main idea of branch and bound method.)
- 2021-04-26 12:21:14下载
- 积分：1
-
SPWM
spwm变频调速系统的研究及其仿真模型的搭建(spwm frequency control system and simulation models to build)
- 2013-05-25 19:33:57下载
- 积分：1
-
RS(30,14,17) Matlab BPSK仿真程序
说明： 实现RS编码和译码的功能，RS码是一种性能优异的信道编码方式。(Realize RS coding and decoding function.)
- 2021-04-27 14:58:44下载
- 积分：1
