Search - root polynomial

Search - root polynomial - List

[Other] PRF DL : 0: Polynomial Root Finder is a reliable and fast C program (+ Matlab gateway) for finding all roots of a complex polynomial.
Update : 2008-10-13 Size : 31.4kb Publisher : 陈西
[Other resource] 牛顿法解多项式的根 DL : 0: 牛顿法解多项式的根包含重根的判断和多项式的输入-Newton method for polynomial root contains heavy-judgment and the importation of polynomials
Update : 2008-10-13 Size : 8.07kb Publisher : 洋溢
[Other resource] PolynomialIncludingAllFunctions DL : 0: 一元多项式符号计算-含因式分解版不仅包含+,-,*,/,多项式求值,数值积微分,(内含多项式求根子程序),定与不定积分,还有因式分解(求根法). 用单链表.输入格式按提示.-one yuan polynomial symbolic computation-containing factorization version not only contains ,-,*,/, polynomial evaluation, Numerical plot differential (intron polynomial roots subroutine), fixed with indefinite integral, There factorization (Root). single-Chain. by input format suggested.
Update : 2008-10-13 Size : 43.59kb Publisher : shijunhui
[Special Effects] procedure DL : 0: 程序一：用VC++实现图像检索技术。程序二：在 C 源程序中调用 MATLAB 引擎来计算三次多项式的根。程序三：编译原理词法分析器c++源程序。程序四：银行取款机Cash 系统源程序。程序五：ACCESS2000数据库文件密码的提取。-procedure : VC image retrieval technology. Two procedures : the C source Calling MATLAB engine to calculate cubic polynomial root. Procedure 3 : Build principle lexical analyzer c source. Four procedures : Bank teller machines Cash system source code. Five procedures : ACCESS2000 password database file extraction.
Update : 2008-10-13 Size : 12.41kb Publisher : 布布
[Other resource] rs_decoder_31_19_6.tar DL : 0: 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 Generator polynomial, g(x) = a^15 a^21*X + a^6*X^2 + a^15*X^3 + a^25*X^4 + a^17*X^5 + a^18*X^6 + a^30*X^7 + a^20*X^8 + a^23*X^9 + a^27*X^10 + a^24*X^11 + X^12. Note: a = alpha, primitive element in GF(2^5) and a^i is root of g(x) for i = 19, 20, ..., 30. Uses Verilog description with synthesizable RTL modelling. Consists of 5 main blocks: SC (Syndrome Computation), KES (Key Equation Solver), CSEE (Chien Search and Error Evaluator), Controller and FIFO Register. -Hard-decision decoding scheme Codeword l KV (n) : 31 symbols. Message length (k) : 19 symbols. Error correction capability (t) : 6 symbols One symbol represents five bit. Uses GF (2 ^ 5) with primitive polynomial p (x) = x ^ x ^ 5 2 1 Ge nerator polynomial. g (x) = a ^ a ^ 15 * 21 ^ 6 a X * X ^ a ^ 15 2 * X ^ a ^ 3 25 * X ^ a ^ 4 17 5 * X ^ a ^ 18 ^ 6 X * a * X 30 ^ 7 ^ a ^ 20 * X ^ a ^ 23 8 * X ^ a ^ 9 * 27 X 10 ^ a ^ 24 * 11 ^ X ^ X 12. Note : a = alpha, primitive element in GF (2 ^ 5) and a ^ i is the root of g (x) for i = 19, 20, ..., 30. Uses Verilog description with synthesizab le RTL modeling. Consists of five main blocks : SC (Syndrome Computation), KES (Key Equation Solver). CSEE (Chien Search and Error Evaluator) Controller and FIFO Register.
Update : 2008-10-13 Size : 13.91kb Publisher : 孟轲敏
[Other resource] ROOT_MUSIC_DOA DL : 0: 简洁但是经典的Root Music DOA 算法,是用多项式求解的方法来寻找DOA(Direction of Arrival )-simple but classic Root Music DOA algorithm, is the polynomial method to find DOA (Direction of Arrival)
Update : 2008-10-13 Size : 915byte Publisher : Frankie
[Other resource] newton_new DL : 0: 牛顿法解多项式的根输入：多项式系数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
Update : 2008-10-13 Size : 925byte Publisher : 周远
[Other] 求解方程 DL : 0: 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 / quartic formulas) 4. Irrational roots and imaginaries come in pairs (quadratic formula guarantees this) 5. Given polynomial P(x) = ax^n + bx^(n-1) + ... + cx + k and given that q is a root, P(q) = 0
Update : 2009-06-23 Size : 3.61kb Publisher : laoyao922@126.com
[Other] PRF DL : 0: Polynomial Root Finder is a reliable and fast C program (+ Matlab gateway) for finding all roots of a complex polynomial.
Update : 2025-02-19 Size : 31kb Publisher : 陈西
[Algorithm] 牛顿法解多项式的根 DL : 0: 牛顿法解多项式的根包含重根的判断和多项式的输入-Newton method for polynomial root contains heavy-judgment and the importation of polynomials
Update : 2025-02-19 Size : 193kb Publisher : 洋溢
[matlab] ROOT_MUSIC_DOA DL : 0: 简洁但是经典的Root Music DOA 算法,是用多项式求解的方法来寻找DOA(Direction of Arrival )-simple but classic Root Music DOA algorithm, is the polynomial method to find DOA (Direction of Arrival)
Update : 2025-02-19 Size : 1kb Publisher : Frankie
[Data structs] polynomial DL : 0: 我写的多项式操作代码，包括多项式的基本运算，简单求根算法-I write the polynomial operation code, including basic computing polynomial, simple Root Algorithm
Update : 2025-02-19 Size : 10kb Publisher : tony
[Windows Develop] ew DL : 0: for： Root of a Polynomial --- --- --- --- -- Time Limit: 1 Second Memory Limit: 32768 KB -------------------------------------------------------------------------------- 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) where int n is the degree of the polynomial double c[] is an array of n +1 coefficients , , ..., , and of the given polynomial double a and b are the two end-points of the given interval and double EPS is the accuracy of the root. The function must return the root. Note: It is guaranteed that a unique real number r exists in the given interval such that p(r) = 0. -for: Root of a Polynomial---------------------- Time Limit: 1 Second Memory Limit: 32768 KB-------------------------------------------------------------------------------- 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 functiondouble Polynomial_Root (int n, double c [], double a, double b, double EPS) where int n is the degree of the polynomial double c [] is an array of n+ 1 coefficients,, ..., , and of the given polynomial double a and b are the two end-points of the given interval and double EPS is the accuracy of the root.The function must return the root.Note: It is guaranteed that a unique real number r exists in the given interval such that p (r) = 0.
Update : 2025-02-19 Size : 1kb Publisher : Alex Zhang
[Windows Develop] Roots_QR DL : 1: 用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
Update : 2025-02-19 Size : 1kb Publisher : xzz
[JSP/Java] polynomial DL : 0: 程序作业源码读入源文件包含多项式的长度以及系数和幅值，然后进行加法运算得到多项式的结果并显示。 p1 p2 为多项式源文件。 Polynomial为算法单元 Term为单个元素的构造类 Main为读入文件并进行运算的主函数 p1 p2 请放于root下 -Read the source file contains the polynomial coefficients and the length and amplitude, then the addition operation and displays the results obtained polynomial. p1 p2 a polynomial source. Polynomial algorithm unit for the Term structure of classes for the individual elements Main To read the file and the operation of the main function p1 p2 Please put in a root under the
Update : 2025-02-19 Size : 2kb Publisher : lala
[Algorithm] 1002NA DL : 0: 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) where int n is the degree of the polynomial double c[] is an array of n +1 coefficients , , ..., , and of the given polynomial double a and b are the two end-points of the given interval and double EPS is the accuracy of the root. The function must return the root. Note: It is guaranteed that a unique real number r exists in the given interval such that p(r) = 0. -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) where int n is the degree of the polynomial double c[] is an array of n+1 coefficients , , ..., , and of the given polynomial double a and b are the two end-points of the given interval and double EPS is the accuracy of the root. The function must return the root. Note: It is guaranteed that a unique real number r exists in the given interval such that p(r) = 0.
Update : 2025-02-19 Size : 1kb Publisher : suncheng
[Windows Develop] root-of-polynomial DL : 0: program to find root of polynomial
Update : 2025-02-19 Size : 2kb Publisher : the star
[matlab] equation-Root DL : 0: 提供逆矩阵、多项式的根、一元函数零点等方程求根源码-Provide inverse matrix, polynomial roots, one yuan functions such as zero equation Root Source
Update : 2025-02-19 Size : 9kb Publisher : Ivy
[Algorithm] 4-2-Root-of-a-Polynomial.c DL : 0: 牛顿迭代二次 na 1003 Root of a Polynomial-newtown method
Update : 2025-02-19 Size : 1kb Publisher : zhu
[Other] Equation-Root DL : 0: 方程求根 inv - 逆矩阵 roots - 多项式的根 fzero - 一元函数零点 fsolve - 非线性方程组 solve - 符号方程解 *newton - 牛顿迭代法解非线性方程- Equation Root inv- Inverse Matrix roots- roots of the polynomial fzero- One Function Zero fsolve- nonlinear equations solve- Equations symbol * newton- Newton iterative method for solving nonlinear equations
Update : 2025-02-19 Size : 10kb Publisher : lxc

« 12 3 »