We consider difference equations y(s+1) = A(s)y(s), where A(s) is an n × n-matrix meromorphic in a neighborhood of ∞ with detA(s) ≡ 0. In general, the formal fundamental solutions of this equation involve gamma-functions which give rise to the critical variable s log s and a level 1. We show that, under a mild condition, formal fundamental matrices of the equation can be summed uniquely to anal...

We consider diierence equations y(s + 1) = A(s)y(s), where A(s) is an n n-matrix meromorphic in a neighborhood of 1 with det A(s) 6 6 0. In general, the formal fundamental solutions of this equation involve gamma-functions which give rise to the critical variable s log s and a level 1 +. We show that, under a mild condition, formal fundamental matrices of the equation can be summed uniquely to ...

in the process of structural analysis we often come to structures that can be analyzed with simpler methods than the standard approaches. for these structures, known as regular structures, the matrices involved are in canonical forms and their eigen-solution can be performed in a simple manner. however, by adding or removing some elements or nodes, such methods cannot be utilized. here, an effi...

In the context of devising geometrical integrators that retain qualitative features of the underlying solution, we present a family of numerical methods (the method of iterated commutators, [5, 13]) to integrate ordinary di erential equations that evolve on matrix Lie groups. The schemes apply to the problem of nding a numerical approximation to the solution of Y 0 = A(t;Y )Y; Y (0) = Y0; where...

An approach is presented to get interconnections between the Fisher information matrix of an ARMAX process and a corresponding solution of a Stein equation. The case of algebraic multiplicity greater than one and the case of distinct eigenvalues are addressed. Appropriate links are constructed for these two cases by applying a factorization both for the Fisher information matrix and for a corre...

In the context of devising geometrical integrators that retain qualitative features of the underlying solution, we present a family of numerical methods (the method of iterated commutators, 5, 13]) to integrate ordinary diierential equations that evolve on matrix Lie groups. The schemes apply to the problem of nding a numerical approximation to the solution of Y 0 = A(t;Y)Y; Y (0) = Y0; whereby...

High Accuracy Computation of Rank-constrained Fundamental Matrix by Efficient Search Yasuyuki SUGAYA† and Kenichi KANATANI†† † Department of Information and Computer Sciences, Toyohashi University of Technology, Toyohashi, Aichi, 441–8580 Japan †† Department of Computer Science, Okayama University, Okayama, 700–8530 Japan E-mail: †[email protected], ††[email protected] Abs...

In this talk I describe some applications of random matrix models to the study of N = 1 supersymmetric Yang-Mills theories with matter fields in the fundamental representation. I review the derivation of the Veneziano-Yankielowicz-Taylor/Affleck-Dine-Seiberg superpotentials from constrained random matrix models (hep-th/0211082), a field theoretical justification of the logarithmicmatter contrib...

In the present paper‎, ‎we propose an iterative algorithm for‎ ‎solving the generalized $(P,Q)$-reflexive solution of the quaternion matrix‎ ‎equation $overset{u}{underset{l=1}{sum}}A_{l}XB_{l}+overset{v} ‎{underset{s=1}{sum}}C_{s}widetilde{X}D_{s}=F$‎. ‎By this iterative algorithm‎, ‎the solvability of the problem can be determined automatically‎. ‎When the‎ ‎matrix equation is consistent over...