Supertropical matrix algebra II: Solving tropical equations
نویسندگان
چکیده
منابع مشابه
Supertropical Matrix Algebra Ii: Solving Tropical Equations Zur Izhakian and Louis Rowen
We continue the study of matrices over a supertropical algebra, proving the existence of a tangible adjoint of A, which provides the unique right (resp. left) quasi-inverse maximal with respect to the right (resp. left) quasi-identity matrix corresponding to A; this provides a unique maximal (tangible) solution to supertropical vector equations, via a version of Cramer’s rule. We also describe ...
متن کاملSupertropical algebra
We develop the algebraic polynomial theory for " supertropical algebra, " as initiated earlier over the real numbers by the first author. The main innovation there was the introduction of ghost elements, which play the key role in our structure theory. Here, we work in a slightly more general situation over an arbitrary semiring, and develop a theory which contains the analogs of the basic theo...
متن کاملTropical Arithmetic and Tropical Matrix Algebra
This paper introduces a new structure of commutative semiring, generalizing the tropical semiring, and having an arithmetic that modifies the standard tropical operations, i.e. summation and maximum. Although our framework is combinatorial, notions of regularity and invertibility arise naturally for matrices over this semiring; we show that a tropical matrix is invertible if and only if it is r...
متن کاملSolving Linear Matrix Equations by Matrix Decompositions
In this paper, a system of linear matrix equations is considered. A new necessary and sufficient condition for the consistency of the equations is derived by means of the generalized singular-value decomposition, and the explicit representation of the general solution is provided. Keywords—Matrix equation, Generalized inverse, Generalized singular-value decomposition.
متن کاملSolving Equations in the Relational Algebra
Enumerating all solutions of a relational algebra equation is a natural and powerful operation which, when added as a query language primitive to the nested relational algebra, yields a query language for nested relational databases, equivalent to the well-known powerset algebra. We study sparse equations, which are equations with at most polynomially many solutions. We look at their complexity...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Israel Journal of Mathematics
سال: 2011
ISSN: 0021-2172,1565-8511
DOI: 10.1007/s11856-011-0133-2