SplineCSharp

用C语言实现计算两个数字的最大公约数，代码简单简洁，适合初学者学习。(C language is used to calculate the maximum common divisor of two digits. The code is simple and concise. It is suitable for beginners to learn.)

稀疏矩阵的DIA/ELLPACK/COO/CSR/HYB表示形式，以及各表示形式下的稀疏矩阵乘法（稀疏大矩阵*矢量）的CUDA实现。对于矩阵中每一行稀疏元素个数较统一的情况，ELLPACK表示最佳，其次是HYB（ELL+COO）。 CUDA™ 是一种由NVIDIA推出的通用并行计算架构，该架构使GPU能够解决复杂的计算问题。 它包含了CUDA指令集架构（ISA）以及GPU内部的并行计算引擎。 开发人员现在可以使用C语言来为CUDA™ 架构编写程序(Sparse matrix DIA/ELLPACK/COO/CSR/HYB representation, as well as the representation of the sparse matrix multiplication (large sparse matrix* vector)' s CUDA implementation. For each row of the sparse matrix representing the number of elements the case of unification, ELLPACK that the best, followed by HYB (ELL+COO). NVIDIA CUDA ™ is introduced by a general purpose parallel computing architecture that makes the GPU to solve complex computational problems. It contains the CUDA Instruction Set Architecture (ISA) and the GPU parallel computing engine. Developers can now use the C language to write programs for the CUDA ™ architecture)

J2000坐标系与WGS84坐标系之间的转换矩阵计算。(The matrix between J2000 and WGS84 coordinat system)

用于三点定位的算法，是做声音定位可用的，希望有部分帮助，可适当运用(It is used to location the point you want.)

说明：  最小二乘法估算三元二阶方程式系数，用于抛物线曲线拟合(Estimating coefficient of second order equation by least square method)

用DFT 函数计算电压u, 电流i的基波(f1=50 Hz)的有效值和相位; 用FFT函数分别计算电压u和电流i 所包含的直流,基波和谐波的有效值和初相角; 可计算基波(f1=50 Hz)和各次谐波的功率p和功率因数con?.(The effective value and phase of fundamental wave (f1 = 50 Hz) of voltage U and current I are calculated by DFT function. The effective values and initial phase angles of DC, fundamental and harmonic waves contained in voltage U and current I are calculated by FFT function, respectively. The power P and power factor con of fundamental wave (f1 = 50 Hz) and harmonics can be calculated.)

一种声场计算模型的源程序，for3d的一个较旧版本。(for3d programme the old one )

利用5阶WENO有限差分法求解一维Euler方程组，给出求解Sod型激波管问题的详细程序。(The use of 5-order WENO finite difference method for solving one-dimensional Euler equations given type of shock tube problem solving Sod detailed procedures.)

假设有一个能装入总体积为T的背包和n件体积分别为w1 , w2 , … , wn 的物品，能否从n件物品中挑选若干件恰好装满背包，即使w1 +w2 + … + wn=T，要求找出所有满足上述条件的解。例如：当T=10，各件物品的体积{1，8，4，3，5，2}时，可找到下列4组解：（1，4，3，2），（1，4，5），（8，2），（3，5，2）。 [需求分析](Suppose there are a load of the backpack of the total volume of T and n volumes were w1, w2, ... wn items, whether selected from n items a number of exactly filled backpack, even if w1+w2+ ...+ wn = T, find out the solution of all the above conditions are met. For example: when T = 10, the volume of items {1,8,4,3,5,2}, can be found in the following four solutions: (1,4,3,2), (1,4,5 ), (8,2), (3,5,2). [Needs Analysis])

一个简单的网格生成程序，操作方便，易学，类似于easymesh！(A simple grid generation program, easy to operate, easy to learn, like easymesh!)