登录
首页 » Fortran » testcode

testcode

于 2013-06-26 发布 文件大小:2KB
0 198
下载积分: 1 下载次数: 1

代码说明:

  This is a test code for parallel computation in fortran. Thanks

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

发表评论

0 个回复

  • Fear.the.Walking.Dead.E05E04.480p.web.Fa
    Cavity Matlab SIMPLE algorithm
    2019-07-05 02:32:59下载
    积分:1
  • rosenbergtrustregion
    基于信任域算法求解rosenberg函数的极小值问题(Trust region algorithm for solving the rosenberg function minimum value)
    2021-04-10 12:58:59下载
    积分:1
  • two-point-problem
    打靶法求解两点边值问题 实例测试通过,可直接运行,并带有详细代码注释 采用全局收敛的牛顿-拉普森迭代算法求解编制问题 绝对物超所值!(Two-point boundary value problem shooting method)
    2020-12-15 21:19:14下载
    积分:1
  • gps_position
    GPS卡尔曼滤波仿真 read eph_data (GPS Kalman filter simulation read eph_data)
    2009-07-14 16:53:01下载
    积分:1
  • LMI_SOLVE
    运用线性矩阵不等式(LMI)求解鲁棒优化问题。该LMI不等式求解代码,更具有一般性,结合matlab中help命令,能够方便的对新的LMI问题求解(This programme code is useful for the common optimization problem, combined with the description of matlab help statement, a new LMI problem can be easy to solve. )
    2016-03-16 22:31:16下载
    积分:1
  • simple
    流体力学SIMPLE算法(C语言编程实现)需自己设定边界条件(SIMPLE algorithm)
    2013-09-06 19:00:42下载
    积分:1
  • BigNumber
    大数类,重载了各类操作符,可以直接使用(fate categories, a variety of heavy-duty operator can be used directly)
    2005-02-27 10:55:05下载
    积分:1
  • leastSquaresmethod
    说明:  最小二乘一次完成算法,C语言编写,源码,调试通过。(A complete least-squares algorithm, C language, source code, debugging through.)
    2008-10-18 13:57:54下载
    积分:1
  • piu_um40
    关于神经网络控制,数据模型归一化,模态振动,多目标跟踪的粒子滤波器。( On neural network control, Normalized data model, modal vibration, Multi-target tracking particle filter.)
    2017-03-21 19:50:09下载
    积分: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资源总数
  • 106648会员总数
  • 8今日下载