Description: Polynomial Root Finder is a reliable and fast C program (+ Matlab gateway) for finding all roots of a complex polynomial. Platform: |
Size: 32153 |
Author:陈西 |
Hits:
Description: 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. Platform: |
Size: 14247 |
Author:孟轲敏 |
Hits:
Description: 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 Platform: |
Size: 3697 |
Author:laoyao922@126.com |
Hits:
Description: Polynomial Root Finder is a reliable and fast C program (+ Matlab gateway) for finding all roots of a complex polynomial. Platform: |
Size: 31744 |
Author:陈西 |
Hits:
Description: 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. Platform: |
Size: 14336 |
Author:许茹芸 |
Hits:
Description: 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. Platform: |
Size: 1024 |
Author:Alex Zhang |
Hits:
Description: The combinatorial core of the OVSF code assignment problem
that arises in UMTS is to assign some nodes of a complete binary
tree of height h (the code tree) to n simultaneous connections, such that
no two assigned nodes (codes) are on the same root-to-leaf path. Each
connection requires a code on a specified level. The code can change over
time as long as it is still on the same level. We consider the one-step code
assignment problem: Given an assignment, move the minimum number of
codes to serve a new request. Minn and Siu proposed the so-called DCAalgorithm
to solve the problem optimally. We show that DCA does not
always return an optimal solution, and that the problem is NP-hard.
We give an exact nO(h)-time algorithm, and a polynomial time greedy
algorithm that achieves approximation ratio Θ(h). Finally, we consider
the online code assignment problem for which we derive several results-The combinatorial core of the OVSF code assignment problemthat arises in UMTS is to assign some nodes of a complete binarytree of height h (the code tree) to n simultaneous connections, such thatno two assigned nodes (codes) are on the same root-to- leaf path. Eachconnection requires a code on a specified level. The code can change overtime as long as it is still on the same level. We consider the one-step codeassignment problem: Given an assignment, move the minimum number ofcodes to serve a new request. Minn and Siu proposed the so-called DCAalgorithmto solve the problem optimally. We show that DCA does notalways return an optimal solution, and that the problem is NP-hard.We give an exact nO (h)-time algorithm, and a polynomial time greedyalgorithm that achieves approximation ratio Θ (h). Finally, we considerthe online code assignment problem for which we derive several results Platform: |
Size: 157696 |
Author:shilei |
Hits:
Description: 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 equation for the real roots of a QRRT: QR method realistic coefficient of polynomial equation root of all the NETN : quasi-Newton method for nonlinear equations of a set of real solutions Platform: |
Size: 4096 |
Author:万相友 |
Hits:
Description: 程序作业源码
读入源文件包含多项式的长度 以及 系数和幅值，然后进行加法运算得到多项式的结果并显示。
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 Platform: |
Size: 2048 |
Author:lala |
Hits:
Description: 通过求矩阵特征多项式的根来求其特征值
幂法求矩阵的主特征值及主特征向量
瑞利商加速幂法求对称矩阵的主特征值及主特征向量
收缩法求矩阵全部特征值
收缩法求矩阵全部特征值
位移逆幂法求矩阵离某个常数最近的特征值及其对应的特征向量
QR基本算法求矩阵全部特征值
-Characteristic polynomial by the root of a matrix to find the eigenvalues of a matrix power method and the main characteristics of the main features of the value of acceleration power vector Rayleigh quotient method Symmetric Matrix Eigenvalue and the main characteristics of the main vector of contraction method to shrink the value of all the characteristics of a matrix Law of the value of all the characteristics of a matrix inverse power law shift away from a constant of a matrix eigenvalue recently and its corresponding eigenvector matrix QR algorithm for getting all the characteristics of the basic values Platform: |
Size: 3072 |
Author:chris_zhou |
Hits:
Description: 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. Platform: |
Size: 1024 |
Author:suncheng |
Hits:
Description: 简洁但是经典的Root Music DOA 算法，是用多项式求解解的方法来寻找DOA(Direction of Arrival )
-The simple but classic Root Music of DOA algorithm is a polynomial solution method to find the DOA (the Direction of Arrival) Platform: |
Size: 1024 |
Author:面积 |
Hits:
Description: 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. Platform: |
Size: 1276928 |
Author:cat |
Hits:
Description: 1.采用链式结构实现任意多项式的存储，求两个多项式的和。
2.假设自上而下按层次，自左至右输入每个结点的一个三元组(D, P, L/R)。其中D为本结点的元素，P为其父结点，L指示D为P 的左孩子，R指示D为P的右孩子。试写一个建立二叉树在内存的双链表示算法，并实现先根、中根、后根以及层序遍历算法。
3.采用邻接矩阵实现有向网的存储，建立有向网，并实现单源最短路径算法。-1 using an arbitrary polynomial chain structure of storage, and the sum of two polynomials. 2 Assuming a hierarchical top-down, from left to right input of each node a triple (D, P, L/R). Where D is an element node, P is the parent node, L indicates D is the left child of P, R indicates D is P' s right child. Try to write a binary tree in memory to establish a double-stranded representation algorithm and achieve first root, the root, root, and layer after traversal algorithms. 3 using adjacency matrix used to achieve network storage, to establish a network and to achieve single-source shortest path algorithm. Platform: |
Size: 7168 |
Author:白杨 |
Hits:
Description: 利用计算机方法解决数学问题，包括求方程的根，求插值多项式-The method of using a computer to solve math problems, including seeking the root of the equation, polynomial interpolation seeking Platform: |
Size: 448512 |
Author: |
Hits:
Description: SURROGATES工具箱是一个多维函数逼近和优化方法的通用MATLAB库。当前版本包括以下功能：
实验设计：中心复合设计，全因子设计，拉丁超立方体设计，D-optimal和maxmin设计。
代理：克里金法，多项式响应面，径向基神经网络和支持向量回归。
错误和交叉验证的分析：留一法和k折交叉验证，以及经典的错误分析（确定系数，标准误差;均方根误差等;）。
基于代理的优化：高效的全局优化（EGO）算法。
其他能力：通过安全裕度进行全局敏感性分析和保守替代。(SURROGATES Toolbox is a general-purpose MATLAB library of multidimensional function approximation and optimization methods. The current version includes the following capabilities:
Design of experiments: central composite design, full factorial design, Latin hypercube design, D-optimal and maxmin designs.
Surrogates: kriging, polynomial response surface, radial basis neural network, and support vector regression.
Analysis of error and cross validation: leave-one-out and k-fold cross-validation, and classical error analysis (coefficient of determination, standard error; root mean square error; and others).
Surrogate-based optimization: efficient global optimization (EGO) algorithm.
Other capabilities: global sensitivity analysis and conservative surrogates via safety margin.) Platform: |
Size: 362496 |
Author:pluto1888 |
Hits:
Search - Root of a Polynomial