资源列表
K-meanCluster
- How the K-mean Cluster work Step 1. Begin with a decision the value of k = number of clusters Step 2. Put any initial partition that classifies the data into k clusters. You may assign the training samples randomly, or systematically as the f
fft
- OpenMP 实现FFT 分解 曙光 4000A集群-OpenMP to achieve FFT decomposition of Dawning 4000A cluster
odd_even_sort
- MPI环境下实现的奇偶排序。仅用到基础的Isend，Irecv，send，recv，Bcast等功能。-Odd-even sort on MPI
omp_mat_vect
- 利用OpenMP来实现矩阵向量相乘的并行化，大大提高速度-OpenMP is used to realize the parallelization of matrix-vector multiplication, greatly improve the speed
EllipticCurve
- 椭圆曲线的生成，以及初始化的一些参数，对以后其他算法起到一定的作用。-elliptic curve generation, and the initialization of some of the parameters, right after the other algorithms play a certain role.
FLUX.f90.tar
- CFD计算中，构造流动通量的一种方法，利用了特征分裂的二维计算-a method constructing flux in CFD
ex1_VectorAddition
- CUDA 矢量加法优化以后的算法，用 CUDA C编写-CUDA Vector Addition Algorithm
Jacobi_MPI
- MPI c++ jacobi迭代代码，VS05 下编译通过-MPI c++ jacobi iteration code, VS05 compiled by
22-2
- 经典排序,查找,二叉树相关算法的并行源代码实现-classical order, locate, the binary tree algorithms to achieve parallel source code
Form1
- vb communication with plc
jacobi
- 自定义矩阵的Jacobi和 hesse矩阵计算-Custom Jacobi matrix and hesse matrix calculation
595
- stm32 spi 驱动16位 74hc595-stm32 spi 驱动16位 74hc595