Related papers: Real Zero Polynomials and A. Horn's Problem

We present fully polynomial-time (deterministic or randomised) approximation schemes for Holant problems, defined by a non-negative constraint function satisfying a generalised second order recurrence modulo a couple of exceptional cases.…

We present algorithmic and complexity results concerning computations with one and two real algebraic numbers, as well as real solving of univariate polynomials and bivariate polynomial systems with integer coefficients using Sturm-Habicht…

A unified theory of orthogonal polynomials of a discrete variable is presented through the eigenvalue problem of hermitian matrices of finite or infinite dimensions. It can be considered as a matrix version of exactly solvable Schr\"odinger…

We describe algorithms for computing eigenpairs (eigenvalue-eigenvector pairs) of a complex $n\times n$ matrix $A$. These algorithms are numerically stable, strongly accurate, and theoretically efficient (i.e., polynomial-time). We do not…

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…

We consider a family of pairs of m-by-p and m-by-q matrices, in which some entries are required to be zero and the others are arbitrary, with respect to transformations (A,B)--> (SAR,SBL) with nonsingular S, R, L. We prove that almost all…

Inverse eigenvalue and singular value problems have been widely discussed for decades. The well-known result is the Weyl-Horn condition, which presents the relations between the eigenvalues and singular values of an arbitrary matrix. This…

We propose a new approach to the combinatorial interpretations of linearization coefficient problem of orthogonal polynomials. We first establish a difference system and then solve it combinatorially and analytically using the method of…

A zero-dimensional polynomial ideal may have a lot of complex zeros. But sometimes, only some of them are needed. In this paper, for a zero-dimensional ideal $I$, we study its complex zeros that locate in another variety $\textbf{V}(J)$…

The objective of the matrix selection problem is to select a submatrix $A_{S}\in \mathbb{R}^{n\times k}$ from $A\in \mathbb{R}^{n\times m}$ such that its minimum singular value is maximized. In this paper, we employ the interlacing…

In this paper we study unimodality problems for the independence polynomial of a graph, including unimodality, log-concavity and reality of zeros. We establish recurrence relations and give factorizations of independence polynomials for…

Motivated by Wilmshurst's conjecture, we investigate the zeros of harmonic polynomials. We utilize a certified counting approach which is a combination of two methods from numerical algebraic geometry: numerical polynomial homotopy…

We discuss the zero sets of two-variable polynomials as they relate to an approximation problem in the Hardy space on the bidisk.

In the space of holomorphic functions in a convex domain it is studied the interpolation problem by means of sums of the series of exponentials converging uniformly on all compact sets of the domain. The discrete set of the interpolation…

This work concerns the distance in 2-norm from a matrix polynomial to a nearest polynomial with a specified number of its eigenvalues at specified locations in the complex plane. Perturbations are allowed only on the constant coefficient…

For any real numbers $b,c\in\mathbb{R}$, we form the sequence of polynomials $\left\{ H_{m}(z)\right\} _{m=0}^{\infty}$ satisfying the four-term recurrence \[ H_{m}(z)+cH_{m-1}(z)+bH_{m-2}(z)+zH_{m-3}(z)=0,\qquad m\ge3, \] with the initial…

We design a homotopy continuation algorithm, that is based on numerically tracking Viro's patchworking method, for finding real zeros of sparse polynomial systems. The algorithm is targeted for polynomial systems with coefficients…

Univariate polynomial root-finding is both classical and important for modern computing. Frequently one seeks just the real roots of a polynomial with real coefficients. They can be approximated at a low computational cost if the polynomial…

A linear operator on a finite dimensional nonzero real vector space may not have an eigenvalue. We define a related notion of a true-pair of a linear operator, and then show that each linear operator on a finite dimensional nonzero real…

Automatically verifying safety properties of programs is hard, and it is even harder if the program acts upon arrays or other forms of maps. Many approaches exist for verifying programs operating upon Boolean and integer values (e.g.…