相关论文: Toric Generalized Characteristic Polynomials

A relaxation method based on border basis reduction which improves the efficiency of Lasserre's approach is proposed to compute the optimum of a polynomial function on a basic closed semi algebraic set. A new stopping criterion is given to…

We propose a new approximate factorization for solving linear systems with symmetric positive definite sparse matrices. In a nutshell the algorithm is to apply hierarchically block Gaussian elimination and additionally compress the fill-in.…

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…

Gr{\"o}bner bases is one the most powerful tools in algorithmic non-linear algebra. Their computation is an intrinsically hard problem with a complexity at least single exponential in the number of variables. However, in most of the cases,…

We show that, for a system of univariate polynomials given in sparse encoding, we can compute a single polynomial defining the same zero set, in time quasi-linear in the logarithm of the degree. In particular, it is possible to determine…

We consider constrained optimization problems defined in the tropical algebra setting on a linearly ordered, algebraically complete (radicable) idempotent semifield (a semiring with idempotent addition and invertible multiplication). The…

We use residue currents on toric varieties to obtain bounds on the degrees of solutions to polynomial ideal membership problems. Our bounds depend on (the volume of) the Newton polytope of the polynomial system and are therefore well…

Polynomial algebra offers a standard approach to handle several problems in geometric modeling. A key tool is the discriminant of a univariate polynomial, or of a well-constrained system of polynomial equations, which expresses the…

It is common in stability analysis to linearize a system and investigate the spectrum of the Jacobian matrix. This approach faces the challenge of determining the matrix spectrum when the coefficients depend on parameters or when the…

We study the problem of minimizing a multivariate polynomial function over the unit hypercube. By representing the polynomial through a hypergraph and exploiting its sparsity structure, we establish a new sufficient condition under which…

Presented in this paper is a new sparse linear solver methodology motivated by multigrid principles and based around general local transformations that diagonalize a matrix while maintaining its sparsity. These transformations are…

We prove a theorem on algebraic osculation and we apply our result to the Computer Algebra problem of polynomial factorization. We consider X a smooth completion of the complex plane and D an effective divisor supported on the boundary of…

This paper investigates the cost of solving systems of sparse polynomial equations by homotopy continuation. First, a space of systems of $n$-variate polynomial equations is specified through $n$ monomial bases. The natural locus for the…

We present an exact and complete algorithm to isolate the real solutions of a zero-dimensional bivariate polynomial system. The proposed algorithm constitutes an elimination method which improves upon existing approaches in a number of…

The real solutions to a system of sparse polynomial equations may be realized as a fiber of a projection map from a toric variety. When the toric variety is orientable, the degree of this map is a lower bound for the number of real…

Amendola et al. proposed a method for solving systems of polynomial equations lying in a family which exploits a recursive decomposition into smaller systems. A family of systems admits such a decomposition if and only if the corresponding…

In this paper, we explain a new Iterative Method-Fixed Point and develop its convergence theory for finding approximate solutions of nonlinear equations in the setting of Banach spaces. First, we discuss the convergence analysis of our…

We develop a new tool, namely polynomial and linear algebraic methods, for studying systems of word equations. We illustrate its usefulness by giving essentially simpler proofs of several hard problems. At the same time we prove extensions…

We present a bounded probability algorithm for the computation of the Chow forms of the equidimensional components of an algebraic variety. Its complexity is polynomial in the length and in the geometric degree of the input equation system…

We propose a new algorithm to solve sparse linear systems of equations over the integers. This algorithm is based on a $p$-adic lifting technique combined with the use of block matrices with structured blocks. It achieves a sub-cubic…