-
Riemann-solver
程序是关于计算两相黎曼问题的一个求解器。可以直接设置。(The code is a solver about the two-phase Riemann problem. the user can use it directly.)
- 2016-06-28 13:52:45下载
- 积分：1
-
computing-theory-introduction
《计算理论导引》(作者)[美] Michael Sipser(译者)张立昂 王捍贫 黄雄 机械工业2000年2月第1版.pdf(Computational Theory，(Author) [America] Michael Sipser (translator) Zhang Li Ang Wang Hanpin Wong Hung Machinery Industry in February 2000 1st edition. Pdf)
- 2013-09-09 21:01: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
-
matrixmulti
在visual studio的平台上开发CUDA程序实现并行加速计算矩阵的乘积，同时比较与串行计算的差异(Differences in the development of procedures to achieve parallel CUDA accelerated computing matrices in visual studio platform, but compared with the serial computing)
- 2020-12-11 21:49:17下载
- 积分：1
-
LZYGSXY
数值分析课程必备的算法：列主元高斯消去法算法。有需要的同学下载(Numerical analysis courses required algorithms: PCA out Gaussian elimination algorithm. Those students in need to download)
- 2009-01-05 22:38:00下载
- 积分：1
-
源代码
七段s曲线路径规划程序详解 非常适合做运动控制规划(Detailed solution of seven segment s curve path planning program)
- 2018-02-01 09:38:46下载
- 积分：1
-
LL1 grammer
vc++实现编译原理中的LL(1)文法的编译过程,非常好用.(vc realization of the principle of compiler LL (1) grammar compiler course, very handy.)
- 2005-07-03 21:22:30下载
- 积分：1
-
sor超松弛迭代法
一个实现sor超松弛迭代法的c语言算法，可以帮助新手完成矩阵计算(A C language algorithm for realizing over relaxation iterative method)
- 2017-06-30 09:34:56下载
- 积分：1
-
na7
Orthogonal Polynomials Approximation
数值分析，计算正交基多项式的系数
(Given a function f and a set of m >0 distinct points . You are supposed to write a function to approximate f by an orthogonal polynomial using the exact function values at the given m points with a weight assigned to each point . The total error must be no larger than a given tolerance.
Format of function
int OPA( double (*f)(double t), int m, double x[], double w[], double c[], double*eps )
where the function pointer double (*f)(double t) defines the function f int m is the number of points double x[] contains points double w[] contains the values of a weight function at the given points x[] double c[] contains the coefficients of the approximation polynomial double*eps is passed into the function as the tolerance for the error, and is supposed to be returned as the value of error. The function OPA is supposed to return the degree of the approximation polynomial.
Note: a constant Max_n is defined so that if the total error is still not small enough when n = Ma)
- 2011-11-27 11:47:21下载
- 积分：1
-
Adams-RK
经典R-K法，通过它可以计算一些简单的常微分方程的数值解(Classical RK method, which can be calculated by simple numerical solution of ordinary differential equations)
- 2010-12-30 14:09:37下载
- 积分：1
