Add to ORKGIn this paper an algorithm for computing a generalized eigenmode of reducible regular matrices over the max-plus algebra is proposed. Given a matrix of finite size, the problem consists in giving an algorithm which will tell us how to compute its generalized eigenmode over the max plus algebra. The solution to the problem is achieved by studying some type of recurrent equations. In fact, by transforming the reducible regular matrix into its normal form, and considering a very specific recurrent equation, an explicit mathematical characterization is obtained, upon which the algorithm is constructed
[[abstract]]A new method which is based on two transformations, called the HMDR and the FMDR transfo...
AbstractA complete description of the eigenspace structure for a given n×n Monge matrix in a max-plu...
Max-plus matrix polynomial eigenvalues provide a useful approximation to the order of magnitude of t...
In this paper we discuss a generalization of power algorithms over max-plus algebra. We are interest...
Abstract: In this paper an algorithm for computing a generalized eigenmode of reducible regular ma-t...
Eigen problems and eigenmode are important components related to square matrices. In max-plus algebr...
Eigen problems and eigenmode are important components related to square matrices. In max-plus algebr...
Max-algebra is an analogue of linear algebra developed for the pair of operations (;) = (max;+) ove...
The max-plus algebra defined in the set ! [ f\Gamma1g is an algebra with two binary operations \Phi ...
AbstractWe consider the generalized eigenvalue problemA⊗x=λB⊗x,x⩾0,x≠0,where A and B are (entrywise)...
AbstractThe problem of computing an eigenvector of an inverse Monge matrix in max–plus algebra is ad...
Let a⊕b=max(a,b) and a⊗b=a+b for View the MathML source and extend these operations to matrices and ...
In this article we introduce a new method, called a mutation method, for calculating max-eigenvector...
AbstractIt is proved that, under certain conditions, an algorithm resembling the power algorithm in ...
AbstractA new method which is based on two transformations, called the HMDR and the FMDR transformat...
[[abstract]]A new method which is based on two transformations, called the HMDR and the FMDR transfo...
AbstractA complete description of the eigenspace structure for a given n×n Monge matrix in a max-plu...
Max-plus matrix polynomial eigenvalues provide a useful approximation to the order of magnitude of t...
In this paper we discuss a generalization of power algorithms over max-plus algebra. We are interest...
Abstract: In this paper an algorithm for computing a generalized eigenmode of reducible regular ma-t...
Eigen problems and eigenmode are important components related to square matrices. In max-plus algebr...
Eigen problems and eigenmode are important components related to square matrices. In max-plus algebr...
Max-algebra is an analogue of linear algebra developed for the pair of operations (;) = (max;+) ove...
The max-plus algebra defined in the set ! [ f\Gamma1g is an algebra with two binary operations \Phi ...
AbstractWe consider the generalized eigenvalue problemA⊗x=λB⊗x,x⩾0,x≠0,where A and B are (entrywise)...
AbstractThe problem of computing an eigenvector of an inverse Monge matrix in max–plus algebra is ad...
Let a⊕b=max(a,b) and a⊗b=a+b for View the MathML source and extend these operations to matrices and ...
In this article we introduce a new method, called a mutation method, for calculating max-eigenvector...
AbstractIt is proved that, under certain conditions, an algorithm resembling the power algorithm in ...
AbstractA new method which is based on two transformations, called the HMDR and the FMDR transformat...
[[abstract]]A new method which is based on two transformations, called the HMDR and the FMDR transfo...
AbstractA complete description of the eigenspace structure for a given n×n Monge matrix in a max-plu...
Max-plus matrix polynomial eigenvalues provide a useful approximation to the order of magnitude of t...