scholarly journals Algorithm for computing Jordan basis

JSIAM Letters ◽  
2010 ◽  
Vol 2 (0) ◽  
pp. 119-122 ◽  
Author(s):  
Kenji Kudo ◽  
Yoshiaki Kakinuma ◽  
Kazuyuki Hiraoka ◽  
Hiroki Hashiguchi ◽  
Yutaka Kuwajima ◽  
...  
Keyword(s):  
Jordan Basis

The Jordan Basis and Special Subspaces

2014 ◽  
pp. 9-15
Author(s):  
Ćemal B. Dolićanin ◽  
Anatolij B. Antonevich
Keyword(s):  
Jordan Basis

REFINABLE SHIFT INVARIANT SPACES IN ℝd

2005 ◽  
Vol 03 (03) ◽  
pp. 321-345
Author(s):  
CARLOS A. CABRELLI ◽  
SIGRID B. HEINEKEN ◽  
URSULA M. MOLTER
Keyword(s):  
Dimensional Subspace ◽  
Finite Dimensional Subspace ◽  
Invariant Space ◽  
Refinement Equation ◽  
Compactly Supported Function ◽  
Dilation Matrix ◽  
Jordan Basis ◽  
Shift Invariant Spaces ◽  
Invariant Spaces ◽  
Shift Invariant Space

Let φ : ℝd → ℂ be a compactly supported function which satisfies a refinement equation of the form [Formula: see text] where Γ ⊂ ℝd is a lattice, Λ is a finite subset of Γ, and A is a dilation matrix. We prove, under the hypothesis of linear independence of the Γ-translates of φ, that there exists a correspondence between the vectors of the Jordan basis of a finite submatrix of L = [cAi-j]i,j∈Γ and a finite-dimensional subspace [Formula: see text] in the shift-invariant space generated by φ. We provide a basis of [Formula: see text] and show that its elements satisfy a property of homogeneity associated to the eigenvalues of L. If the function φ has accuracy κ, this basis can be chosen to contain a basis for all the multivariate polynomials of degree less than κ. These latter functions are associated to eigenvalues that are powers of the eigenvalues of A-1. Furthermore we show that the dimension of [Formula: see text] coincides with the local dimension of φ, and hence, every function in the shift-invariant space generated by φ can be written locally as a linear combination of translates of the homogeneous functions.

A Note on the Diagonalizability and the Jordan Form of the 4×4 Homogeneous Transformation Matrix

2005 ◽  
Vol 128 (6) ◽  
pp. 1343-1348
Author(s):  
Sangamesh Deepak R ◽  
Ashitava Ghosal
Keyword(s):  
Geometric Modeling ◽  
Parallel Manipulators ◽  
Transformation Matrix ◽  
Jordan Form ◽  
Screw Axis ◽  
General Transformation ◽  
3D Space ◽  
Homogeneous Transformation Matrix ◽  
Jordan Basis ◽  
Aided Design

The 4×4 homogeneous transformation matrix is extensively used for representing rigid body displacement in 3D space and has been extensively used in the analysis of mechanisms, serial and parallel manipulators, and in the field of geometric modeling and computed aided design. The properties of the transformation matrix are very well known. One of the well known properties is that a general 4×4 homogeneous transformation matrix cannot be diagonalized, and at best can be reduced to a Jordan form. In this paper, we show that the 4×4 homogeneous transformation matrix can be diagonalized if and only if displacement along the screw axis is zero. For the general transformation with nonzero displacement along the axis, we present an explicit expression for the fourth basis vector of the Jordan basis. We also present a variant of the Jordan form which contains the motion variables along and about the screw axis and the corresponding basis vectors which contains the information only about the screw axis and its location. We present a novel expression for a point on the screw axis closest to the origin, which is then used to form a simple choice of basis for different forms. Finally, the theoretical results are illustrated with a numerical example.

Multicopy programmable discriminators between two unknown qudit states with group-theoretic approach

2012 ◽  
Vol 12 (11&12) ◽  
pp. 1017-1033
Author(s):  
Tao Zhou ◽  
Jing Xin Cui ◽  
Xiaohua Wu ◽  
Gui Lu Long
Keyword(s):  
Theoretic Approach ◽  
Data Systems ◽  
Mixed States ◽  
Minimum Error ◽  
Unambiguous Discrimination ◽  
State Discrimination ◽  
Jordan Basis ◽  
Orthogonal Measurement ◽  
The Mean ◽  
Programmable Discriminator

The discrimination between two unknown states can be performed by a universal programmable discriminator, where the copies of the two possible states are stored in two program systems respectively and the copies of data, which we want to confirm, are provided in the data system. In the present paper, we propose a group-theretic approach to the multi-copy programmable state discrimination problem. By equivalence of unknown pure states to known mixed states and with the representation theory of $U(n)$ group, we construct the Jordan basis to derive the analytical results for both the optimal unambiguous discrimination and minimum-error discrimination. The POVM operators for unambiguous discrimination and orthogonal measurement operators for minimum-error discrimination are obtained. We find that the optimal failure probability and minimum-error probability for the discrimination between the mean input mixd states are dependent on the dimension of the unknown qudit states. We applied the approach to generalize the results of He and Bergou (2007) from qubit to qudit case, and we further solve the problem of programmable dicriminators with arbitrary copies of unknown states in both program and data systems.

scholarly journals The Goldman-Rota Identity and the Grassmann Scheme

10.37236/3557 ◽  
2014 ◽  
Vol 21 (1) ◽  
Author(s):  
Murali K. Srinivasan
Keyword(s):  
Vector Space ◽  
Spanning Trees ◽  
Singular Values ◽  
Recursive Structure ◽  
Bijective Proof ◽  
Finite Vector ◽  
Finite Vector Space ◽  
Algebraic Interpretation ◽  
Jordan Basis ◽  
Fixed Rank

We inductively construct an explicit (common) orthogonal eigenbasis for the elements of the Bose-Mesner algebra of the Grassmann scheme.The key step is a constructive, linear algebraic interpretation of the Goldman-Rota recurrence for the number of subspaces of a finite vector space. This interpretation shows that the up operator on subspaces has an explicitly given recursive structure. Using the interpretation above we inductively construct an explicit orthogonal symmetric Jordan basis with respect to the up operator and write down the singular values, i.e., the ratio of the lengths of the successive vectors in the Jordan chains. The collection of all vectors in this basis of a fixed rank $m$ forms a (common) orthogonal eigenbasis for the elements of the Bose-Mesner algebra of the Grassmann scheme of $m$-dimensional subspaces. We also pose a bijective proof problem on the spanning trees of the Grassmann graphs.

Sign in / Sign up

Export Citation Format

Share Document