-
Lbfgsb.2.1.tar
有限内存BFGS约束优化算法Fortran程序及其说明(Limited memory BFGS Algorithm for Constrained Optimization Fortran program and its description)
- 2008-07-15 15:22:44下载
- 积分:1
-
kaiserchuang
这是一个凯瑟窗的例子,利于凯瑟窗做成一个带通滤波器(This is a Kaiser window example, conducive to the Kaiser window into a band-pass filter
)
- 2011-10-29 20:20:12下载
- 积分:1
-
VMD_test2
说明: 变分模态分解程序,包括函数和测试程序,已加中文注释,另有说明文档。(The program of variational mode decomposition, including function and test program, has been annotated in Chinese and provided with other documents.)
- 2020-06-05 21:13:40下载
- 积分:1
-
matlab_3_opt
提供一种求解最优哈密尔顿的算法---三边交换调整法,要求在运行jiaohuan3(三交换法)之前,给定邻接矩阵C和节点个数N,结果路径存放于R中。
bianquan.m文件给出了一个参数实例,可在命令窗口中输入bianquan,得到邻接矩阵C和节点个数N以及一个任意给出的路径R,,回车后再输入jiaohuan3,得到了最优解。
由于没有经过大量的实验,又是近似算法,对于网络比较复杂的情况,可以尝试多运行几次jiaohuan3,看是否能到进一步的优化结果。
(Provide an optimal algorithm Hamilton- trilateral exchange Adjustment Act, requiring running jiaohuan3 (c exchange) before a given adjacency matrix C and the node number N, the results of the path stored in the R in. bianquan.m document gives examples of a parameter can be in the command window, type bianquan, be the adjacency matrix C and the node number N and an arbitrary given path R,, carriage return after the input jiaohuan3, have been the optimal solution . After the absence of a large number of experiments, it is approximate algorithm, for more complex network situations, you can try to run several jiaohuan3, can look to further optimize the results.)
- 2007-09-20 19:35:15下载
- 积分:1
-
xiaochu
用于信号(振动信号等其它信号)消除趋势项,采用最小二乘原理(Used to signal to eliminate trend items)
- 2013-04-14 21:52:01下载
- 积分:1
-
Libsvm-FarutoGUI
Libsvm-FarutoGUI工具箱下载,安装,工具箱页面介绍和使用说明等(Libsvm-FarutoGUI toolbox download, install, and use the toolbox page description etc.)
- 2015-03-10 15:04:57下载
- 积分:1
-
grayerror
matlab基于灰色理论的去除粗大误差的代码(remove coarse error matlab code based on gray theory)
- 2014-02-19 16:12:19下载
- 积分:1
-
envelop6
多径误差包络的仿真,能够清晰的看出。希望对大家有所帮助。(Multipath error envelope simulation, can be clearly seen. We want to help.)
- 2009-11-27 10:37:34下载
- 积分:1
-
A1Jedi.java
This program counts the occurrence of specified patterns in the input strands and produces a report for each pattern. The first input to this program will be an integer indicating how many patterns will be provided (call this N). The next N words to this program will be patterns of nucleobases to search for. Following the patterns will be a sequence of strands terminated by the word "end" as before.
- 2014-01-25 12:44:00下载
- 积分:1
-
odef
digital signal processing examples
- 2009-05-10 02:32:31下载
- 积分:1