21 research outputs found
A Spectral Theory for Tensors
In this paper we propose a general spectral theory for tensors. Our proposed
factorization decomposes a tensor into a product of orthogonal and scaling
tensors. At the same time, our factorization yields an expansion of a tensor as
a summation of outer products of lower order tensors . Our proposed
factorization shows the relationship between the eigen-objects and the
generalised characteristic polynomials. Our framework is based on a consistent
multilinear algebra which explains how to generalise the notion of matrix
hermicity, matrix transpose, and most importantly the notion of orthogonality.
Our proposed factorization for a tensor in terms of lower order tensors can be
recursively applied so as to naturally induces a spectral hierarchy for
tensors.Comment: The paper is an updated version of an earlier versio
Toric Generalized Characteristic Polynomials
We illustrate an efficient new method for handling polynomial systems with
degenerate solution sets. In particular, a corollary of our techniques is a new
algorithm to find an isolated point in every excess component of the zero set
(over an algebraically closed field) of any by system of polynomial
equations. Since we use the sparse resultant, we thus obtain complexity bounds
(for converting any input polynomial system into a multilinear factorization
problem) which are close to cubic in the degree of the underlying variety --
significantly better than previous bounds which were pseudo-polynomial in the
classical B\'ezout bound. By carefully taking into account the underlying toric
geometry, we are also able to improve the reliability of certain sparse
resultant based algorithms for polynomial system solving
Irredundant Triangular Decomposition
Triangular decomposition is a classic, widely used and well-developed way to
represent algebraic varieties with many applications. In particular, there
exist sharp degree bounds for a single triangular set in terms of intrinsic
data of the variety it represents, and powerful randomized algorithms for
computing triangular decompositions using Hensel lifting in the
zero-dimensional case and for irreducible varieties. However, in the general
case, most of the algorithms computing triangular decompositions produce
embedded components, which makes it impossible to directly apply the intrinsic
degree bounds. This, in turn, is an obstacle for efficiently applying Hensel
lifting due to the higher degrees of the output polynomials and the lower
probability of success. In this paper, we give an algorithm to compute an
irredundant triangular decomposition of an arbitrary algebraic set defined
by a set of polynomials in C[x_1, x_2, ..., x_n]. Using this irredundant
triangular decomposition, we were able to give intrinsic degree bounds for the
polynomials appearing in the triangular sets and apply Hensel lifting
techniques. Our decomposition algorithm is randomized, and we analyze the
probability of success
Subresultants in Multiple Roots
We extend our previous work on Poisson-like formulas for subresultants in
roots to the case of polynomials with multiple roots in both the univariate and
multivariate case, and also explore some closed formulas in roots for
univariate polynomials in this multiple roots setting.Comment: 21 pages, latex file. Revised version accepted for publication in
Linear Algebra and its Application
On the Complexity of Solving Zero-Dimensional Polynomial Systems via Projection
Given a zero-dimensional polynomial system consisting of n integer
polynomials in n variables, we propose a certified and complete method to
compute all complex solutions of the system as well as a corresponding
separating linear form l with coefficients of small bit size. For computing l,
we need to project the solutions into one dimension along O(n) distinct
directions but no further algebraic manipulations. The solutions are then
directly reconstructed from the considered projections. The first step is
deterministic, whereas the second step uses randomization, thus being
Las-Vegas.
The theoretical analysis of our approach shows that the overall cost for the
two problems considered above is dominated by the cost of carrying out the
projections. We also give bounds on the bit complexity of our algorithms that
are exclusively stated in terms of the number of variables, the total degree
and the bitsize of the input polynomials
Explicit formulas for the multivariate resultant
We present formulas for the homogenous multivariate resultant as a quotient
of two determinants. They extend classical Macaulay formulas, and involve
matrices of considerably smaller size, whose non zero entries include
coefficients of the given polynomials and coefficients of their Bezoutian.
These formulas can also be viewed as an explicit computation of the morphisms
and the determinant of a resultant complex.Comment: 30 pages, Late
Solving Degenerate Sparse Polynomial Systems Faster
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 allow us to sharpen and lower prior complexity bounds for this
problem by fully taking into account the monomial term structure. As a
corollary of our development we also obtain new explicit formulae for the exact
number of isolated roots of F and the intersection multiplicity of the
positive-dimensional part of Z. Finally, we present a combinatorial
construction of non-degenerate polynomial systems, with specified monomial term
structure and maximally many isolated roots, which may be of independent
interest.Comment: This is the final journal version of math.AG/9702222 (``Toric
Generalized Characteristic Polynomials''). This final version is a major
revision with several new theorems, examples, and references. The prior
results are also significantly improve
Exact Algorithms for Solving Stochastic Games
Shapley's discounted stochastic games, Everett's recursive games and
Gillette's undiscounted stochastic games are classical models of game theory
describing two-player zero-sum games of potentially infinite duration. We
describe algorithms for exactly solving these games