-
共轭梯度法
说明： 共轭梯度法（Conjugate Gradient）是介于最速下降法与牛顿法之间的一个方法，它仅需利用一阶导数信息，但克服了最速下降法收敛慢的缺点，又避免了牛顿法需要存储和计算Hesse矩阵并求逆的缺点，共轭梯度法不仅是解决大型线性方程组最有用的方法之一，也是解大型非线性最优化最有效的算法之一。 在各种优化算法中，共轭梯度法是非常重要的一种。其优点是所需存储量小，具有步收敛性，稳定性高，而且不需要任何外来参数。(Conjugate gradient method Gradient) is a method between the steepest descent method and Newton's method. It only uses the first derivative information, but overcomes the disadvantage of slow convergence of steepest descent method, and avoids the disadvantage of storing and calculating Hesse matrix and solving inverse of Newton's method. Conjugate gradient method is not only one of the most useful methods to solve large-scale linear equations, but also the most effective method to solve large-scale nonlinear optimization One of the algorithms of. Among all kinds of optimization algorithms, conjugate gradient method is very important. It has the advantages of small storage, step convergence, high stability and no external parameters.)
- 2020-06-27 15:46:08下载
- 积分：1
-
fluent-UDF
说明： 常用的fluent边界条件的控制UDF，包括动网格UDF(Commonly used control UDF of fluent boundary conditions, including moving grid UDF)
- 2020-12-16 19:21:13下载
- 积分：1
-
gap-width-and-JRC
计算岩石表面裂隙宽度并求取其表面粗糙度系数(Calculate the rock surface crack width and strike the surface roughness coefficient)
- 2016-02-18 03:01:04下载
- 积分：1
-
2DUDFSTOKES
该程序为fluent软件进行速度入口造波数值模拟，波浪为二阶stokes波(The program for the FLUENT software simulation of wave speed entrance numerical, two order Stokes wave)
- 2014-07-11 15:40:02下载
- 积分：1
-
HartleyTransform
The Fast Hartley Transform (FHT) implementation.
- 2011-05-24 21:39:11下载
- 积分：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
-
ComputationalMechanicsLibrary
一个个人使用的精简了的c++有限元计算库(Finite element calculation library)
- 2018-04-15 15:39:13下载
- 积分：1
-
EedffazipD
EDFA的掺铒光纤长度模拟计算，附3篇相关论文，330mw的980nm泵泵浦，3db的泵浦吸收，12m最佳长度已经的到验证，可作为EDFA设计参考
(EDFA erbium-doped fiber length simulation of three related papers, 330mw of 980nm pump pump pump 3db absorption 12m optimum length has been to verify, can be used as the EDFA design reference)
- 2012-08-05 18:09:17下载
- 积分：1
-
fft_基2基4基8
说明： 基2基4基8以及分裂基的fft算法，代码效率很高。是难得一见的好代码。应用范围很广。(Radix-2-4-based 8 and split fft-based algorithm, a high code efficiency. Is a rare good code. Application of a very wide scope.)
- 2021-02-20 13:59:43下载
- 积分：1
-
object-oriented
面向对象的有限元程序设计。与传统的有限元程序相比，面向对象有限元程序更易于编写、更易于维护和扩充，程序代码的可重用成分更大。(object oriented finite element programming)
- 2014-10-31 15:53:47下载
- 积分：1
