登录
首页 » Visual C++ » SMM

SMM

于 2006-04-27 发布 文件大小:252KB
0 247
下载积分: 1 下载次数: 0

代码说明:

说明:  几种模幂算法,有传统模幂,SMM模幂,基于2的K次方的模幂和最一般的模幂算法,还有为这些模幂算法建立的WINDOWS对话框。可以方便的运行。(algorithm, the traditional mode power, SMM Modular Power, Based on two of the K-th power module and the most common mode power algorithm, These modules also for the establishment of the algorithm Power Windows dialog box. To facilitate the operation.)

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

发表评论

0 个回复

  • nijie
    六轴工业机器人的逆运动学,采用VC++进行编程自动求解(inverse of 6-dof industrial robot)
    2020-12-25 12:19:04下载
    积分:1
  • WaterPress
    对于水轮机阀门开启、关闭的一瞬间,对于钢管有比较大的水击。该程序计算出了相对最大的水击压力。(For turbine valves opened, the closure of the moment, for a relatively large pipe water hammer. The program calculated the maximum relative pressure of water hammer.)
    2008-03-15 16:37:05下载
    积分:1
  • 1parallel
    用于FLUENT计算结构单自由度涡激振动,采用四阶龙哥库塔法,并设置了并行计算(FLUENT, VIV, Fourth order Runge-Kutta )
    2016-09-30 18:49:07下载
    积分:1
  • CPPsimplex
    单纯形法,求解线性规划问题的通用方法。单纯形是美国数学家G.B.丹齐克于1947年首先提出来的。它的理论根据是:线性规划问题的可行域是 n维向量空间Rn中的多面凸集,其最优值如果存在必在该凸集的某顶点处达到。顶点所对应的可行解称为基本可行解。单纯形法的基本思想是:先找出一个基本可行解,对它进行鉴别,看是否是最优解;若不是,则按照一定法则转换到另一改进的基本可行解,再鉴别;若仍不是,则再转换,按此重复进行。因基本可行解的个数有限,故经有限次转换必能得出问题的最优解。如果问题无最优解也可用此法判别。 (Simplex method for the minimum)
    2011-09-18 22:57:30下载
    积分:1
  • wavepacket-cpp-0.1.1b
    c++编写的小波包算法,可以实现小波包分解与重构,速度较快(A wavelet packet implementation written in C++, does wavepacket decomposition and reconstruction quite efficiently)
    2020-07-04 00:20:02下载
    积分:1
  • synthesis-of-mechanism
    对于给定的一组轨迹点,用优化方法实现铰链四杆机构轨迹复演。优化方法为共轭梯度法。(For a set of track points,we use a optimization method to optimize the track of Hinge four-bar mechanism. The optimization method is conjugate gradient.)
    2011-06-23 15:42:20下载
    积分:1
  • wogefasuanli
    涡格法计算机翼的涡强,对不同剖面形状,拱度等进行了比较分析。并且与书籍上对比(Vortex lattice method the computer wing of the vortex is strong, the shape of different profiles, such as camber, a comparative analysis.)
    2011-07-10 20:40:16下载
    积分:1
  • KMEANS
    This directory contains code implementing the K-means algorithm. Source code may be found in KMEANS.CPP. Sample data isfound in KM2.DAT. The KMEANS program accepts input consisting of vectors and calculates the given number of cluster centers using the K-means algorithm. Output is directed to the screen. Usage for KMEANS is: KMEANS SOURCEFILE <enter> The format of the source file is: NPat - Number of patterns (int) SizeVect - Size of vector (int) NClust - Number of cluster centers(int) vect[1,1] ... vect[1,SizeVect] - vector 1 (real) vect[2,1] ... vect[2,SizeVect] - vector 2 (real) . . . . . . vect[NPat,1] ... vect[NClust,SizeVector] - vector N (real) To compile: ICC KMEANS.CPP <enter> (This directory contains code implementing the K-means algorithm. Source code may be found in KMEANS.CPP. Sample data isfound in KM2.DAT. The KMEANS program accepts input consisting of vectors and calculates the given number of cluster centers using the K-means algorithm. Output is directed to the screen. Usage for KMEANS is: KMEANS SOURCEFILE <enter> The format of the source file is: NPat - Number of patterns (int) SizeVect - Size of vector (int) NClust - Number of cluster centers(int) vect[1,1] ... vect[1,SizeVect] - vector 1 (real) vect[2,1] ... vect[2,SizeVect] - vector 2 (real) . . . . . . vect[NPat,1] ... vect[NClust,SizeVector]- vector N (real) To compile: ICC KMEANS.CPP <enter> )
    2013-01-05 23:11:23下载
    积分:1
  • powell
    优化设计算法:用powell法求解目标函数的最优解和最优值,已经验证算法的正确性,在visual c++6.0下开发(Optimization algorithm: Solving the objective function with powell optimal solution and optimal value, has verified the correctness of the algorithm, the visual c++6.0 under development)
    2021-04-20 10:18:50下载
    积分:1
  • convolution
    稀疏脉冲反褶积代码,包括高尔消元法解矩阵方程阻,自相关,互相关,褶积,反褶积的代码. 刚参加工作那会儿,上进心也足,爱动脑,编了很多的程序,唯有这一个是我引以为傲的,花了几个星期写的稀疏脉冲(预测)反褶积的代码,放到了现在,觉得也没必要再私藏下去了,不出五年,我都不知道这段代码是干什么的了. 希望对大家有用,方法太简单,所以效果不是太好,请大家修改,如要转载,请记得注明出处. (vc++)
    2009-05-09 16:51:58下载
    积分:1
  • 696518资源总数
  • 106010会员总数
  • 4今日下载