zuiyouhua

抛物型方程古典&c-n格式差分算法 dasdsadsadasdsdsadas(Parabolic equations of classical & c-n format dasdsadsadasdsdsadas differential algorithm)

已经调试成功.内含m文件，可直接运行，迭代自组织数据分析，仿真图是速度、距离、幅度三维图像。( Has been successful debugging. M contains files can be directly run, Iterative self-organizing data analysis, FIG simulation speed, distance, amplitude three-dimensional image.)

计算日期时间，可以显示不同颜色，主要用以计算上班日期，换班日期，十分方便。(Daliy Calc)

burgers方程求解，采用fortran编写，有详细的说明，效果非常好(burgers equations, using fortran prepared a detailed description of the effect is very good)

数值计算实例，主要有LU分解，龙格库塔法，高斯分解法，欧拉法，曲线拟合，曲线插值(Numerical example)

此程序是用多重散射理论计算二维声子晶体的结构的Fortran代码。(This program is multi-dimensional phonon scattering calculated crystal structure Fortran code.)

This program is used to find the union, intersection and exclusive OR for given two sorted arrays.

通过标准方法实现结构加速度的线性积分问题(Implementation structure by standard methods of linear integral of acceleration)

求解无约束优化问题 wolfe线性搜索代码(Wolfe line search for unconstrained optimization)

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.