资源列表
finacial numerical recipes
- 财经类数值算法(finacial numerical recipes),压缩包内有pdf文件和c++源码-Financial category numerical algorithm (Financial numerical recipes), compressed within a pdf file and c-source
Cpp_physics
- c++的数学物理方程数值算法源程序。这是\"Numerical Methods for Physics\"第二版的源程序。-c mathematical physics equations numerical algorithm source. This is the "Numerical Methods for Physics," the second version of the source.
Matlab_physics
- matlab的数学物理方程数值算法源程序。这是\"Numerical Methods for Physics\"第二版的matlab源程序。-Matlab mathematical physics equations numerical algorithm source. This is the "Numerical Methods for Physics," the second version of the Matlab source.
SYSFDFXYCXSJ
- 一些常用的数学数值算法，用C语言编写即可。-some commonly used mathematical algorithm, using C language can be.
Molgedey and Schouster
- The Molgedey and Schuster decorrelation algorithm, having square mixing matrix and no noise . Truncation is used for the time shifted matrix, and it is forced to be symmetric . The delay Tau is estimated . The number of independent components ar
Fit_Circle
- 输入X,Y座标，拟合园，使用最小平方拟合，经本人测试过-importation of X, Y coordinates, fitting Park, using the least square fitting, I tested
用递归解决tsp问题
- TSPTM是一种用于经济模型估算和模拟的完整语言。它是一个用于经济估算的世界标准。虽然TSP主要由经济学家开发并发展,但它的设计并没仅把它限制在经济领域。任何由相同变量的重复观测得到的数据,都可用TSP分析-TSPTM is an economic model for estimation and simulation of a complete language. It is an estimate for the world economy standards. Although the T
公式计算器代码
- 这是一个对数学表达式求值的C++ class，详细的说明在Calculator.pdf中。-this is a mathematical expression evaluates the C class, detailed descr iption of the Calculator.pdf China.
零件切割问题
- 给定一块宽度为W的矩形板，矩形板的高度不受限制。现需要从板上分别切割出n个高度为hi，宽度为wi的矩形零件。切割的规则是零件的高度方向与矩形板的高度方向保持一致。要求求出一种切割法使得所使用的矩形板的高度h最小．用递归及分治法解此问题-given a width of the rectangular plate W, the height of rectangular plate unrestricted. Board is required from the respective cut ou
my0-1knapsack
- 给定n 个物品, 物品i重为wi 并且价值为 vi ，背包所能承载的最大容量为 W. 0-1 背包问题即是选择含有着最大总价值的物品的子集且它的容量 ≤W ． 用动态规划实现-given n goods, items i weight of wi and value of vi, the backpack can carry a maximum capacity of W. 0-1 knapsack problem that is a choice with a maximum tot
验证歌德巴赫猜想
- 验证歌德巴赫猜想（dfoighdafphsdf ）-certification Goldbach conjecture (dfoighdafphsdf)
字符串加密
- 字符串加密技术（hfipusahgn l）-string encryption technology (hfipusahgn l)