资源列表
gauss.rar
- 用高斯列主元消元法解下列线性方程组 高斯消元求解一些系数矩阵中含有极小数的情况下，会产生巨大的舍入误差，导致算法失效。一个简单而有效的改进方法是每次在进行将当前列中元素的消成0的运算时，选择当前列j对应的行(j to n)中绝对值较大的一个数作为主元行，这样，误差就会减小很多,PCA with out Gaussian elimination method solution of the following system of linear equations to solve a numbe
gaosi.rar
- 本程序实现一个简单方程组的高斯消去法的换算过程，其中方程系数需构成一个系数增广矩阵，同时输入过程严格按照矩阵输入。,This procedure to achieve a simple equation of the Gaussian elimination of the conversion process, which takes an equation coefficients augmented coefficient matrix, while the importation proc
CUDA_FDTD_Presentation.rar
- CUDA FDTD Algorithm presentations,CUDA FDTD Algorithm presentations
szds.rar
- 几种数值代数中求解线性方程组的方法，包括雅克比，G-S，超松弛等,Several numerical linear algebra to solve equations, including Jacobi, GS, such as over-relaxation
p3181.rar
- 用奇异值和总体最小二乘法来求自滑动平均自回归的回归参数问题,Using singular value and the total least squares method for autoregressive moving average since the return parameters
OL.rar
- 可以实现数值分析中的欧拉法、后退欧拉法和改进欧拉法的计算，程序中涉及到拉界面，以及许多控件的使用。,Numerical analysis can be achieved in the Euler, backward Euler and improved Euler s method of calculation, the procedure involved in drawing interface, as well as the use of many controls.
基于网络最小割计算稠密深度图的全局优化方法
- 一种基于最小割的稠密视差图恢复算法 摘要:针对经典最小割算法计算量大和适应性不足的问题,提出一种改进的基于网络最小割计算稠密深度图的全局优化方法。,Based on the minimum cut of a dense disparity map algorithm to restore
u_tplusu_xxx=0.rar
- Local Discontinuous Galerkin methods for linear equation u_t + u_xxx = 0， highter order ,Local Discontinuous Galerkin methods for linear equation u_t+ u_xxx = 0, highter order
fftw-3.2.2.pl1-dll32.zip
- FFTW 3.2.2 Windows DLLs,最快的FFT函数库。
fftw3.rar
- FFTW3使用说明文档，pdf格式~~~~~~~~~,pdf document of FFTW3
AuxParticleFilter.zip
- Auxiliary Particle Filter implemented in C# (also known as condensation algorithm, Sequential Monte Carlo, etc..) See Auxiliary Particle Filter by Pitt/Shephard 1998 for details on this algorithm. Will need to be modified for your use but shoul
NH2.rar
- 最小二乘法曲线拟合的程序。根据试验采集的10-100个采样点，利用最小二乘思想，可以拟合出N次的曲线。具体阶次自己设定。,Least squares curve fitting procedures. 10-100 in accordance with test samples collected, the use of least squares of thought, can be fitted curve N times. Specific order set.