rcs1

几种计算阶乘、阶乘之和的算法，由于计算机存储问题，一般阶乘不可能算得太大，只是一种方法。(Several computing factorial, factorial, and the algorithm, due to computer storage problems, the general factorial can not be considered too great, is only a way.)

平常练习的一些程序，比较基础，包括求斐波那契数、完数等等(Some of the usual practice procedures, more infrastructure, including seeking Fibonacci numbers, number, etc. End)

对于水轮机阀门开启、关闭的一瞬间，对于钢管有比较大的水击。该程序计算出了相对最大的水击压力。(For turbine valves opened, the closure of the moment, for a relatively large pipe water hammer. The program calculated the maximum relative pressure of water hammer.)

处理大规模矩阵，对大规模的矩阵进行分解，即形如分解A=UV(To deal with large-scale matrix, mass matrix decomposition, that is shaped like a decomposition A = UV)

一个通过高斯正反算公式计算高斯投影后投影平面的二维坐标，也可通过坐标反算大地经纬度。提供54系，西安80系，WGS-84系和CGCS2000系四种椭球参数。(A positive and negative Gaussian Formulas to calculate the two-dimensional coordinates of the Gauss projection projection plane can also be computed from coordinates latitude and longitude of the earth. 54 Department of the the Xi' an 80 series, WGS-84 system and CGCS2000 Department of four oval ball parameters.)

用C＋＋实现的高斯混合模型的算法类，方差矩阵是对角矩阵(C++ Gaussian mixture model algorithm category, variance matrix is diagonal matrix)

说明：  使用EPTREE可以很好的对，C,C++，Java代码进行解析。绘出函数树图，计算堆栈大小等。 <输出的文件内容> 功能树 INKURUDOFAIRUTSURI 测量若干步骤（有条件汇编） 函数索引（使用堆栈大小为每个功能输出） 使用类名单 全局变量，变结构，对象名单 ＃定义定义列表 清单中所使用 列表名称 信息分布函数的行数(EPTREE can be used for good, C, C++, Java code analysis. Mapping function tree diagram, calculate the stack size. )

poisson生成器，可以生成泊松分布的随机数，需要的就下载吧(poisson sasadas)

求解四元三次方程组，通过在VC++的编程环境，实现计算的高速运行(Solving four yuan cubic equations by VC++ programming environment, to achieve high-speed operation calculated)

Orthogonal Polynomials Approximation 数值分析，计算正交基多项式的系数 (Given a function f and a set of m >0 distinct points . You are supposed to write a function to approximate f by an orthogonal polynomial using the exact function values at the given m points with a weight assigned to each point . The total error must be no larger than a given tolerance. Format of function int OPA( double (*f)(double t), int m, double x[], double w[], double c[], double*eps ) where the function pointer double (*f)(double t) defines the function f int m is the number of points double x[] contains points double w[] contains the values of a weight function at the given points x[] double c[] contains the coefficients of the approximation polynomial double*eps is passed into the function as the tolerance for the error, and is supposed to be returned as the value of error. The function OPA is supposed to return the degree of the approximation polynomial. Note: a constant Max_n is defined so that if the total error is still not small enough when n = Ma)