1

比Windows自带的高级一点的计算器，能将整个表达式输入，然后求值。 这个程序要求读者具备编译原理的一些知识。 (Advanced calculator than Windows built, the whole expression input can be then evaluated. This program requires the reader to have some knowledge of compiler theory.)

经典非线性动力学模型，布鲁塞尔子模型，可直接运行，运算效率高。(nonlinear dynamics Brusselator model)

根据输入的长宽，计算Rectangle面积周长等功能，并画出在txt文件中(Rectangle Create a class Rectangle with attributes length and width, each of which defaults to 1 a. Provide member functions that calculate the perimeter and the area of the rectangle. b. Also provide set and get functions for the length and width attributes. The set functions should verify that length and width are each integer numbers larger than 0 and less than 20. c. Write draw function to display the Rectangle: in Assignment1. ) d. Write a driver program to test class Rectangle.)

单纯形法，求解线性规划问题的通用方法。单纯形是美国数学家G.B.丹齐克于1947年首先提出来的。它的理论根据是：线性规划问题的可行域是 n维向量空间Rn中的多面凸集，其最优值如果存在必在该凸集的某顶点处达到。顶点所对应的可行解称为基本可行解。单纯形法的基本思想是：先找出一个基本可行解，对它进行鉴别，看是否是最优解；若不是，则按照一定法则转换到另一改进的基本可行解,再鉴别；若仍不是，则再转换,按此重复进行。因基本可行解的个数有限，故经有限次转换必能得出问题的最优解。如果问题无最优解也可用此法判别。 (Simplex method for the minimum)

潮流计算，IEEE30节点的潮流计算，和牛顿法的程序报告 (power flow)

编写求取下述矩阵四叉树四进制M码和十进制码程序，并将运算结果返回。 1, 1, 1, 1, 2, 2, 3, 3, 1, 1, 1, 1, 2, 2, 3, 3, 1, 1, 1, 1, 4, 4, 5, 5, 1, 1, 1, 1, 4, 4, 5, 5, 6, 6, 7, 8,13,13,14,14, 6, 6, 9,10,13,13,14,14, 11,11,12,12,15,16,19,19, 11,11,12,12,17,18,19,19 (Prepared to strike the following matrix quadtree quaternary M code decimal code and procedures, and the operation result returned. 1, 1, 1, 1, 2, 2, 3, 3, 1, 1, 1, 1, 2, 2, 3, 3, 1, 1, 1, 1, 4, 4, 5, 5, 1, 1, 1, 1, 4, 4, 5, 5, 6, 6, 7, 8,13,13,14,14, 6, 6, 9,10,13,13,14,14, 11, 11, 12,12,15,16,19,19, 11,11,12,12,17,18,19,19)

雅可比迭代（过关法）计算实对称矩阵的特征值和特征向量(Jacobi iteration (immigration law) the calculation of Real Symmetric Matrix Eigenvalues and eigenvectors)

Compute isotherms in quad

本程序是用数学方程试计算出一个点在一条线上的垂线坐标，并判断出在线内外，是测量中用的程序！(The test procedure is used to calculate the mathematical equation of a line a point in the vertical coordinate, and determine the line outside, the procedure used to measure!)

cluster in quest聚类算法是基于密度和网格的聚类算法。对于大型数据库的高维数据聚类集合。(cluster in quest clustering algorithm is based on the density of the grid and clustering algorithm. For large database of high-dimensional data clustering pool.)