Results 1  10
of
77
Numerical computation of spectral elements in maxplus algebra
, 1998
"... We describe the specialization to maxplus algebra of Howard’s policy improvement scheme, which yields an algorithm to compute the solutions of spectral problems in the maxplus semiring. Experimentally, the algorithm shows a remarkable (almost linear) average execution time. ..."
Abstract

Cited by 41 (5 self)
 Add to MetaCart
We describe the specialization to maxplus algebra of Howard’s policy improvement scheme, which yields an algorithm to compute the solutions of spectral problems in the maxplus semiring. Experimentally, the algorithm shows a remarkable (almost linear) average execution time.
Duality and separation theorems in idempotent semimodules
 Linear Algebra and its Applications 379 (2004), 395–422. Also arXiv:math.FA/0212294
"... Abstract. We consider subsemimodules and convex subsets of semimodules over semirings with an idempotent addition. We introduce a nonlinear projection on subsemimodules: the projection of a point is the maximal approximation from below of the point in the subsemimodule. We use this projection to sep ..."
Abstract

Cited by 35 (19 self)
 Add to MetaCart
(Show Context)
Abstract. We consider subsemimodules and convex subsets of semimodules over semirings with an idempotent addition. We introduce a nonlinear projection on subsemimodules: the projection of a point is the maximal approximation from below of the point in the subsemimodule. We use this projection to separate a point from a convex set. We also show that the projection minimizes the analogue of Hilbert’s projective metric. We develop more generally a theory of dual pairs for idempotent semimodules. We obtain as a corollary duality results between the row and column spaces of matrices with entries in idempotent semirings. We illustrate the results by showing polyhedra and halfspaces over the maxplus semiring. 1.
The PerronFrobenius theorem for homogeneous monotone functions
 Transacton of AMS
, 2004
"... Abstract. If A is a nonnegative matrix whose associated directed graph is strongly connected, the PerronFrobenius theorem asserts that A has an eigenvector in the positive cone, (R+) n. We associate a directed graph to any homogeneous, monotone function, f:(R+) n → (R+) n, and show that if the grap ..."
Abstract

Cited by 24 (6 self)
 Add to MetaCart
(Show Context)
Abstract. If A is a nonnegative matrix whose associated directed graph is strongly connected, the PerronFrobenius theorem asserts that A has an eigenvector in the positive cone, (R+) n. We associate a directed graph to any homogeneous, monotone function, f:(R+) n → (R+) n, and show that if the graph is strongly connected, then f has a (nonlinear) eigenvector in (R+) n. Several results in the literature emerge as corollaries. Our methods show that the PerronFrobenius theorem is “really ” about the boundedness of invariant subsets in the Hilbert projective metric. They lead to further existence results and open problems.
A spectral theorem for convex monotone homogeneous maps
 In Proceedings of the Satellite Workshop on MaxPlus Algebras, IFAC SSSC’01
, 2001
"... Abstract. We consider convex maps f: R n → R n that are monotone (i.e., that preserve the product ordering of R n), and nonexpansive for the supnorm. This includes convex monotone maps that are additively homogeneous (i.e., that commute with the addition of constants). We show that the fixed point ..."
Abstract

Cited by 18 (9 self)
 Add to MetaCart
(Show Context)
Abstract. We consider convex maps f: R n → R n that are monotone (i.e., that preserve the product ordering of R n), and nonexpansive for the supnorm. This includes convex monotone maps that are additively homogeneous (i.e., that commute with the addition of constants). We show that the fixed point set of f, when it is nonempty, is isomorphic to a convex infsubsemilattice of R n, whose dimension is at most equal to the number of strongly connected components of a critical graph defined from the tangent affine maps of f. This yields in particular an uniqueness result for the bias vector of ergodic control problems. This generalizes results obtained previously by Lanery, Romanovsky, and Schweitzer and Federgruen, for ergodic control problems with finite state and action spaces, which correspond to the special case of piecewise affine maps f. We also show that the length of periodic orbits of f is bounded by the cyclicity of its critical graph, which implies that the possible orbit lengths of f are exactly the orders of elements of the symmetric group
Linear functionals on idempotent spaces: An algebraic approach // Doklady Akademii 7
 V. 363. — P. 298–300 (in Russian). English translation in: Doklady Mathematics
, 1998
"... In this paper, we present an algebraic approach to idempotent functional analysis, which is an abstract version of idempotent analysis in the sense of [1–3]. Elements of such an approach were used, for example, in [1, 4]. The basic concepts and results are expressed in purely algebraic terms. We con ..."
Abstract

Cited by 15 (7 self)
 Add to MetaCart
In this paper, we present an algebraic approach to idempotent functional analysis, which is an abstract version of idempotent analysis in the sense of [1–3]. Elements of such an approach were used, for example, in [1, 4]. The basic concepts and results are expressed in purely algebraic terms. We consider idempotent versions of certain basic results of linear functional analysis, including the theorem on the general form of a linear functional and the Hahn–Banach and Riesz–Fischer theorems. 1. Recall that an additive semigroup S with commutative addition ⊕ is called an idempotent semigroup (IS) if the relation x ⊕ x = x is fulfilled for all elements x ∈ S. If S contains a neutral element, this element is denoted by the symbol 0. Any IS is a partially ordered set with respect to the following standard order: x ≼ y if and only if x ⊕ y = y. It is obvious that this order is well defined and x ⊕ y = sup{x, y}. Thus, any IS is an upper semilattice; moreover, the concepts of IS and upper semilattice coincide [5]. An idempotent semigroup S is called acomplete (or algebraically complete) if it is complete as an ordered set, i.e., if any subset X in S has the least upper bound sup(X) denoted by ⊕X and the greatest lower bound inf(X) denoted by ∧X. This semigroup is called bcomplete (or boundedly complete), if any bounded above subset X of this semigroup (including the empty subset) has the least upper bound ⊕X (in this case, any nonempty subset Y in S has the greatest lower bound ∧Y and S in a lattice). Note that any acomplete or bcomplete IS has the zero element 0 that coincides with ⊕Ø, where Ø is the empty set. Certainly, acompleteness implies the bcompleteness. Completion by means of cuts [5] yields an embedding S → ̂ S of an arbitrary IS S into an acomplete IS ̂ S (which is called a normal completion 1 International Sophus Lie Centre, Moscow, Russia,
Minplus methods in eigenvalue perturbation theory and generalised LidskiiVishikLjusternik theorem
, 2005
"... Abstract. We extend the perturbation theory of Viˇsik, Ljusternik and Lidskiĭ for eigenvalues of matrices, using methods of minplus algebra. We show that the asymptotics of the eigenvalues of a perturbed matrix is governed by certain discrete optimisation problems, from which we derive new perturba ..."
Abstract

Cited by 14 (1 self)
 Add to MetaCart
Abstract. We extend the perturbation theory of Viˇsik, Ljusternik and Lidskiĭ for eigenvalues of matrices, using methods of minplus algebra. We show that the asymptotics of the eigenvalues of a perturbed matrix is governed by certain discrete optimisation problems, from which we derive new perturbation formulæ, extending the classical ones and solving cases which where singular in previous approaches. Our results include general weak majorisation inequalities, relating leading exponents of eigenvalues of perturbed matrices and minplus analogues of eigenvalues. 1.
Set Coverings and Invertibility of Functional Galois Connections
, 2004
"... We consider equations of the form Bf = g, where B is a Galois connection between lattices of functions. This includes the case where B is the Fenchel transform, or more generally a Moreau conjugacy. We characterize the existence and uniqueness of a solution f in terms of generalized subdifferentials ..."
Abstract

Cited by 14 (3 self)
 Add to MetaCart
We consider equations of the form Bf = g, where B is a Galois connection between lattices of functions. This includes the case where B is the Fenchel transform, or more generally a Moreau conjugacy. We characterize the existence and uniqueness of a solution f in terms of generalized subdifferentials, which extends K. Zimmermann’s covering theorem for maxplus linear equations, and give various illustrations.
Idempotent Interval Analysis and Optimization Problems
 RELIABLE COMPUTING
, 2001
"... Many problems in optimization theory are strongly nonlinear in the traditional sense but possess a hidden linear structure over suitable idempotent semirings. After an overview of ‘Idempotent Mathematics ’ with an emphasis on matrix theory, interval analysis over idempotent semirings is developed. ..."
Abstract

Cited by 11 (1 self)
 Add to MetaCart
Many problems in optimization theory are strongly nonlinear in the traditional sense but possess a hidden linear structure over suitable idempotent semirings. After an overview of ‘Idempotent Mathematics ’ with an emphasis on matrix theory, interval analysis over idempotent semirings is developed. The theory is applied to construction of exact interval solutions to the interval discrete stationary Bellman equation. Solution of an interval system is typically NPhard in the traditional interval linear algebra; in the idempotent case it is polynomial. A generalization to the case of positive semirings is outlined.
The presence of a zero in an integer linear recurrent sequence is NPhard to decide
, 2002
"... We show that the problem of determining if a given integer linear recurrent sequence has a zeroa problem that is known as "Pisot's problem"is NPhard. With a similar argument we show that the problem of finding the minimal realization dimension of a oneletter maxplus rational ..."
Abstract

Cited by 10 (4 self)
 Add to MetaCart
We show that the problem of determining if a given integer linear recurrent sequence has a zeroa problem that is known as "Pisot's problem"is NPhard. With a similar argument we show that the problem of finding the minimal realization dimension of a oneletter maxplus rational series is NPhard. This last result answers a folklore question raised in the control literature on the maxplus approach to discrete event systems. Our results are simple consequences of a construction due to Stockmeyer and Meyer.