neh

计算机常用数值算法与程序(C++版) (Commonly used numerical algorithm of computer and program )

使用正交多项式完成数据拟合。程序对读入的gps采样点完成曲线拟合。()

说明：  ADAM （Adaptive Moment Estimation）是另外一种自适应学习率算法，它结合动量梯度 下降法，在不同参数方向上采用不同学习率，保留前几次迭代的梯度，能够很好 的适应于稀疏数据。(ADAM (Adaptive Moment Estimation) is another adaptive learning rate algorithm, which combines momentum gradient. The descent method, which uses different learning rates in different parameter directions and retains the gradients of previous iterations, is very good. It is suitable for sparse data.)

这是一个数值计算Fortran程序，将矩阵进行奇异值分解，SVD.txt存放待分解的矩阵，u.dat,v.dat为分解后的左右矩阵，qiyizhi.dat和qiyizhi0.dat为得到的奇异值。(This is a numerical Fortran program matrix singular value decomposition, SVD.txt store to be factored matrix, u.dat, v.dat about decomposition of the matrix, qiyizhi.dat and singular value obtained qiyizhi0.dat .)

协同克里格matlab实现,包括普通克里格,变差函数和交叉变差函数的实现,三维图显示机及其协同区域化( Cokriging matlab realize, including the realization of ordinary kriging, and cross variogram variogram, three-dimensional diagram shows the machine and its Coregionalization)

frft程序函数，分数阶傅立叶变换，短时傅立叶变换，傅立叶变换(the frft program function, fractional Fourier transform, short-time Fourier transform, Fourier transform)

给出了高斯消元的代码，和程序页面，方便快捷(The code and program page of Gauss elimination are given, which is convenient and quick.)

最小二乘法(LS)仿真三个参考节点定位一个定位节点，包括仿真参数和过程数据收集(Least squares (LS) simulation of three reference nodes positioning a positioning node, including the simulation parameters and process data collection)

我们需要成百上千的分类器来解决现实世界的分类吗 我们评估179分类17种分类器（判别分析，贝叶斯，神经网络，支持向量机，决策树，基于规则的分类器，升压、装袋、堆放、随机森林和其他合奏，广义线性模型，线性，偏最小二乘法和主成分回归，logistic回归、多项式回归、多元自适应回归样条等方法），实现在WEKA，R（有或没有插入包），C和Matlab，包括所有目前可用的相关分类。(Do-we-Need-Hundreds-of-Classifiers-to-Solve-Real-World-ClassificationProblems)

Finding special triples of the form (n, n + 1, n + 2) Write a program that finds all triples of consecutive positive three-digit integers each of which is the sum of two squares, that is, all triples of the form (n, n + 1, n + 2) such that: • n, n+1 and n+2 are integers at least equal to 100 and at most equal to 999 • eachofn,n+1andn+2isoftheforma2+b2.(Finding special triples of the form (n, n+ 1, n+ 2) Write a program that finds all triples of consecutive positive three-digit integers each of which is the sum of two squares, that is, all triples of the form (n, n+ 1, n+ 2) such that: • n, n+1 and n+2 are integers at least equal to 100 and at most equal to 999 • eachofn,n+1andn+2isoftheforma2+b2.)