Related papers: Constrained polynomial roots and a modulated appro…
A fast and weakly stable method for computing the zeros of a particular class of hypergeometric polynomials is presented. The studied hypergeometric polynomials satisfy a higher order differential equation and generalize Laguerre…
A fundamental problem in numerical analysis and approximation theory is approximating smooth functions by polynomials. A much harder version under recent consideration is to enforce bounds constraints on the approximating polynomial. In…
Let $k$ be a finite field, and $L$ be a $q$-linearized polynomial defined over $k$ of $q$-degree $r$ ($L=\sum^r_{i=0}a_iZ^{q^i}$, with $a_i\in k$). This paper provides an algorithm to compute a characteristic polynomial of $L$ over a large…
Given a zero-dimensional ideal I in a polynomial ring, many computations start by finding univariate polynomials in I. Searching for a univariate polynomial in I is a particular case of considering the minimal polynomial of an element in…
Given a non-hermitean matrix M, the structure of its minimal polynomial encodes whether M is diagonalizable or not. This note will explain how to determine the minimal polynomial of a matrix without going through its characteristic…
To compute solutions of sparse polynomial systems efficiently we have to exploit the structure of their Newton polytopes. While the application of polyhedral methods naturally excludes solutions with zero components, an irreducible…
Recent results of Denisov and Kaluzhny-Shamis describe the absolutely continuous spectrum of Jacobi matrices with coefficients that obey an l^2 bounded variation condition with step p and are asymptotically periodic. We extend these results…
The roots of a smooth curve of hyperbolic polynomials may not in general be parameterized smoothly, even not $C^{1,\alpha}$ for any $\alpha > 0$. A sufficient condition for the existence of a smooth parameterization is that no two of the…
In a recent paper we have shown how to learn controllers for unknown linear systems using finite-sized noisy data by solving linear matrix inequalities. In this note we extend this approach to deal with unknown nonlinear polynomial systems…
In this paper, we investigate condition numbers of eigenvalue problems of matrix polynomials with nonsingular leading coefficients, generalizing classical results of matrix perturbation theory. We provide a relation between the condition…
A great variety of fundamental optimization and counting problems arising in computer science, mathematics and physics can be reduced to one of the following computational tasks involving polynomials and set systems: given an $m$-variate…
We study the onset of spatial instabilities in reaction networks where the spatially homogeneous system admits a steady state parameterization. We formulate a sufficient condition -- based on the signs of the constant and leading…
In this paper we consider images of (ordinary) noncommutative polynomials on matrix algebras endowed with a graded structure. We give necessary and sufficient conditions to verify that some multilinear polynomial is a central polynomial, or…
In polynomial optimization problems, nonnegativity constraints are typically handled using the sum of squares condition. This can be efficiently enforced using semidefinite programming formulations, or as more recently proposed by Papp and…
We consider the problem of computing matrix polynomials $p(X)$, where $X$ is a large dense matrix, with as few matrix-matrix multiplications as possible. More precisely, let $\Pi_{2^{m}}^*$ represent the set of polynomials computable with…
This paper studies the polynomial stabilization of an elastic plate with dynamical boundary conditions on a non-smooth domain. To deal with the possible loss of solution regularity induced by boundary singularities, we formulate the problem…
We introduce the concept of disjunctive sum of squares for certifying nonnegativity of polynomials. Unlike the popular sum of squares approach where nonnegativity is certified by a single algebraic identity, the disjunctive sum of squares…
We show in this paper that after proper scalings, the characteristic polynomial of a random unitary matrix converges almost surely to a random analytic function whose zeros, which are on the real line, form a determinantal point process…
We associate a polynomial to any diagram of unit cells in the first quadrant of the plane using Kohnert's algorithm for moving cells down. In this way, for every weak composition one can choose a cell diagram with corresponding row-counts,…
This paper presents a method to verify closed-loop properties of optimization-based controllers for deterministic and stochastic constrained polynomial discrete-time dynamical systems. The closed-loop properties amenable to the proposed…