scholarly journals Multidimensional Arrays, Indices and Kronecker Products

Econometrics ◽  
2021 ◽  
Vol 9 (2) ◽  
pp. 18
Author(s):  
D. Stephen G. Pollock

Much of the algebra that is associated with the Kronecker product of matrices has been rendered in the conventional notation of matrix algebra, which conceals the essential structures of the objects of the analysis. This makes it difficult to establish even the most salient of the results. The problems can be greatly alleviated by adopting an orderly index notation that reveals these structures. This claim is demonstrated by considering a problem that several authors have already addressed without producing a widely accepted solution.

2021 ◽  
Vol 10 (6) ◽  
pp. 25352-25359
Author(s):  
Vellanki Lakshmi N. ◽  
Jajula Madhu ◽  
Musa Dileep Durani

This paper studies and supplements the proofs of the properties of the Kronecker Product of two matrices of different orders. We observe the relation between the singular value decomposition of the matrices and their Kronecker product and the relationship between the determinant, the trace, the rank and the polynomial matrix of the Kronecker products.  We also establish the best least square solutions of the Kronecker product system of equations by using modified QR-algorithm.


2014 ◽  
Vol 2014 ◽  
pp. 1-9 ◽  
Author(s):  
Shi-Fang Yuan

Using the Kronecker product of matrices, the Moore-Penrose generalized inverse, and the complex representation of quaternion matrices, we derive the expressions of least squares solution with the least norm, least squares pure imaginary solution with the least norm, and least squares real solution with the least norm of the quaternion matrix equationAXB+CXD=E, respectively.


10.37236/85 ◽  
2009 ◽  
Vol 16 (2) ◽  
Author(s):  
A. M. Garsia ◽  
A. Goupil

The numerical calculation of character values as well as Kronecker coefficients can efficently be carried out by means of character polynomials. Yet these polynomials do not seem to have been given a proper role in present day literature or software. To show their remarkable simplicity we give here an "umbral" version and a recursive combinatorial construction. We also show that these polynomials have a natural counterpart in the standard Hecke algebra ${\cal H}_n(q\, )$. Their relation to Kronecker products is brought to the fore, as well as special cases and applications. This paper may also be used as a tutorial for working with character polynomials in the computation of Kronecker coefficients.


10.37236/1471 ◽  
1999 ◽  
Vol 6 (1) ◽  
Author(s):  
Ernesto Vallejo

F. Murnaghan observed a long time ago that the computation of the decompositon of the Kronecker product $\chi^{(n-a, \lambda_2, \dots )}\otimes \chi^{(n-b, \mu_2, \dots)}$ of two irreducible characters of the symmetric group into irreducibles depends only on $\overline\lambda=(\lambda_2,\dots )$ and $\overline\mu =(\mu_2,\dots )$, but not on $n$. In this note we prove a similar result: given three partitions $\lambda$, $\mu$, $\nu$ of $n$ we obtain a lower bound on $n$, depending on $\overline\lambda$, $\overline\mu$, $\overline\nu$, for the stability of the multiplicity $c(\lambda,\mu,\nu)$ of $\chi^\nu$ in $\chi^\lambda \otimes \chi^\mu$. Our proof is purely combinatorial. It uses a description of the $c(\lambda,\mu,\nu)$'s in terms of signed special rim hook tabloids and Littlewood-Richardson multitableaux.


Filomat ◽  
2014 ◽  
Vol 28 (6) ◽  
pp. 1153-1165 ◽  
Author(s):  
Shi-Fang Yuan ◽  
Qing-Wen Wang ◽  
Zhi-Ping Xiong

For any A=A1+A2j?Qnxn and ?? {i,j,k} denote A?H = -?AH?. If A?H = A,A is called an ?-Hermitian matrix. If A?H =-A,A is called an ?-anti-Hermitian matrix. Denote ?-Hermitian matrices and ?-anti-Hermitian matrices by ?HQnxn and ?AQnxn, respectively. In this paper, we consider the least squares ?-Hermitian problems of quaternion matrix equation AHXA+ BHYB = C by using the complex representation of quaternion matrices, the Moore-Penrose generalized inverse and the Kronecker product of matrices. We derive the expressions of the least squares solution with the least norm of quaternion matrix equation AHXA + BHYB = C over [X,Y] ? ?HQnxn x ?HQkxk, [X,Y] ? ?AQnxn x ?AQkxk, and [X,Y] ? ?HQnxn x ?AQkxk, respectively.


2011 ◽  
Vol 50-51 ◽  
pp. 190-194 ◽  
Author(s):  
Shi Fang Yuan ◽  
Han Dong Cao

In this paper, by using the Kronecker product of matrices and the complex representation of quaternion matrices, we discuss the special structure of quaternion skew bisymmetric matrices, and derive the expression of the least squares skew bisymmetric solution of the quaternion matrix equation AXB =C with the least norm.


2013 ◽  
Vol 24 (06) ◽  
pp. 709-728 ◽  
Author(s):  
JOSÉ N. OLIVEIRA

The evolution from non-deterministic to weighted automata represents a shift from qualitative to quantitative methods in computer science. The trend calls for a language able to reconcile quantitative reasoning with formal logic and set theory, which have for so many years supported qualitative reasoning. Such a lingua franca should be typed, polymorphic, diagrammatic, calculational and easy to blend with conventional notation. This paper puts forward typed linear algebra as a candidate notation for such a unifying role. This notation, which emerges from regarding matrices as morphisms of suitable categories, is put at work in describing weighted automata as coalgebras in such categories. Some attention is paid to the interface between the index-free (categorial) language of matrix algebra and the corresponding index-wise, set-theoretic notation.


Sign in / Sign up

Export Citation Format

Share Document