计算方法经典算法(弦截法二分法牛顿迭代法龙贝格算法)

fastica C++实现,很简单的,很容易看的 

二维实(复)多项式求值示例-(Minute) polynomial evaluates example

简单的稳定匹配算法实现，无bug Implement Gale-Shapley algorithm of the Stable Matching Problem in your favorite language, and give the matching result of attached ranking data (boys rankings.txt and girls rankings.txt), supposing that the ranking is sorted from high to low. (C++ source file gs make ranking.cc which generates the data is also supplied here.)  

particle filter using c

大地坐标到平面坐标的转换――高斯-格吕特变换-geodetic coordinates to the coordinates of the plane conversion-- Gaussian- Gruetter Transform

并行计算两个矩阵相乘。这个算法是原创的。可以很快实现大型矩阵的相乘。-this is a MPI program that can accompish qucik computation of multiply of two large matrix by parall computation

是CA算法的test程序，用于描述微观枝晶长大的代码！-CA algorithm is the test procedure, used to describe the micro-dendrites grew up in the code!

针对UMH EXGONS算法体现出来的问题利用时间预测向量和空间预测向量的位置映射关系提出了一种新的运动估计算法-，-基于时空预测向量相关性的运动估计算法

一个经典问题的比较好的解决方法-a classic problem of a relatively good solution

素数环： 把从1到10这10个数摆成一个环，要求相邻的两个数的和是一个素数。 〖问题分析〗 这是一道回溯的题目。从1开始，每个空位有9种可能，每种可能加入约束条件即可 1.与前面所有的数不重复 2.与前一个数和为素数（最后一个和第一个也要满足）。 〖算法流程〗 1、数据初始化； 2、递归填数： 判断第J种可能是否合法；  A、如果合法：填数；判断是否到达目标（10个已填完）： 是，打印结果；不是，递归填下一个；  B、如果不合法：选择下一种可能；-Prime Central: 1-10 from 10 the number of put this into a ring, asked the two adjacent numbers and is a prime number. 〗 〖Analysis is a retrospective this topic. From 1 year, 9 out of every space possible, each may be bound by the conditions of accession to 1. And in front of all the number of non-repetition, 2. With a few and for a prime number (the last and the first to meet). 1〗 〖algorithm processes the data to initialize 2, fill in the number of recursion: first to determine the legality of J possible A, if the legitimate: the number of Reclamation to determine whether the target (10 have been completed): Yes, print the results of not, fill in the next recursive B, if not legitimate: a possible alternative