搜索资源列表
PRF
- Polynomial Root Finder is a reliable and fast C program (+ Matlab gateway) for finding all roots of a complex polynomial.
牛顿法解多项式的根
- 牛顿法解多项式的根 包含重根的判断和多项式的输入-Newton method for polynomial root contains heavy-judgment and the importation of polynomials
PolynomialIncludingAllFunctions
- 一元多项式符号计算-含因式分解版 不仅包含+,-,*,/,多项式求值,数值积微分,(内含多项式求根子程序),定与不定积分,还有因式分解(求根法). 用单链表.输入格式按提示.-one yuan polynomial symbolic computation-containing factorization version not only contains ,-,*,/, polynomial evaluation, Numerical plot differential (intron
procedure
- 程序一：用VC++实现图像检索技术。程序二：在 C 源程序中调用 MATLAB 引擎来计算三次多项式的根。程序三：编译原理词法分析器c++源程序。程序四：银行取款机Cash 系统源程序。程序五：ACCESS2000数据库文件密码的提取。-procedure : VC image retrieval technology. Two procedures : the C source Calling MATLAB engine to calculate cubic polynomial root.
rs_decoder_31_19_6.tar
- Hard-decision decoding scheme Codeword length (n) : 31 symbols. Message length (k) : 19 symbols. Error correction capability (t) : 6 symbols One symbol represents 5 bit. Uses GF(2^5) with primitive polynomial p(x) = X^5 X^2 + 1
ROOT_MUSIC_DOA
- 简洁但是经典的Root Music DOA 算法,是用多项式求解的方法来寻找DOA(Direction of Arrival )-simple but classic Root Music DOA algorithm, is the polynomial method to find DOA (Direction of Arrival)
newton_new
- 牛顿法解多项式的根 输入：多项式系数c[]，多项式度数n，求在[a,b]间的根 输出：根 要求保证[a,b]间有根-Newton method for polynomial root input : polynomial coefficients c [], polynomial degree n, for [a, b] the root output :-assurance [a, b] - between
求解方程
- Basic theory: 1. # of roots = highest power 2. All rational roots will be factors of k / factors of a in the general equation of ax^n + bx^(n-1) + ... + cx + k 3. Quadratic formula can solve for irrational / imaginary roots (i dont know cubic /
1002NA
- A polynomial of degree n has the common form as . Your task is to write a function to find a root of a given polynomial in a given interval. Format of function double Polynomial_Root(int n, double c[], double a, double b, double EPS) whe
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
N_COmp
- 数值计算算法，包括： （1）Lagrange插值 （2）Newton 插值 （3）求f(x0)：秦九韶法 （4）求实系数多项式f(z0)。z0为复数（5）二分法求f(x)=0的根 （6）弦截法求f (x)=0的根 （7）求实系数多项式 方程的实根、复根 （8）解线性方程组：Gauss列主元素消去法( 9 )快速弗利叶变换（FFT） -Numerical algorithms, including: (1) Lagrange interpolat
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
jgdhghjd
- DHRT:对分法搜索方程的实根 ATKN：埃特金迭代法求方程的一个实根 NEWT：牛顿迭代法求方程的一个实根 QRRT：QR方法求实系数多项式方程的全部根 NETN：拟牛顿法求非线性方程组的一组实数解-DHRT: method to search for the real roots of equation ATKN: Aitken iterative method for a real roots of equation NEWT: Newton iteration equat
polynomial
- 程序作业源码 读入源文件包含多项式的长度 以及 系数和幅值，然后进行加法运算得到多项式的结果并显示。 p1 p2 为多项式源文件。 Polynomial为算法单元 Term为单个元素的构造类 Main为读入文件并进行运算的主函数 p1 p2 请放于root下 -Read the source file contains the polynomial coefficients and the length and amplitude, then the addition
root-of-polynomial
- program to find root of polynomial
equation-Root
- 提供逆矩阵、多项式的根、一元函数零点等方程求根源码-Provide inverse matrix, polynomial roots, one yuan functions such as zero equation Root Source
4-2-Root-of-a-Polynomial.c
- 牛顿迭代二次 na 1003 Root of a Polynomial-newtown method
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