Scientific-Calculator

能够实现二维边界造波，且自带消波，能够较好地模拟波浪荷载。(with a prgram of eliminating wave,it can be used to achieve boundry wave.)

AHP层次分析法计算判断矩阵的最大特征值,使用高阶累积量对MPSK信号进行调制识别，包括四元数的各种计算。( Calculate the maximum eigenvalue judgment matrix of AHP, Using high-order cumulants of MPSK signal modulation recognition, Including quaternion various calculations.)

说明：  朴素贝叶斯算法，以函数形式实现，花了一个上午的时间(Naive Bayes algorithm, in order to function the form of implementation, a morning flower time)

PLS部分最小二乘工具箱,数值分析的EULER法，matlab编写的元胞自动机。( PLS PLS toolbox, EULER numerical analysis method, matlab prepared cellular automata.)

求解激波管问题等产生的偏微分方程组的各种数值算法。(Shock tube problem solving, such as partial differential equations arising from a variety of numerical algorithm.)

The following is an example of how Microsoft Solver Foundation can be used to solve a constraint satisfaction problem (CSP) like generating a typical Sudoku problem. Sudoku http://www.codeproject.com/Articles/419389/Sudoku-using-Microsoft-solver-foundation In this article I do not attempt to explain everything there is to know about constraint satisfaction problems, but I will go over the concepts in the hope that even if you have never heard of CSP you will still get the idea.

//给定整数n，产生所有[2n]上的匹配（matching） //将其视为一个所有块大小均为2的集合分拆 //以a_i表示其第i个元素所在的集合号 //输出格式为 a1 a2 a3 ... //满足 //a_{i+1} <= max { a1,a2,...a_i } + 1 (//a given integer n, have all [2n] on the matching (matching)// will be considered as an all pieces are two sets of a split// a_i said in its i elements of a collection of lies// output format for a1 a2 a3 ...// meet// a_ i (a))

说明：  PRP共轭梯度法优化计算，采用FORTRAN语言(PRP conjugate gradient method optimization, the use of FORTRAN language)

最好的dijkstra 算法 matlab实现。 可以计算任意两点间的最短距离和路径。 不要参考其他的matlab程序，他们的路径都有问题。(Best Dijkstra algorithm matlab. You can calculate the shortest distance between any two points and path. Do not refer to other matlab program, their path has a problem.)

稀疏矩阵算法及其程序实现(杨绍祺+谈根林)，有解决稀疏矩阵需要的朋友可以好好认真的看一下(Sparse matrix algorithm and program implementation (Yang Shaoqi+ Tan root forest), solve sparse matrix can be a good friend in need a serious look at)