群微粒算法：本算法用群微粒算法求目标函数的最大值
//本算法使用步骤
// （1）派生自己的群微粒类，类中必须定义double GetFit(PARTICLE&)方法，用来计算每个微粒的适合度
// （2）生成派生类实例，并在构造函数中指明微粒坐标维数和群体个数
// （2）设置微粒坐标上界数组和下界数组，并用SetXup与SetXdown设置微粒坐标上下界
// （3）用SetVmax方法设置微粒最大速度
// （4）设置可选参数：C1，C2，W和通讯函数
// （5）采用Run方法进行优化运算，优化后用GetBest方法获得最优个体适合度和坐标
Group of particle algorithm: this algorithm with a group of particles for a maximum of the objective function
//the algorithm using steps
//derived their own group of particles (1) class, the class must be defined in a double GetFit (PARTICLE &) method, is used to calculate the fitness of each PARTICLE
//(2) generates derived class instance, and indicate the particles in the constructor coordinate dimension and the number of groups
//(2) set the particle coordinate arrays and lower bound, the upper bound and SetXup and SetXdown set the upper and lower bounds particle coordinates
//(3) set maximum speed particles in SetVmax way
//(4) set the optional parameters: C1 and C2, W and communications functions
//(5) Run method is adopted to optimize arithmetic, the optimized GetBest method to obtain the optimal individual fitness and coordinates (2016-04-23, Visual C++, 289KB, 下载1次)
FDTD Solutions 是一款三维麦克斯韦方程求解软件，可以分析紫外、可见、红外至太赫兹和微波频率段电磁波与具有亚波长典型尺寸复杂结构的相互作用。
FDTD Solutions 使得设计师能够从容地面对光子设计复杂的挑战问题。快速原型制造和高精度仿真大大降低对费用高昂的原型试验的依赖，因而可以对设计概念进行快速评价，进而缩短产品研发周期，降低费用。 FDTD Solutions 可以帮助你成功应对各种复杂的应用，从基础光子学研究，到目前工业界领先应用领域如成像、照明、生物光子学、光伏、以及众多其他应用。
FDTD Solutions is a three-dimensional software for solving Maxwell' s equations, we can analyze the ultraviolet, visible, infrared and microwave to terahertz frequencies of electromagnetic waves having a typical size of subwavelength interaction of complex structures. FDTD Solutions allows designers to calmly face the complex photonic design challenges. Rapid prototyping and simulation precision greatly reduce dependence on costly prototype testing, which can quickly uate design concepts, and thus shorten the product development cycle and reduce costs. FDTD Solutions can help you successfully deal with a variety of complex applications, leading application areas such as imaging, lighting, biophotonics, photovoltaics, and many other applications basic photonics research, the current industry. (2016-03-20, Visual C++, 150KB, 下载7次)
单纯形法，求解线性规划问题的通用方法。单纯形是美国数学家G.B.丹齐克于1947年首先提出来的。它的理论根据是：线性规划问题的可行域是 n维向量空间Rn中的多面凸集，其最优值如果存在必在该凸集的某顶点处达到。顶点所对应的可行解称为基本可行解。单纯形法的基本思想是：先找出一个基本可行解，对它进行鉴别，看是否是最优解；若不是，则按照一定法则转换到另一改进的基本可行解，再鉴别；若仍不是，则再转换，按此重复进行。因基本可行解的个数有限，故经有限次转换必能得出问题的最优解。如果问题无最优解也可用此法判别。
Simplex method, the general method for the linear programming problem. Simplex is American mathematician G.B. Dan cheek first proposed in 1947. According to its theory is: linear programming problem in the feasible region is a n d vector space Rn polyhedral convex set, the optimal value if there will be some vertices in the convex set. The vertices of the feasible solution is called the basic feasible solution. Simplex method the basic idea is: to find out a basic feasible solution, to identify it, to see whether the optimal solution If not, then according to certain rules to another to improve the basic feasible solution, then identify If still not, transform again, click here to repeat. Because the number of basic feasible solution co., LTD., the limited time converting will can get the optimal solution of problem. If the problem no optimal solutions also can use this method. (2014-08-14, Visual C++, 3KB, 下载2次)
这是一个古老的具有代表性的问题，用计算机求解时的算法也很多，这里仅介绍一种。
采用一维数组来进行处理。数组的下标i表示棋盘上的第i列，a[i]的值表示皇后在第i列所放的位置。如：a[1]=5，表示在棋盘的第一例的第五行放一个皇后。
程序中首先假定a[1]=1，表示第一个皇后放在棋盘的第一列的第一行的位置上，然后试探第二列中皇后可能的位置，找到合适的位置后，再处理后续的各列，这样通过各列的反复试探，可以最终找出皇后的全部摆放方法。
程序采用回溯法，算法的细节参看程序。
This is representative of an old problem, the computer algorithm solving a lot only introduce a The one-dimensional array to be processed. The array subscript i represents the i th column on the board, a [i] of the value indicates the location of release of the Queen in the i th column. : A [1] = 5, put a queen in the fifth line of the first example of the checkerboard. The program first assumed that a [1] = 1, the first Queen on the board of the first row of the first column position, and then testing the Queen' s position in the second column, find a suitable location, and then processing subsequent columns, so columns repeatedly test could eventually find the queen placed method. The program uses a backtracking algorithm detail. (2013-03-27, Visual C++, 1KB, 下载1次)
行列式在数学中，是由解线性方程组产生的一种算式。[1]其定义域为nxn的矩阵A，取值为一个标量，写作det(A)或 | A | 。行列式可以看做是有向面积或体积的概念在一般的欧几里得空间中的推广。或者说，在 n维欧几里得空间中，行列式描述的是一个线性变换对“体积”所造成的影响。无论是在线性代数、多项式理论，还是在微积分学中（比如说换元积分法中），行列式作为基本的数学工具，都有着重要的应用。 行列式概念最早出现在解线性方程组的过程中。十七世纪晚期，关孝和与莱布尼茨的著作中已经使用行列式来确定线性方程组解的个数以及形式。十八世纪开始，行列式开始作为独立的数学概念被研究。十九世纪以后，行列式理论进一步得到发展和完善。矩阵概念的引入使得更多有关行列式的性质被发现，行列式在许多领域都逐渐显现出重要的意义和作用，出现了线性自同态和向量组的行列式的定义。
Determinant in mathematics, is a formula by solving linear equations. [1] defined domain nxn matrix A, the value of a scalar, writing det (A) or | A |. Determinant can be seen as to the promotion of the concept of area or volume in general Euclidean space. Or, in the n-dimensional Euclidean space, described the impact of a linear transformation of the "volume" determinant. Both linear algebra, polynomial theory or calculus (for example change element integral method), the determinant as the basic mathematical tools have important applications. Determinant concept first appeared in the process of solving linear equations. Determinant of the seventeenth century late SEKI and Leibniz s writings have been used to determine the number of solutions of linear equations as well as the form. 18th century, the determinant started as an independent mathematical concepts being studied. The 19th century onwards, the the determinant theory further development and improvement. Matrix concept makes mo (2013-03-04, Visual C++, 103KB, 下载1次)
根据美国和加拿大相关的Fortran程序用VC++6.0重新改写，增加了界面操作和功能增强。
其中：
潮汐分析和预报需要all_con和tconl两个子目录以及.par定义文件，内容参照tide2007.par定义相关说明，数据文件第一行指明数据起始时间“月 年”，第二行开始“当月第一天0点开始计算的秒数 潮位数据”，参照tide_2007.txt。调和分析生成对应的.hg文件存储调和参数，可直接用于潮位预报；指定调和参数文件及预测起始和结束时间直接进行潮位预测。
潮流分析需要tide3.dat文件，数据文件每行格式“yyyymmddhhmm 潮流值 潮流方向”，一个小时一个数据，因此mm为00，潮流方向单位为角度，正北为0度，正东为90度，参照“牛皮礁08010100080033123.txt”。指定分析的测站编号、名称和对应的经纬度位置，调和分析生成_hobart.dat文件，可直接用于潮流预报。
According to the United States and Canada related Fortran program with VC++6.0 rewrite, increases the operation interface and feature enhancement.
In which:
Tidal analysis and prediction of all_con and tconl two directory and the.Par definition file, reference content tide2007.par defined instructions, data file first line indicates that the data starting time " month of the year ", " the first day of the month beginning on line second starts at 0 seconds of the calculation of tidal data ", in reference to tide_2007.txt. Harmonic analysis to generate the corresponding.Hg file storage harmonic parameters, and can be used directly for tide prediction harmonic parameters specified documents and predicting the start and end time of direct tide forecasting.
Trend analysis of tide3.dat file, data file for each row format " yyyymmddhhmm trend value trend ", a data, so the MM is 00, the direction of the trend of units for the angle, 0 degrees east of due north, 90 degrees, with refer (2012-08-24, Visual C++, 270KB, 下载23次)
可实现的算法：软件说明：
1.全主元高斯约当消去法2.LU分解法3.追赶法4.五对角线性方程组解法5.线性方程组解的迭代改善6.范德蒙方程组解法7.托伯利兹方程组解法8.奇异值分解9.线性方程组的共轭梯度法10.对称方程组的乔列斯基分解法11.矩阵的QR分解12.松弛迭代法第2章插值1.拉格朗日插值2.有理函数插值3.三次样条插值4.有序表的检索法5.插值多项式6.二元拉格朗日插值
The algorithm can be realized: Software Description: a full principal component Gauss Jordan elimination 2.LU decomposition method 3 to catch up with France. Five linear equations solution. Linear equations iterative improvement of 6. Vandermonde Equations for 7. Tuobo Leeds equations solution. singular value decomposition of linear equations of the conjugate gradient method 10. the Cholesky decomposition method for symmetric linear matrix of QR decomposition. relaxation iterative method Chapter 2 interpolation Lagrange interpolation. rational function interpolation. retrieval method of cubic spline interpolation. ordered table 5. interpolation polynomial 6 dual Lagrange interpolation (2012-08-20, Visual C++, 1408KB, 下载9次)
自己写了一个二维Euler方程的间断有限元程序
上次发了一个三角形单元的程序 因为不是曲边单元 所以在圆柱后面容易形成涡
现在把程序改为曲边四边形单元了 没有涡出现
单元是8节点四边形单元 节点编号顺序是 1 5 2 6 3 7 4 8 也就是四个角点依次
是1 2 3 4 然后是边的中点编号 5 6 7 8.
时间推进采用 Runge-Kutta 方法
数值通量采用全局Lax-Friedrichs通量
仍然不能捕捉激波 因为没有做重构或者加人工粘性 等这个做出来了 再发一次。
程序没有进行优化 比如说内存的消耗没有优化 比如直边单元的边界积分仍然采
用了曲边的积分方法 增加了计算量 比如面积分、线积分都是采用的是Gauss-
Legendre-Lobatto积分 积分精度会比一般的Gauss-Legendre积分精度低一阶 等
等问题。 二维的 纯属交流性质 就没有考虑这些问题 ^_^
如果物面全部是直边 那么只要改变一个参数N 就可以获得不同的计算精度 且具
有谱精度 因为单元的节点是Gauss-Legendre-Lobatto积分点。 其实就是谱元法
（物面是曲边的情况我不清楚是不是也可以通过提高基函数的阶数 也就是增加N
来提高计算精度）
Wrote a two-dimensional Euler equations with discontinuous finite element program
Last made a triangular element of the program, not curved edge unit is so easy to form a vortex in the cylinder behind the
Program to curved edge quadrilateral element vortices appear
Unit is the order of 8-node quadrilateral element node number is 15,263,748 which is the four corners of the points in turn
Is 1234 and then the side of the midpoint of the number 5678.
Time promote the use of Runge-Kutta method
Numerical flux of the overall situation of Lax-Friedrichs, flux
Still can not capture the shock wave did not do the reconstruction or artificial viscosity do it Zaifayici.
The program is not optimized for example, memory consumption is not optimized such as straight-edge boundary integral of the unit is still mining
Integral method to increase the amount of computation such as surface integral with a curved edge, the line integral using the Gauss-
The Legendr (2012-04-23, Visual C++, 46KB, 下载70次)
高精度算法，属于处理大数字的数学计算方法。在一般的科学计算中,会经常算到小数点后几百位或者更多，当然也可能是几千亿几百亿的大数字。一般这类数字我们统称为高精度数，高精度算法是用计算机对于超大数据的一种模拟加,减,乘,除,乘方,阶乘,开方等运算。对于非常庞大的数字无法在计算机中正常存储，于是，将这个数字拆开，拆成一位一位的，或者是四位四位的存储到一个数组中， 用一个数组去表示一个数字，这样这个数字就被称谓是高精度数。高精度算法就是能处理高精度数各种运算的算法。
High-precision algorithm, are dealing with a large number of mathematical calculations. Scientific computing in general, will always count to hundreds of decimal places or more, of course, may be hundreds of billions of tens of billions of large numbers. General accuracy of these statistics, we referred to as the number of high-precision algorithm is a computer simulation for large data add, subtract, multiply, divide, power, factorial, square root and other operations. For very large numbers can not be properly stored in the computer, so this figure apart, split into a number one, four or four to a storage array, use an array to represent a number, so this was the title is a high-precision digital number. Algorithm is able to handle high-precision accuracy the number of computing algorithms.
(2011-11-01, Visual C++, 6KB, 下载9次)
vc++实现矩阵特征值与特征向量的计算
1约化对称阵为对称三对角阵的豪斯荷尔德变换法
2实对称三角阵全部特征值及特征向量QR法
3约化一般实矩阵为赫申伯格阵的初等相似变换法
4求赫申伯格阵全部特征值QR法
5实对称阵特征值及特征向量雅可比法
6实对称阵特征值及特征向量雅可比过关法
最后注意，在VC++ 6.0中设置好路径，特别是include目录(文件夹)的路径，否则在编译时会出现找不到头文
件的错误，使编译无法正常进行。
vc++ achieve matrix eigenvalue and eigenvector calculation about 1 of symmetric matrix for the symmetric tridiagonal matrix transform the house Herder 2 real symmetric triangular matrix of all eigenvalues and eigenvectors QR law about 3 of a general real matrix for Joseph Berger Shanghai array of primary similar transformation method 4 for Joseph Berger Shanghai array all eigenvalues QR method 5 real symmetric matrix eigenvalue and eigenvector method Jacobian 6 real symmetric matrix eigenvalue and characteristics Vector Jacobian final clearance law note that VC++ 6.0 to set up a good path, in particular, include directory (folder) path, or else there will be at compile time header files can not find the error, so the compiler can not be carried out normally. (2008-12-02, Visual C++, 2456KB, 下载235次)