输入系数和最高阶次，可以求得多项式的根（二分法），dos界面操作-Input factors and the most high-level meeting, you can find the root of polynomial (dichotomy), dos interface operation

C++编程实现的关于广义高斯拉盖尔跟与权重的计算-compute of root of the generalized Laguerre-polynomial and weight

方程求根 inv - 逆矩阵 roots - 多项式的根 fzero - 一元函数零点 fsolve - 非线性方程组 solve - 符号方程解 *newton - 牛顿迭代法解非线性方程- Equation Root inv- Inverse Matrix roots- roots of the polynomial fzero- One Function Zero fsolve- nonlinear equations solve- Equ