-
qr
说明: qr变换和householder求特征值的算法,可与matlab结果比对(qr transform and householder eigenvalue algorithm, the results compare with matlab)
- 2014-10-16 10:35:19下载
- 积分:1
-
exam26
此函数中主要给出了如何实现MRI体数据的可视化,详细的给出了如何实现的步骤;(This function is mainly given how MRI volume data visualization, gives a detailed steps on how to achieve )
- 2013-12-06 17:04:48下载
- 积分:1
-
maikeerxun
基于matlab的迈克尔逊干涉仿真,帮助大家学习光的干涉(Based on the matlab simulation of Michelson interferometers, help you learn the interference of light
)
- 2015-06-08 17:17:13下载
- 积分:1
-
Simulinkinthecontrolsystem
说明: 包含Simulink在控制系统、人工神经网络中的应用(With Simulink in the control system, the application of artificial neural network)
- 2009-08-30 18:35:48下载
- 积分:1
-
Butterworth
Butterworth filter implementation in Matlab
- 2011-06-06 17:47:23下载
- 积分:1
-
Solving_Waveletentropy_in_Matlab
非常简洁的小波熵计算方法,它是一种趋势分析方法,可用于设备状态检测和故障诊断。(Wavelet entropy calculation is very simple method, which is a trend analysis method can be used to detect equipment status and fault diagnosis.)
- 2021-03-16 14:49:21下载
- 积分:1
-
Two-Category_Classifier
This Two-Category Classifier Using Discriminant Functions to
separeate two classes. The Classifier is designed on classes which
has two feature vectors and other case it has one feature vector.
- 2008-03-16 13:43:18下载
- 积分:1
-
Proportionalnavigationmethod
用比例导引法进行拦截弹针对机动目标的弹道仿真,仿真是基于三维模型。(Proportional navigation method used to intercept ballistic missile targets for motor simulation, simulation is based on three-dimensional model.)
- 2009-12-02 16:52:24下载
- 积分:1
-
Dijkstra
说明: 最短路径的Dijkstra算法程序。Dijkstra算法是典型最短路算法,用于计算一个节点到其他所有节点的最短路径。主要特点是以起始点为中心向外层层扩展,直到扩展到终点为止。Dijkstra算法能得出最短路径的最优解,但由于它遍历计算的节点很多,所以效率低。
Dijkstra算法是很有代表性的最短路算法,在很多专业课程中都作为基本内容有详细的介绍,如数据结构,图论,运筹学等等。
(The Dijkstra shortest path algorithm for the procedure. Dijkstra algorithm is a typical shortest path algorithm, used to calculate a node to all other nodes of the shortest path. The main characteristics is the starting point as the center outward expansion layers, until the end date be extended to. Dijkstra shortest path algorithm can arrive at the optimal solution, but because of its calculation of the node traversal, so inefficient. Dijkstra algorithm is very representative of the shortest path algorithm, in many professional courses in the basic content as described in detail, such as data structures, graph theory, operational research and so on.)
- 2008-11-26 22:27:45下载
- 积分:1
-
Untitled2
power flow by newton-aphson method
- 2011-07-17 04:03:13下载
- 积分:1