and Hans Schneider· Department of Mathematics University of Wisconsin Madison, Wisconsin 53706 An elementary proof is given that a bounded multiplicative group of complex (real) n X n nonsingular matrices is similar to a unitary (orthogonal) group. Given a norm on a complex n-space, it follows that there exists a nonsingular n X n matrix L (the lAewner-John matrix for the norm) such that LHL -1...

The computational function of a matchgate is represented by its character matrix. In this article, we show that all nonsingular character matrices are closed under matrix inverse operation, so that for every k, the nonsingular character matrices of k-bit matchgates form a group, extending the recent work of Cai and Choudhary [1] of the same result for the case of k = 2, and that the single and ...

The paper studies algebraic shift equivalence of matrices over n-variable polynomial rings over a principal ideal domain D(n ≤ 2). It is proved that in the case n = 1, every non-nilpotent matrix over D[x] is algebraically strong shift equivalent to a nonsingular matrix. In the case n = 2, an example of non-nilpotent matrix over R[x, y, z] = R[x][y, z], which can not be algebraically shift equiv...

Wang proposed a gradient-based neural network (GNN) to solve online matrix-inverses. Global asymptotical convergence was shown for such a neural network when applied to inverting nonsingular matrices. As compared to the previously-presented asymptotical convergence, this paper investigates more desirable properties of the gradient-based neural network; e.g., global exponential convergence for n...

in the linear system ax = b the points x are sometimes constrained to lie in a given subspace s of column space of a. drazin inverse for any singular or nonsingular matrix, exist and is unique. in this paper, the singular consistent or inconsistent constrained linear systems are introduced and the effect of drazin inverse in solving such systems is investigated. constrained linear system arise ...

The computational function of a matchgate is represented by its character matrix. In this article, we show that all nonsingular character matrices are closed under matrix inverse operation, so that for every k, the nonsingular character matrices of k-bit matchgates form a group, extending the recent work of Cai and Choudhary [1] of the same result for the case of k = 2, and that the single and ...

The goal of this paper is to propose a mathematical framework to define and analyze a general parametric form of an arbitrary nonsingular Mueller matrix. Starting from previous results about nondepolarizing matrices, we generalize the method to any nonsingular Mueller matrix. We address this problem in a six-dimensional space in order to introduce a transformation group with the same number of ...

In this paper, we introduce the notions of weakly normal and normal matrix polynomials, with nonsingular leading coefficients. We characterize these matrix polynomials, using orthonormal systems of eigenvectors and normal eigenvalues. We also study the conditioning of the eigenvalue problem of a normal matrix polynomial, constructing an appropriate Jordan canonical form.

Matrix We take a detour to introduce abstract matrices. We want to acquire a good understanding of such matrices, since they not only represent matroids, but 74 Chapter 3. From Graphs to Matroids also display a lot of structural information about matroids that other ways do not. An abstract matrix B is a {0, 1} matrix with row and column indices plus a function called abstract determinant and d...

We show that any regular quadratic matrix polynomial can be reduced to an upper triangular quadratic matrix polynomial over the complex numbers preserving the finite and infinite elementary divisors. We characterize the real quadratic matrix polynomials that are triangularizable over the real numbers and show that those that are not triangularizable are quasi-triangularizable with diagonal bloc...