-
SAX
自己开发的Symbolic Aggregate Approximation(SAX)matlab工具箱。写了GUI界面。内附教程。(Develop their own Symbolic Aggregate Approximation (SAX) matlab toolbox. Write a GUI interface. Included tutorial.)
- 2021-04-12 11:28:57下载
- 积分:1
-
New-Text-Document-(2)
he form of the Burgers equation considered here is:
du du d^2 u
-- + u * -- = nu * -----
dt dx dx^2
for -1.0 < x < +1.0, and 0.0 < t.
Initial conditions are u(x,0) = - sin(pi*x). Boundary conditions are u(-1,t) = u(+1,t) = 0. The viscosity parameter nu is taken to be 0.01 / pi, although this is not essential.
The authors note an integral representation for the solution u(x,t), and present a better version of the formula that is amenable to approximation using Hermite quadrature.
This program library does little more than evaluate the exact solution at a user-specified set of points, using the quadrature rule. Internally, the order of this quadrature rule is set to 8, but the user can easily modify this value if greater accuracy is desired.
- 2012-04-13 12:06:48下载
- 积分:1
-
LM2576
LM2576/LM2576HV开关型降压稳压器电子技术手册(LM2576/LM2576HV)
- 2010-08-19 15:43:53下载
- 积分:1
-
Alamouti
这是Alamouti空时编码的程序,并且给出了误码性能仿真图!(This is the Alamouti space-time coding procedures, and gives the BER simulation map!)
- 2009-05-20 19:04:31下载
- 积分:1
-
MODELHSR
simulation the converter DC to DC single phase command with process of implosion
- 2010-06-01 06:17:16下载
- 积分:1
-
eg5-gongsicaiwuyujingjianmo
《MATLAB神经网络30个案例分析》中的第5个例子,案例5 基于BP_Adaboost的强分类器设计-公司财务预警建模。希望对大家有一定的帮助!(The MATLAB neural network analysis of 30 cases of 5 example, case 5 strong classifier design based on BP_Adaboost- corporate financial early warning model. Hope to have certain help to everybody!
)
- 2013-09-20 15:58:03下载
- 积分:1
-
code-4
this code is to learn more about the mattlab
- 2013-05-01 16:10:47下载
- 积分:1
-
5
说明: 利用Dijkstra算法来求网络图的最短路径,找到从起点P1到终点Pn的最短路径,由于上述算法使用了连接线中点的条件,不是整个规划空间的最优路径,然后利用遗传算法对找到的最短路径各个路径点Pi (i=1,2,…n)调整,让各路径点在相应障碍物端点连线上滑动(Use Dijkstra algorithm to find the shortest path network diagram to find the starting point P1 to the end of Pn from the shortest path algorithm is used as the midpoint of the condition of cable, not the entire optimal path planning of space, and then use genetic algorithm to find shortest path of each path points Pi (i = 1,2, ... n) adjusted to the path of obstacles in the corresponding endpoint connection point slide)
- 2011-05-10 16:03:58下载
- 积分:1
-
微电网优化调度
说明: 电网调度,包括风光储配置,目标函数经济性好(Power grid dispatching, including the configuration of wind and solar energy storage, has a good economic objective function)
- 2021-01-06 20:18:53下载
- 积分:1
-
hopfield
this file about implementing hopfield networks in matlab
- 2011-01-19 18:40:57下载
- 积分:1