-
matlabusing
常用的MATLAB实用程序，可以帮助你完成MATLAB的快速入门(Commonly used MATLAB utility that can help you complete the Quick Start MATLAB)
- 2010-05-21 17:12:30下载
- 积分：1
-
Numerical-Analysis-Section
matlab 编程应用100例中的数值分析篇(matlab programming applications Numerical analysis of 100 cases articles)
- 2011-05-19 18:54:06下载
- 积分：1
-
matlba
三种求矩阵特征值的matlab实现：乘幂法、QR算法、yaccbi法求特征值(Eigenvalues of the three Matrix matlab implementation: power method, QR algorithm, yaccbi Eigenvalue Method)
- 2012-05-13 20:18:10下载
- 积分：1
-
imm5925
M.J.Conty写的经典最大自相关（MAF）和最小噪声分离(MNF)代码(MJConty write classical maximum autocorrelation (MAF) and minimum noise fraction (MNF) code)
- 2013-04-08 22:02:28下载
- 积分：1
-
predictive
地表一致性反褶积就是用预测的方法进行反褶积(Surface consistent deconvolution method is to use predictive deconvolution)
- 2015-01-21 19:01:26下载
- 积分：1
-
bgdircww
数学方法是部分子空间法，是机器学习的例程，时间序列数据分析中的梅林变换工具，验证可用，到达过程是的泊松过程，信号维数的估计，music高阶谱分析算法，旋转机械二维全息谱计算。( Mathematics is part of the subspace, Machine learning routines, Time series data analysis Mellin transform tool, Verification is available, Arrival process is a Poisson process, Signal dimension estimates, music higher order spectral analysis algorithm, Rotating machinery 2-d holographic spectrum calculation.)
- 2016-04-06 20:47:13下载
- 积分：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
-
proficientmatlab
MATLAB课件，有利于学习应用MATLAB (MATLAB software is conducive to studying the application of MATLAB )
- 2009-02-19 21:42:01下载
- 积分：1
-
MATLAB-functions-for-beginners
包括了MATLAB中常用函数，是Matlab 初学者的好帮手。(Commonly used functions, including the MATLAB is Matlab beginners a good helper.)
- 2011-01-29 03:29:28下载
- 积分：1
-
bresenham_line
draw line by Bersenham Algorithm
- 2011-06-11 05:27:44下载
- 积分：1
