pseudo

勒让德-高斯求积法求磁感应强度-Legendre- Gauss quadrature method for magnetic induction

很完美的mapreduce程序开发框架，非常实用！ 让你快速学会编写自己的mapreduce，快速上手！

龙贝格积分-Romberg points

lms最小平方中位数算法，用来解决最小二乘问题-LMS median least squares algorithm, to solve least squares problem

资源描述求两个输入序列的最长的公共子字符串的长度。子字符串中的所有字符在源字符串中必须相邻。 如字符串：21232523311324和字符串312123223445，他们的最长公共子字符串为21232，长度为5。

用牛顿迭代法通过计算方程组，用的是maple编程，方便实用，只需要改动方程组即可所需计算，并且计算精度也可自由控制。。。

应用背景sdsdfasfafad fhshsfhsfhdfhsfhsfhh gasdgsdfsfhsfhs  ； ； ；sfhsfghsfgh  ；sfghsfghsfhsfhgdfhsfhsfhh sfghsfhsfghsfh  ； ； ；sfghsfhsfghsfh sfhsfghsfgh  ； ；sfghsfghsfhsfhg关键技术xfgnnxnnxfgnnxnnxfgn nxnnxfgnnxnnxfgnnxnnxfgnnxnnxfgn xnnxfgnnxnnxfgnnxnnxfgnnxnnxfgnnxnnxf gnnxnnxfgnnxnn  ；xfgnnxnnxfgnnxnn

遗传基因算法源代码-genetic algorithm source code

在电压过零点触发或截至可控硅的导通或闭合；有效通断电压；应用稳定可靠；-Triggering voltage zero-crossing point or at the turn-on SCR or closed the effective on-off voltage application of stable and reliable

平均因子分解法，适用于正定矩阵First, let s recall the definition of the Cholesky decomposition: Given a symmetric positive definite square matrix X, the Cholesky decomposition of X is the factorization X=U U, where U is the square root matrix of X, and satisfies: (1) U U = X (2) U is upper triangular (that is, it has all zeros below the diagonal). It seems that the assumption of positive definiteness is necessary. Actually, it is "positive definite" which guarantees the existence of such kind of decomposition. -Average factor decomposition method applied to positive definite matrix First, let s recall the definition of the Cholesky decomposition: Given a symmetric positive definite square matrix X, the Cholesky decomposition of X is the factorization X = UU, where U is the square root matrix of X, and satisfies: (1) UU = X (2) U is upper triangular (that is, it has all zeros below the diagonal). It seems that the assumption of positive definiteness is necessary. Actually, it is positive