Related papers: Exact matrix formula for the unmixed resultant in …
This paper gives an explicit method for computing the resultant of any sparse unmixed bivariate system with given support. We construct square matrices whose determinant is exactly the resultant. The matrices constructed are of hybrid…
It has by now become a standard approach to use the theory of sparse (or toric) elimination, based on the Newton polytope of a polynomial, in order to reveal and exploit the structure of algebraic systems. This talk surveys compact…
In this paper, the concept of sparse difference resultant for a Laurent transformally essential system of difference polynomials is introduced and a simple criterion for the existence of sparse difference resultant is given. The concept of…
The sparse difference resultant introduced in \citep{gao-2015} is a basic concept in difference elimination theory. In this paper, we show that the sparse difference resultant of a generic Laurent transformally essential system can be…
We refine and extend a result by Tuitman on the supports of a Bezout identity satisfied by a finite sequence of sparse Laurent polynomials without common zeroes in the toric variety associated to their supports. When the number of these…
In this paper, we first introduce the concept of Laurent differentially essential systems and give a criterion for Laurent differentially essential systems in terms of their supports. Then the sparse differential resultant for a Laurent…
We present a Poisson formula for sparse resultants and a formula for the product of the roots of a family of Laurent polynomials, which are valid for arbitrary families of supports. To obtain these formulae, we show that the sparse…
Differential resultant formulas are defined, for a system $\mathcal{P}$ of $n$ ordinary Laurent differential polynomials in $n-1$ differential variables. These are determinants of coefficient matrices of an extended system of polynomials…
Let $\cP$ be a system of $n$ linear nonhomogeneous ordinary differential polynomials in a set $U$ of $n-1$ differential indeterminates. Differential resultant formulas are presented to eliminate the differential indeterminates in $U$ from…
In this paper, we present a new formula for the determinant of a $4 \times 4$ matrix. We approach via the sparse optimization problem and derive the formula through the Least Absolute Shrinkage and Selection Operator (LASSO). Our formula…
We present a product formula for the initial parts of the sparse resultant associated to an arbitrary family of supports, generalising a previous result by Sturmfels. This allows to compute the homogeneities and degrees of the sparse…
In this research paper, structured bi-matrix variate, matrix quadratic equations are considered. Some lemmas related to determining the eigenvalues of unknown matrices are proved. Also, a method of determining the diagonalizabe unknown…
Constructive methods for matrices of multihomogeneous (or multigraded) resultants for unmixed systems have been studied by Weyman, Zelevinsky, Sturmfels, Dickenstein and Emiris. We generalize these constructions to mixed systems, whose…
We give a new theoretical tool to solve sparse systems with finitely many solutions. It is based on toric varieties and basic linear algebra; eigenvalues, eigenvectors and coefficient matrices. We adapt Eigenvalue theorem and Eigenvector…
We present a new probabilistic algorithm that characterizes the equidimensional components of the affine algebraic variety defined by an arbitrary sparse polynomial system with prescribed supports. For each equidimensional component, the…
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…
Matrix-valued Cauchy bi-orthogonal polynomials were proposed in this paper, together with its quasideterminant expression. It is shown that the coefficients in four-term recurrence relation for matrix-valued Cauchy bi-orthogonal polynomials…
Effective computation of resultants is a central problem in elimination theory and polynomial system solving. Commonly, we compute the resultant as a quotient of determinants of matrices and we say that there exists a determinantal formula…
In this paper, a new triangular decomposition algorithm is proposed for ordinary differential polynomial systems, which has triple exponential computational complexity. The key idea is to eliminate one algebraic variable from a set of…
We survey and unify recent results on the existence of accurate algorithms for evaluating multivariate polynomials, and more generally for accurate numerical linear algebra with structured matrices. By "accurate" we mean that the computed…