beam-UEl

说明：  给定求解区间，用最小二乘法给出函数的零点，并给出迭代次数(Given the solution interval, the zeros of the function are given by the least square method, and the number of iterations is given.)

随机森林的代码实现，如何使用学会只用随机森林进行学习(Random forest code implementation, how to use learning to learn only random forest)

用C++编的一些最优化作业中的程序,有Newton法,DFP法,共轭梯度法,单纯形法,内点法,外点法,内外点法,都能使用,我已经全部调试过了(C compile some of the most optimized operating procedures, Newton, DFP, conjugate gradient method, the simplex method, interior point method, the points outside the law, outside point method can use, I have all over Debugging)

copula工具库,包括各种copula函数，及联合分布函数的概率密度函数、分布函数和随机数的生成(copula tool library, including a variety of copula function, and joint distribution function of the probability density function, distribution function and a random number generator)

速度曲线规划，在给定长度path 曲线上，根据各waypoint的速度约束，规划出平滑的速度曲线(speed curve planning.In a given length path curve, according to the speed of the waypoint constraints, planning a smooth speed curve.)

Matlab潮流计算程序可计算任意N节点，带算例，说明十分详细(Matlab flow calculation program can calculate arbitrary N nodes, with examples, very detailed)

恒温减压沸腾UDF,一个基于压力计算的水蒸发UDF程序，请大家探讨一下(boiling udf of costant T and decreasing P)

求概率分布函数的参数方法 采用迭代法估计Beta分布的分布参数，(Estimation of distribution parameters of Beta distribution by iterative method)

对于方程组AX=b，当系数矩阵非奇异时，对原方程进行改写，利用公式X^k=BX^(k+1)+g进行迭代求解。(For equations AX = b, when the coefficient matrix is ​ ​ nonsingular, rewriting the original equation, using the formula X ^ k = BX ^ (k+1)+g for iterative solution.)

弗洛伊德算法最短距离的实现，输入为邻接矩阵，输出为最短距离矩阵。(Freud' s realization of the algorithm for the shortest distance, enter the adjacency matrix output for the shortest distance matrix.)