Horner’s Rule Is Optimal for Polynomial Nullity
نویسنده
چکیده
The value VF,n(a0, . . . , an, b) = a0 + a1b+ a2b 2 + · · ·+ anb of a polynomial of degree n ≥ 1 over a field F can be computed by Horner’s rule using no more than nmultiplications in F , and it is optimal (for many fields, including the reals R and the complexes C) for the number of multiplications and/or divisions required, cf. Pan [1966], Winograd [1967, 1970]. We show that Horner’s rule is similarly optimal for polynomial nullity, i.e., the decision problem for the relation NF,n(a0, . . . , an, b) ⇐⇒ a0 + a1b+ a2b + · · ·+ anb = 0. The result holds for all usual computation models and (arguably) for all algorithms which decide NF,n(~a, b) for all ~a, b from the field primitives 0, 1,+,−, ·,÷ and =. §
منابع مشابه
Transformation of Polynomial Evaluation to a Pipeline via Horner's Rule
We apply algebraic transformation techniques to synthesise Horner’s rule for polynomial evaluation. Horner’s rule is then transformed into a pipeline by the application of further axioms. The syntheses demonstrate the power of the algebraic style, in which inductive proof is replaced by constructive unfolding and folding of standard higher-order functions defined on lists.
متن کاملEfficient Polynomial Evaluation Algorithm and Implementation on FPGA
In this thesis, an optimized polynomial evaluation algorithm is presented. Compared to Horner’s Rule which has the least number of computation steps but longest latency, or parallel evaluation methods like Estrin’s method which are fast but with large hardware overhead, the proposed algorithm could achieve high level of parallelism with smallest area, by means of replacing multiplication with s...
متن کاملA Fast Single-Key Two-Level Universal Hash Function
Universal hash functions based on univariate polynomials are well known, e.g. Poly1305 and GHASH. Using Horner’s rule to evaluate such hash functions require ` − 1 field multiplications for hashing a message consisting of ` blocks where each block is one field element. A faster method is based on the class of Bernstein-Rabin-Winograd (BRW) polynomials which require b`/2c multiplications and blg...
متن کاملFurther Results on the Nullity of Signed Graphs
The nullity of a graph is the multiplicity of the eigenvalues zero in its spectrum. A signed graph is a graph with a sign attached to each of its edges. In this paper, we obtain the coefficient theorem of the characteristic polynomial of a signed graph, give two formulae on the nullity of signed graphs with cut-points. As applications of the above results, we investigate the nullity of the bicy...
متن کاملEla Positive Semidefinite Maximum Nullity and Zero Forcing Number
The zero forcing number Z(G) is used to study the minimum rank/maximum nullity of the family of symmetric matrices described by a simple, undirected graph G. The positive semidefinite zero forcing number is a variant of the (standard) zero forcing number, which uses the same definition except with a different color-change rule. The positive semidefinite maximum nullity and zero forcing number f...
متن کامل