Eigenvectors of interval matrices over max--plus algebra
Linear equations (linear algebraic aspects) (15A06) Eigenvalues, singular values, and eigenvectors (15A18) Matrices over special rings (quaternions, finite fields, etc.) (15B33) Interval and finite arithmetic (65G30) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Programming in abstract spaces (90C48)
The semiring \((\overline R,\oplus,\otimes)\) is called max-plus algebra, where \(\overline R\) denotes the reals extended by \(-\infty\), where \(\oplus\) is the maximum operator, and \(\otimes\) the common product in \(\overline R\) with \(-\infty\) as null-element. Then, matrices and interval matrices are defined over \(\overline R\). They can be used to model the behaviour of discrete-event systems. A vector \(x\in\overline R^n\) is called a possible eigenvector of an interval matrix \(A^I= [\underline A, \overline A]\) if there exists a matrix \(A\in A^I\) such that \(x\) is an eigenvector of \(A\) (with respect to the semiring operations). The vector \(x\) is called a universal eigenvector of \(A^I\) if \(x\) is an eigenvector of each \(A\in A^I\). It is further assumed that the left endpoint matrix \(\underline A\) of \(A^I\) is irreducible. Then each \(A\in A^I\) has exactly one eigenvector. The paper shows that the problem to decide whether a given vector \(x\in\overline R^n\) is a possible eigenvector is polynomial. The complexity of the problem to decide whether \(A^I\) has a universal eigenvector is still open. Besides, a combinatorial method for solving two-sided systems of linear equations over \(\overline R\) is developed.
- Integer eigenvectors of max-plus matrices
- On integer eigenvectors and subeigenvectors in the max-plus algebra
- Eigenvector sets for intervals of matrices
- Reachability of eigenspaces for interval matrices in max-min algebra
- Interval eigenproblem in max-min algebra
- Reachability of eigenspaces for interval circulant matrices in max-algebra
- Eigenproblem for monotone and toeplitz matrices in a Max-algebra
- Bounding the Eigenvectors for Symmetric Interval Matrices
- Eigenproblem for circulant matrices in max-plus algebra
- On the range of eigenvalues of an interval matrix
- A characterization of the minimum cycle mean in a digraph
- A linear-system-theoretic view of discrete-event processes and its use for performance evaluation in manufacturing
- A method to find all solutions of a system of multivariate polynomial equalities and inequalities in the max algebra
- Checking robust nonsingularity is NP-hard
- Computational complexity and feasibility of data processing and interval computations
- Graph theory with applications
- scientific article; zbMATH DE number 2185206 (Why is no real title available?)
- scientific article; zbMATH DE number 627763 (Why is no real title available?)
- scientific article; zbMATH DE number 1163656 (Why is no real title available?)
- scientific article; zbMATH DE number 1786170 (Why is no real title available?)
- scientific article; zbMATH DE number 3793772 (Why is no real title available?)
- Idempotent interval analysis and optimization problems
- Interval analysis and dioid: application to robust controller design for timed event graphs
- Interval Matrices: Singularity and Real Eigenvalues
- Interval systems of max-separable linear equations
- Linear and combinatorial optimization in ordered algebraic structures
- Methods and applications of (,+) linear algebra
- Minimax algebra
- Perspectives of Monge properties in optimization
- Several NP-hard problems arising in robust stability analysis
- The equation \(A \otimes x = B \otimes y\) over \((\max,+)\)
- The extended linear complementarity problem
- Eigenvector sets for intervals of matrices
- A polynomial algorithm for solving system of inequalities in max-plus algebra
- Conditional reachability of uncertain max plus linear systems
- On integer eigenvectors and subeigenvectors in the max-plus algebra
- Linear matrix period in max-plus algebra
- Max-plus steady states in discrete event dynamic systems with inexact data
- On the vectors associated with the roots of max-plus characteristic polynomials.
- Tolerance types of interval eigenvectors in max-plus algebra
- Interval eigenproblem in max-min algebra
- Extremality criteria for the supereigenvector space in max-plus algebra
- Optimizing range norm of the image set of matrix over interval max-plus algebra
- On the problem Ax= Bx in max algebra: Every system of intervals is a spectrum
- Integer eigenvectors of max-plus matrices
- Towards robust predictive fault-tolerant control for a battery assembly system
- EIGENVALUES AND EIGENVECTORS OF LATIN SQUARES IN MAX-PLUS ALGEBRA
- scientific article; zbMATH DE number 5693632 (Why is no real title available?)
- Monotone interval eigenproblem in max-min algebra
- Solving systems of two-sided (max, min)-linear equations
- scientific article; zbMATH DE number 3959658 (Why is no real title available?)
- scientific article; zbMATH DE number 27339 (Why is no real title available?)
- X-simplicity of interval max-min matrices
- scientific article; zbMATH DE number 866110 (Why is no real title available?)
- Controllable and tolerable generalized eigenvectors of interval max-plus matrices.
- Closure of the simple image set of linear mapping interval max-plus
- Methods and applications of (,+) linear algebra
- scientific article; zbMATH DE number 2221679 (Why is no real title available?)
- Independence and orthogonality of algebraic eigenvectors over the max-plus algebra
- State geometric adjustability for interval max-plus linear systems
This page was built for publication: Eigenvectors of interval matrices over max--plus algebra
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2565846)
