نتایج جستجو برای: q matrix

تعداد نتایج: 478442  

‎The global generalized minimum residual (Gl-GMRES)‎ ‎method is examined for solving the generalized Sylvester matrix equation‎ ‎[sumlimits_{i = 1}^q {A_i } XB_i = C.]‎ ‎Some new theoretical results are elaborated for‎ ‎the proposed method by employing the Schur complement‎. ‎These results can be exploited to establish new convergence properties‎ ‎of the Gl-GMRES method for solving genera...

2001
ZENGO TSUBOI

A Bethe ansatz equation associated with the Lie superalgebra osp(1|2s) is studied. A thermodynamic Bethe ansatz (TBA) equation is derived by the string hypothesis. The high temperature limit of the entropy density is expressed in terms of the solution of the osp(1|2s) version of the Q-system. In particular for fundamental representation case, we also derive a TBA equation from the osp(1|2s) ver...

2010
Cynthia Vera Glodeanu

This article is an extension of work which suggests using formal concepts as optimal factors of Factor Analysis. They discussed a method for decomposing a p × q binary matrix W into the Boolean matrix product P ◦ Q of a p × n binary matrix P and a n × q binary matrix Q with n as small as possible. We have generalised this factorization problem to the triadic case, looking for a decomposition of...

2010
Rinat KEDEM

In the first part of this paper, we provide a concise review of our method of solution of the Ar Q-systems in terms of the partition function of paths on a weighted graph. In the second part, we show that it is possible to modify the graphs and transfer matrices so as to provide an explicit connection to the theory of planar networks introduced in the context of totally positive matrices by Fom...

2009
RINAT KEDEM

We review the solution of the Ar Q-systems in terms of the partition function of paths on a weighted graph, and show that it is possible to modify the graphs and transfer matrices so as to provide an explicit connection to the theory of planar networks introduced in the context of totally positive matrices by Fomin and Zelevinsky. We also apply our method to give a simple solution for the rank ...

2006
N. Aizawa R. Chakrabarti S. S. Naina

We obtain a closed form expression of the universal T-matrix encapsulating the duality between the quantum superalgebra U q [osp(1/2)] and the corresponding su-pergroup OSp q (1/2). The classical q → 1 limit of this universal T matrix yields the group element of the undeformed OSp(1/2) supergroup. The finite dimensional representations of the quantum supergroup OSp q (1/2) are readily construct...

2006
R. Chakrabarti S. S. Naina J. Segar

We obtain a closed form expression of the universal T-matrix encapsulating the duality of the quantum superalgebra U q [osp(1/2)] and the corresponding supergroup OSp q (1/2). The classical q → 1 limit of this universal T matrix yields the group element of the undeformed OSp(1/2) supergroup. The finite dimensional representations of the quantum supergroup OSp q (1/2) are readily constructed emp...

2004
Ömer Eğecioğlu

We introduce a generalization of the Parikh mapping called the Parikh q-matrix encoding, which takes its values in matrices with polynomial entries. The encoding represents a word w over a k-letter alphabet as a (k + 1)-dimensional upper-triangular matrix with entries that are nonnegative integral polynomials in variable q. Putting q = 1, we obtain the morphism introduced by Mateescu, Salomaa, ...

Journal: :IEEE transactions on systems, man, and cybernetics 2021

Deep reinforcement learning (RL) is achieving significant success in various applications like control, robotics, games, resource management, and scheduling. However, the important problem of emergency evacuation, which clearly could benefit from RL, has been largely unaddressed. Indeed, evacuation a complex task that difficult to solve with RL. An situation highly dynamic, lot changing variabl...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید