Biot-Savat

素性检测的miller-rabin算法。。。。。(Primality testing)

以前用VB6编写的一个计算器，支持常用的数学函数，支持弧度、角度转换，支持简单的函数作图。(A calculator writen by VB6, supports common mathematical functions, support radian, angle conversion, support simple function mapping.)

根据输入的长宽，计算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.)

弗洛伊德算法最短距离的实现，输入为邻接矩阵，输出为最短距离矩阵。(Freud' s realization of the algorithm for the shortest distance, enter the adjacency matrix output for the shortest distance matrix.)

计算多项流的好程序，简单好用，计算量小。可以较好的模拟二维的两项变化情况(Calculating a number of streams of the program, easy to use, small amount of calculation. Can better simulate the two-dimensional variation)

针对传统的算法如遗传算法、粒子群算法等在TSP问题上求解精确性和求解规模上都还有一定的不足，本文提出了一种基于动态规划思想的粒子群优化算法。该算法用动态规划的方法实现粒子间的信息交互和粒子的进化，并且将粒子群中的粒子按无标度信息指导网络拓扑图的方式进行连接。仿真结果表明该方法能有效地减小误差率，提高解的精确，同时还保持了较低的计算复杂度，具有良好的稳健性。(TSP problem solving for the traditional algorithms such as genetic algorithms, particle swarm optimization accuracy and solving the scale, there is a certain lack of a dynamic programming algorithm-based particle swarm optimization algorithm. The algorithm using dynamic programming method to achieve the evolution of information exchange between the particles and the particles, and particle swarm particle scale-free information guide network topology map to connect. The simulation results show that this method can effectively reduce the error rate and improve the solution precision, while maintaining a low computational complexity, good soundness.)

说明：  用FORTRAN语言实现二维欧拉方程的求解，采用二阶MUSCL迎风格式()

之前找不到合适精度的log2x函数的定点化源码，经过实现并验证后，发上来大家一起学习(fixed version for log2x)

说明：  这是一个ACM试题中的算法，叫分而治之算法，上面有PPT还有实例代码，希望喜欢ACM的同学可以喜欢(This is a Question in the ACM algorithm, called divide and conquer algorithms, there are examples of the code above, there are PPT hope that students like to be like the ACM)

数值计算各算法的程序,包括:牛顿迭代法,超松驰迭代法,微分法等.对于初学数值分析这门课程的人有很大的帮助.(Numerical calculation procedure of the algorithm, including: Newton iteration, ultra-relaxation iteration method, differential method and so on. Beginner numerical analysis for this course were very helpful.)