Related papers: Roots multiplicity without companion matrices
We prove a detailed sums of squares formula for two variable polynomials with no zeros on the bidisk $\mathbb{D}^2$ extending previous versions of such a formula due to Cole-Wermer and Geronimo-Woerdeman. The formula is related to the…
In the computation of Feynman integrals which evaluate to multiple polylogarithms one encounters quite often square roots. To express the Feynman integral in terms of multiple polylogarithms, one seeks a transformation of variables, which…
We show how to construct highly symmetric algorithms for matrix multiplication. In particular, we consider algorithms which decompose the matrix multiplication tensor into a sum of rank-1 tensors, where the decomposition itself consists of…
Let $F(z)$ be an arbitrary complex polynomial. We introduce the local root clustering problem, to compute a set of natural $\varepsilon$-clusters of roots of $F(z)$ in some box region $B_0$ in the complex plane. This may be viewed as an…
In this work, Some new inequalities for the numerical radius of block $n$-by-$n$ matrices are presented. As an application, bounding of zeros of polynomials using the Frobenius companion matrix partitioned by the Cartesian decomposition…
The purpose of this paper is to present three new methods for finding all simple zeros of polynomials simultaneously. First, we give a new method for finding simultaneously all simple zeros of polynomials constructed by applying the…
Craig interpolation has become a versatile algorithmic tool for improving software verification. Interpolants can, for instance, accelerate the convergence of fixpoint computations for infinite-state systems. They also help improve the…
In this paper we factorize matrix polynomials into a complete set of spectral factors using a new design algorithm and we provide a complete set of block roots (solvents). The procedure is an extension of the (scalar) Horner method for the…
With this paper we present an extension of our recent ISSAC paper about computations of Groebner(-Shirshov) bases over free associative algebras Z<X>. We present all the needed proofs in details, add a part on the direct treatment of the…
In a recent paper Lima, Panario and Wang have provided a new method to multiply polynomials in Chebyshev basis which aims at reducing the total number of multiplication when polynomials have small degree. Their idea is to use Karatsuba's…
This work is divided into three parts. The first part concerns polynomials in one variable with all real roots. We consider linear transformations that preserve real rootedness, as well as matrices that preserve interlacing. The second part…
A novel very simple method for finding roots of polynomials over finite fields has been proposed. The essence of the proposed method is to search the roots via nested cycles over the subgroups of the multiplicative group of the Galois…
We propose an improved algorithm for finding roots of polynomials over finite fields. This makes possible significant speedup of the decoding process of Bose-Chaudhuri-Hocquenghem, Reed-Solomon, and some other error-correcting codes.
Consider a system F of n polynomial equations in n unknowns, over an algebraically closed field of arbitrary characteristic. We present a fast method to find a point in every irreducible component of the zero set Z of F. Our techniques…
We consider the problem of interpolating a sparse multivariate polynomial over a finite field, represented with a black box. Building on the algorithm of Ben-Or and Tiwari for interpolating polynomials over rings with characteristic zero,…
For an efficient implementation of Buchberger's Algorithm, it is essential to avoid the treatment of as many unnecessary critical pairs or obstructions as possible. In the case of the commutative polynomial ring, this is achieved by the…
We reconsider the theory of Lagrange interpolation polynomials with multiple interpolation points and apply it to linear algebra. For instance, $A$ be a linear operator satisfying a degree $n$ polynomial equation $P(A)=0$. One can see that…
Until recently, the only known method of finding the roots of polynomials over prime power rings, other than fields, was brute force. One reason for this is the lack of a division algorithm, obstructing the use of greatest common divisors.…
This paper considers fast algorithms for operations on linearized polynomials. We propose a new multiplication algorithm for skew polynomials (a generalization of linearized polynomials) which has sub-quadratic complexity in the polynomial…
The use of interpolants in model checking is becoming an enabling technology to allow fast and robust verification of hardware and software. The application of encodings based on the theory of arrays, however, is limited by the…