bfgs算法求全域最小数值点，c++源程序,文件读入套用方便

遍历的C语言映射

这是一段生成粗糙面的源代码，非常实用，二维的，能够帮助那些做粗糙面研究的朋友，很简单明了，我在这里分享给大家，大家可以借鉴一下。

利用ＶＣ程序计算阴历-calculated using the Moon VC

//=== === === === === === === = //函数说明 //函数名称：PolyFit //函数功能：最小二乘法曲线拟合 //使用方法：double *x ---- 存放n个数据点的X坐标 // double *y ---- 存放n个数据点的Y坐标 // int n -------- 给定数据点个数 // double *a ---- 返回m-1次拟合多项式的m个系数 // int m -------- 拟合多项式的项数，即拟合多项式的最高次为m-1。要求m20，则本函数自动按m=min{n,20}处理 // double *dt --- dt[0]返回拟合多项式与各数据点误差的平方和；dt[1]返回拟合多 // 项式与各数据点的误差绝对值之和；dt[2]返回拟合多项式与各数据 // 点误差绝对值的最大值 //注意事项：拟合多项式的形式为 y = b0 + b1*(x-Xavr)... -//=== === === === === ==== === === === === === === ==== === =// function annotations// function name : PolyFit// Function functions : Least Squares Curve Fitting// Use : double* x n-store data point coordinates of the X//* y double-storage n data point Y coordinates// int n-------- given the number of data points//* a double---- returned to the m-1 m fit polynomial coefficients// int m-------- polynomial fitting items , which is the highest polynomial fitting time for m-1. Request m

A code for generating Cartesian grids (multigrid version).

线性规划中的单纯形法，单纯形法是求解线性规划的最主要方法，程序首先确定初始可行解，如没有找到，则引入人工变量或松弛变量来求解-Of linear programming simplex method, simplex method for solving linear programming are the most important methods, procedures to determine first of all, the initial feasible solution, such as not found, then the introduction of artificial variables or slack variable is used to solve

有遗传算法的选择、交叉、变异函数，一些简单的MABTLAB遗传算法例子

多元散射校正算法，用于近红外散射数据处理，增强信噪比-function [Xcorrect]=msc(X,Xref) msc pretreate the samples X with the Multiplicative Scatter Correct Input X:the matrix of the sample spectra to be Correct Xref:the matrix of the sample spectra to be ref Output Xcorrect:the sample spectras was Corrected from the X Programmer: zhimin zhang @ central south university on dec 13 ,2007 Reference: Chemometrics and Intelligent Laboratory Systems 29 (1995) 233-241

用c语言实现生产者-消费者问题-used language producer-consumer issues

随机算法的c++源代码，程序结构清晰，便于理解-Stochastic Programming