Hot Search : Source embeded web remote control p2p game More...
Location : Home Search - MATLAB c
Search - MATLAB c - List
qr分解的c语言程序,可以嵌入matlab使用-simulated decomposition of the c language program, can be embedded using Matlab
Date : 2008-10-13 Size : 1.19kb User : 尚芳

G-P算法计算关联维的 Matlab 程序 (升级版,mex函数,超快) ----------------------------------- 更新部分: 引入限制短暂分离参数,使该参数大于序列平均周期时,去除了同一轨道前后点的关联, 使 r 值较小时,ln r - ln C(r) 曲线接近线性-G-P method to calculate the correlation dimension of the Matlab program (upgrade version Files function, Ultrafast) ----------------------------------- Update parts : the introduction of restrictions on temporary separation parameters so that the parameter is greater than the average cycle sequence, In addition to the same orbit around the point and makes a relatively small r, r ln - ln C (r) almost linear curve
Date : 2008-10-13 Size : 6kb User : billjie

qr分解的c语言程序,可以嵌入matlab使用-simulated decomposition of the c language program, can be embedded using Matlab
Date : 2025-12-27 Size : 1kb User :

G-P算法计算关联维的 Matlab 程序 (升级版,mex函数,超快) ----------------------------------- 更新部分: 引入限制短暂分离参数,使该参数大于序列平均周期时,去除了同一轨道前后点的关联, 使 r 值较小时,ln r - ln C(r) 曲线接近线性-G-P method to calculate the correlation dimension of the Matlab program (upgrade version Files function, Ultrafast)----------------------------------- Update parts : the introduction of restrictions on temporary separation parameters so that the parameter is greater than the average cycle sequence, In addition to the same orbit around the point and makes a relatively small r, r ln- ln C (r) almost linear curve
Date : 2025-12-27 Size : 6kb User : billjie

图论算法库 C++ 语言实现 代码内容 图论算法库,包括以下算法: 单源最短路径 Dijkstra 算法 单源最短路径 Bellman-Ford 算法 最小生成树 Prim 算法 每对节点间最短路径 Flod-Warshall 算法 语言 C++ 编译平台 VisualAge C++ 4.0 作者 starfish (starfish.h@china.com) 备注 程序用C++语言编写,在VisualAge C++ 4.0下调试通过。压缩包内的Graph.h文件包含所有的库函数,其调用接口见程序内注释。其他的文件是用来测试算法的测试程序,在VisualAge C++ 4.0下编译运行。 该算法是我为参加ACM/ICPC竞赛而准备的资料,由于竞赛的对编程速度要求较高,所以为了将代码写的短一点,为了便于调试,代码的写的并不是最优的。 虽然该代码在VisualAge C++ 4.0下写成,但是很容易将其移植到MS Visual C++上。 - -graph theory is the C language code as graph theory algorithm library, including the following algorithm : single source Dijkstra shortest path algorithm for single-source shortest path Bellman-Ford algorithm youngest generation Prim algorithm for each tree node on the shortest path between Flod- Warshall algorithm language C compiler platform Vi sualAge author starfish 4.0 C (starfish.h @ china.c om) Remarks procedures using C language, VisualAge C 4.0 debugging through. The compressed file contains Graph.h all library functions, procedures call interface see Notes. Other documents are used to test the algorithm testing procedures, the VisualAge C compiler running under 4.0. The algorithm is to participate in the ACM/ICPC contest and the preparation of information, because the competit
Date : 2025-12-27 Size : 4kb User :

最小二乘法用于分形维数中的计算,应用于c下-Least square method
Date : 2025-12-27 Size : 1kb User : andy

matlab程序画图,常见分形图,function cantor(A,B) c=1 p=0 figure hold on plot([A(2) B(2)],[A(1) B(1)], r* ) while norm(A(1,:)-B(1,:))>=1 C=[] D=[] for i=1:size(A,1) a=A(i,:)+(B(i,:)-A(i,:))/3 b=A(i,:)+2*(B(i,:)-A(i,:))/3 C=[C A(i,:) b] D=[D a B(i,:)] end A=C B=D p=p+1 -matlab program drawing, common fractal images function cantor(A,B) c=1 p=0 figure hold on plot([A(2) B(2)],[A(1) B(1)], r* ) while norm(A(1,:)-B(1,:))>=1 C=[] D=[] for i=1:size(A,1) a=A(i,:)+(B(i,:)-A(i,:))/3 b=A(i,:)+2*(B(i,:)-A(i,:))/3 C=[C A(i,:) b] D=[D a B(i,:)] end A=C B=D p=p+1
Date : 2025-12-27 Size : 2kb User : 郑志森

DL : 0
基于matlab的分形维数的计算,二维数字图像的处理很大程度上取决于分形维数。-Calculating the fractal dimension based on matlab
Date : 2025-12-27 Size : 42kb User : zhangsha

FCM,模糊C均值聚类的MATLAB实现[matlab],很好的源码 不错的(FCM, the MATLAB fuzzy c-means clustering (MATLAB), a good source of good)
Date : 2025-12-27 Size : 5kb User : Rezinkmd
CodeBus is one of the largest source code repositories on the Internet!
Contact us :
1999-2046 CodeBus All Rights Reserved.