登录
首页 » Fortran » util_mod

util_mod

于 2020-06-25 发布
0 193
下载积分: 1 下载次数: 4

代码说明:

说明:  相场法基础书籍的配套计算代码,对于学习相场法的基础同学来说极其有用(The supporting calculation code of the phase field basic book is extremely useful for the students who are studying the basic method of the phase field method.)

下载说明:请别用迅雷下载,失败请重下,重下不扣分!

发表评论

0 个回复

  • Hyper
    converts a binary undirected adjacency graph into a hypergraph. The output is a non symmetric matrix where the columns are the vertices and the rows are the hyper edges.
    2013-03-23 09:07:37下载
    积分:1
  • firfilter
    MFC实现快速傅里叶变换(FFT)MFC实现快速傅里叶变换(FFT)(MFC MFC Fast Fourier Transform (FFT) fast Fourier transform (FFT))
    2020-12-22 20:09:08下载
    积分:1
  • ch01
    ANSYS教程,《ANSYS有限元分析实用教程》源代码("ANSYS finite element analysis of practical course," the source code)
    2010-05-25 14:26:26下载
    积分:1
  • C
    说明:  含随机出题(四则运算)及其迭代程序、返回数组中最大子数组和及其迭代程序等。(Software class operations, including four operations and iterative procedure, returns an array of sub-arrays and the largest and Iterative procedures)
    2016-07-01 08:32:22下载
    积分:1
  • UDFlizi
    基于FLUENT软件的一些常用UDF实例,比较有帮助(udf example)
    2015-10-20 15:56:14下载
    积分:1
  • SPHForPoiseuilleFlow
    SPH计算泊肃叶流动,利用周期边界条件和虚拟粒子固壁条件(SPH Code for poiseuille Flow by peoriodic boundary condtion)
    2020-10-26 20:19:59下载
    积分:1
  • vegy__yhe
    一个经典的基于排挤机制的小生境遗传算法程序 不错的 很好(A classic the niche genetic algorithm based on crowding mechanism of good is very good)
    2017-05-13 03:20:14下载
    积分:1
  • PBGBand
    说明:  本程序可计算二维光子晶体的带隙,并得出带隙图,和带隙位置及宽度(This procedure computable two-dimensional photonic bandgap crystals, and came to the band-gap maps, and the band-gap position and width)
    2008-11-07 21:33:19下载
    积分:1
  • kalman_flexyModel
    卡尔曼机动,加入了对机动的检测和处理,对于机动模型,滤波解更加有效(Kalman mobility, the right to join the mobile detection and processing, motor model, a more effective filtering solution)
    2006-07-07 16:45:54下载
    积分:1
  • hartigansSLC_OpenCV
    hartigans Sequential Leader Clustering Algorithm in terms of OpenCV (ver.1.1) Sequential Leader algorithm: Hartigan, J. A. (1975), Clustering Algorithms. John Wiley and Sons, Inc., New York, NY. 1. Select maximum cluster "radius" 2. Start with zero clusters 3. Add each item to be clustered to: * Closest cluster if distance <= r * New cluster if distance to closest cluster > r 4. Compute new center from members in cluster 5. Empty the clusters (keeping the centers) 6. Return to step 3 (until no changes are made)
    2010-02-25 19:28:25下载
    积分:1
  • 696516资源总数
  • 106425会员总数
  • 12今日下载