搜索资源列表
PRF
- Polynomial Root Finder is a reliable and fast C program (+ Matlab gateway) for finding all roots of a complex polynomial.
ew
- for： Root of a Polynomial --- --- --- --- -- Time Limit: 1 Second Memory Limit: 32768 KB -------------------------------------------------------------------------------- A polynomial of degree n has the common form as . Your ta
Roots_QR
- 用QR算法求多项式方程f(x)=x^n+a(1)*x^(n-1)+...+a(n-1)*x+a(n)=0的所有根-QR algorithm used for polynomial equation f (x) = x ^ n+ A (1)* x ^ (n-1)+ ...+ A (n-1)* x+ A (n) = 0 for all root
duoxiangshi
- 输入系数和最高阶次，可以求得多项式的根（二分法），dos界面操作-Input factors and the most high-level meeting, you can find the root of polynomial (dichotomy), dos interface operation
CXroot
- 求多项式方程的根，数值迭代，n次多项式-Polynomial equation for the root
root-of-polynomial
- program to find root of polynomial
Bisection-Method
- this a c sharp program called bisection method. this application will help you to determine the root of a polynomial.-this is a c sharp program called bisection method. this application will help you to determine the root of a polynomial.
Dome
- 1.采用链式结构实现任意多项式的存储，求两个多项式的和。 2.假设自上而下按层次，自左至右输入每个结点的一个三元组(D, P, L/R)。其中D为本结点的元素，P为其父结点，L指示D为P 的左孩子，R指示D为P的右孩子。试写一个建立二叉树在内存的双链表示算法，并实现先根、中根、后根以及层序遍历算法。 3.采用邻接矩阵实现有向网的存储，建立有向网，并实现单源最短路径算法。-1 using an arbitrary polynomial chain structure of storag
lge_finish
- C++编程实现的关于广义高斯拉盖尔跟与权重的计算-compute of root of the generalized Laguerre-polynomial and weight
Equation-Root
- 方程求根 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