Page 1 Next

Displaying 1 – 20 of 83

Showing per page

Rank and perimeter preserver of rank-1 matrices over max algebra

Seok-Zun Song, Kyung-Tae Kang (2003)

Discussiones Mathematicae - General Algebra and Applications

For a rank-1 matrix A = a b t over max algebra, we define the perimeter of A as the number of nonzero entries in both a and b. We characterize the linear operators which preserve the rank and perimeter of rank-1 matrices over max algebra. That is, a linear operator T preserves the rank and perimeter of rank-1 matrices if and only if it has the form T(A) = U ⊗ A ⊗ V, or T ( A ) = U A t V with some monomial matrices U and V.

Rank decomposition in zero pattern matrix algebras

Harm Bart, Torsten Ehrhardt, Bernd Silbermann (2016)

Czechoslovak Mathematical Journal

For a block upper triangular matrix, a necessary and sufficient condition has been given to let it be the sum of block upper rectangular matrices satisfying certain rank constraints; see H. Bart, A. P. M. Wagelmans (2000). The proof involves elements from integer programming and employs Farkas' lemma. The algebra of block upper triangular matrices can be viewed as a matrix algebra determined by a pattern of zeros. The present note is concerned with the question whether the decomposition result referred...

Rank of tensors of -out-of- k functions: An application in probabilistic inference

Jiří Vomlel (2011)

Kybernetika

Bayesian networks are a popular model for reasoning under uncertainty. We study the problem of efficient probabilistic inference with these models when some of the conditional probability tables represent deterministic or noisy -out-of- k functions. These tables appear naturally in real-world applications when we observe a state of a variable that depends on its parents via an addition or noisy addition relation. We provide a lower bound of the rank and an upper bound for the symmetric border rank...

Rank, trace and determinant in Banach algebras: generalized Frobenius and Sylvester theorems

Gareth Braatvedt, Rudolf Brits, Francois Schulz (2015)

Studia Mathematica

As a follow-up to a paper of Aupetit and Mouton (1996), we consider the spectral definitions of rank, trace and determinant applied to elements in a general Banach algebra. We prove a generalization of Sylvester's Determinant Theorem to Banach algebras and thereafter a generalization of the Frobenius inequality.

Rank-one LMI approach to robust stability of polynomial matrices

Didier Henrion, Kenji Sugimoto, Michael Šebek (2002)

Kybernetika

Necessary and sufficient conditions are formulated for checking robust stability of an uncertain polynomial matrix. Various stability regions and uncertainty models are handled in a unified way. The conditions, stemming from a general optimization methodology similar to the one used in μ -analysis, are expressed as a rank-one LMI, a non-convex problem frequently arising in robust control. Convex relaxations of the problem yield tractable sufficient LMI conditions for robust stability of uncertain...

Ranks of permutative matrices

Xiaonan Hu, Charles R. Johnson, Caroline E. Davis, Yimeng Zhang (2016)

Special Matrices

A new type of matrix, termed permutative, is defined and motivated herein. The focus is upon identifying circumstances under which square permutative matrices are rank deficient. Two distinct ways, along with variants upon them are given. These are a special kind of grouping of rows and a type of partition in which the blocks are again permutative. Other, results are given, along with some questions and conjectures.

Rational algebra and MM functions

Ray A. Cuninghame-Green (2003)

Kybernetika

MM functions, formed by finite composition of the operators min, max and translation, represent discrete-event systems involving disjunction, conjunction and delay. The paper shows how they may be formulated as homogeneous rational algebraic functions of degree one, over (max, +) algebra, and reviews the properties of such homogeneous functions, illustrated by some orbit-stability problems.

Rational realization of the minimum ranks of nonnegative sign pattern matrices

Wei Fang, Wei Gao, Yubin Gao, Fei Gong, Guangming Jing, Zhongshan Li, Yan Ling Shao, Lihua Zhang (2016)

Czechoslovak Mathematical Journal

A sign pattern matrix (or nonnegative sign pattern matrix) is a matrix whose entries are from the set { + , - , 0 } ( { + , 0 } , respectively). The minimum rank (or rational minimum rank) of a sign pattern matrix 𝒜 is the minimum of the ranks of the matrices (rational matrices, respectively) whose entries have signs equal to the corresponding entries of 𝒜 . Using a correspondence between sign patterns with minimum rank r 2 and point-hyperplane configurations in r - 1 and Steinitz’s theorem on the rational realizability of...

Reachability and observability of linear systems over max-plus

Michael J. Gazarik, Edward W. Kamen (1999)

Kybernetika

This paper discusses the properties of reachability and observability for linear systems over the max-plus algebra. Working in the event-domain, the concept of asticity is used to develop conditions for weak reachability and weak observability. In the reachability problem, residuation is used to determine if a state is reachable and to generate the required control sequence to reach it. In the observability problem, residuation is used to estimate the state. Finally, as in the continuous-variable...

Currently displaying 1 – 20 of 83

Page 1 Next