On tridiagonal matrices unitarily equivalent to normal matrices

In this article the unitary equivalence transformation of normal matrices to tridiagonal form is studied.It is well-known that any matrix is unitarily equivalent to a tridiagonal matrix. In case of a normal matrix the resulting tridiagonal inherits a strong relation between its super- and subdiagonal elements. The corresponding elements of the super- and subdiagonal will have the same absolute value.In this article some basic facts about a unitary equivalence transformation of an arbitrary matrix to tridiagonal form are firstly studied. Both an iterative reduction based on Krylov sequences as a direct tridiagonalization procedure via Householder transformations are reconsidered. This equivalence transformation is then applied to the normal case and equality of the absolute value between the super- and subdiagonals is proved. Self-adjointness of the resulting tridiagonal matrix with regard to a specific scalar product is proved. Properties when applying the reduction on symmetric, skew-symmetric, Hermitian, skew-Hermitian and unitary matrices and their relations with, e.g., complex symmetric and pseudo-symmetric matrices are presented.It is shown that the reduction can then be used to compute the singular value decomposition of normal matrices making use of the Takagi factorization. Finally some extra properties of the reduction as well as an efficient method for computing a unitary complex symmetric decomposition of a normal matrix are given.     

On the point spectrum of periodic Jacobi matrices with matrix entries: elementary approach

This work consists of two parts. The first one contains a characterization (localization) of the point spectrum of one sided, infinite and periodic Jacobi matrices with scalar entries. The second one deals with the same questions about one sided, infinite periodic Jacobi matrices with matrix entries. In particular, an example illustrating the difference between the above localization property in scalar and matrix entries cases is given.     

Linear fractional transformations in rings and modules

This report examines the basic properties of linear fractional transformations of a matrix argument, with matrix coefficients, and still more general entities. The familiar properties of scalar transformations generalize surprisingly well: for instance, cross- ratios of matrices are preserved up to similarity. The questions of multiple transitivity and uniqueness of coefficients are examined, and two engineering applications are outlined.     

On Some “Tame” and “Wild” Aspects of the Problem of Semiscalar Equivalence of Polynomial Matrices

The problem of reducing polynomial matrices to canonical form by using semiscalar equivalent transformations is studied. This problem is wild as a whole. However, it is tame in some special cases. In the paper, classes of polynomial matrices are singled out for which canonical forms with respect to semiscalar equivalence are indicated. We use this tool to construct a canonical form for the families of coefficients corresponding to the polynomial matrices. This form enables one to solve the classification problem for families of numerical matrices up to similarity.     

The elementary divisor theory over the Hurwitz order of integral quaternions

There exists a diagonal form with certain divisibility conditions for matrices over the Hurwitz order of integral quaternions under unimodular equivalence. The diagonal entries are uniquely determined up to similarity. Given two such diagonal forms, where the diagonal entries are similar by pairs, the matrices prove to be ummodularly equivalent, whenever the rank of the matrices is creater than one.     

論矩陣的一種變換

<正> 在本文中,數域限定為複數域.我們要來研究如下的變換:(1)(它將方陣A變成方陣B),式中P表示任意正則陣,P表示P的元素的共軛救構成的陣.所有的變换(1)顯然成羣.這種變換現在姑稱之為種變換.如果二方陣A與B可由一個種變換變此成彼,我們就說,A與B是對相似的.     

Miniversal deformations of matrices of bilinear forms

Arnold [V.I. Arnold, On matrices depending on parameters, Russian Math. Surveys 26 (2) (1971) 29–43] constructed miniversal deformations of square complex matrices under similarity; that is, a simple normal form to which not only a given square matrix A but all matrices B close to it can be reduced by similarity transformations that smoothly depend on the entries of B. We construct miniversal deformations of matrices under congruence.     

Classification of Discrete Symmetries of Ordinary Differential Equations

A simple method for determining all discrete point symmetries of a given differential equation has been developed recently. The method uses constant matrices that represent inequivalent automorphisms of the Lie algebra spanned by the Lie point symmetry generators. It may be difficult to obtain these matrices if there are three or more independent generators, because the matrix elements are determined by a large system of algebraic equations. This paper contains a classification of the automorphisms that can occur in the calculation of discrete symmetries of scalar ordinary differential equations, up to equivalence under real point transformations. (The results are also applicable to many partial differential equations.) Where these automorphisms can be realized as point transformations, we list all inequivalent realizations. By using this classification as a look-up table, readers can calculate the discrete point symmetries of a given ordinary differential equation with very little effort.     

Integral equivalence of hadamard matrices

SupposeA is a non-singular matrix with entries 0 and 1, the zero and identity elements of a Euclidean domain. We obtain a “best-possible” lower bound for the number of equivalence invariants ofA (over the domain) which equal 1. From this it is proven that the sequence of invariants under integral equivalence of an Hadamard matrix must obey certain conditions. Finally, lower bounds are found for the number of inequivalent Hadamard matrices of order a power of 2, and consequently for the number of Hadamard-inequivalent Hadamard matrices of those orders.     

The study of Jacobi and cyclic Jacobi matrix eigenvalue problems using Sturm-Liouville theory

We study the eigenvalues of matrix problems involving Jacobi and cyclic Jacobi matrices as functions of certain entries. Of particular interest are the limits of the eigenvalues as these entries approach infinity. Our approach is to use the recently discovered equivalence between these problems and a class of Sturm-Liouville problems and then to apply the Sturm-Liouville theory.     

On a Toeplitz Representation of the H1/2 Norm

Some representations of the H1/2 norm are used as Schur complement preconditioner in PCG based domain decomposition algorithms for elliptic problems. These norm representations are efficient preconditioners but the corresponding matrices are dense, so they need FFT algorithm for matrix-vector multiplications. Here we give a new matrix representation of this norm by a special Toeplitz matrix. It contains only O(log(n)) different entries at each row, where n is the number of rows and so a matrix-vector computation can be done by O(nlog(n)) arithmetic operation without using FFT algorithm. The special properties of this matrix assure that it can be used as preconditioner. This is proved by estimating spectral equivalence constants and this fact has also been verified by numerical tests.     

Matrices, graphs and equivalence relations

A suitable equivalence relation is introduced on the set of square matrices with entries of any kind. This allows us to associate to every equivalence class an infinite family of graphs and determine their topological properties. When a given square matrix is the multiplication table of a finite groupoid, some connections between algebraic properties of the groupoid and topological properties of these graphs are proved. Received: May 4, 1999 Published online: December 19, 2001     

（m，l）幂等矩阵的代数等价与正交的一些性质

应用数域上（m,l）幂等矩阵与m幂等矩阵的关系,得到了数域上（m,l）幂等矩阵的l次方幂的代数等价、相似和特征多项式相等是互为确定的结论,由此推广改进了数域上m幂等矩阵的代数等价与正交性的相应结果．     

Identities among certain triangular matrices

The object of this paper is to develop the ideas introduced in the author's paper [1] on matrices which generate families of polynomials and associated infinite series. A family of infinite one-subdiagonal non-commuting matrices Q_m is defined, and a number of identities among its members are given. The matrix Q₁ is applied to solve a problem concerning the derivative of a family of polynomials, and it is shown that the solution is remarkably similar to a conventional solution employing a scalar generating function. Two sets of infinite triangular matrices are then defined. The elements of one set are related to the terms of Laguerre, Hermite, Bernoulli, Euler, and Bessel polynomials, while the elements of the other set consist of Stirling numbers of both kinds, the two-parameter Eulerian numbers, and numbers introduced in a note on inverse scalar relations by Touchard. It is then shown that these matrices are related by a number of identities, several of which are in the form of similarity transformations. Some well-known and less well-known pairs of inverse scalar relations arising in combinatorial analysis are shown to be derivable from simple and obviously inverse pairs of matrix relations. This work is an explicit matrix version of the umbral calculus as presented by Rota et al. [24-26].     

Matrices with block Toeplitz inverses

Conditions for a nonsingular matrix to have a block Toeplitz inverse are obtained. A simpler criterion for a block Toeplitz matrix to have a block Toeplitz inverse is also given. The results generalize those of Huang and Cline for Toeplitz matrices with scalar entries, for which alternative statements and proofs are also indicated.     

A method of congruent type for linear systems with conjugate-normal coefficient matrices

Minimal residual methods, such as MINRES and GMRES, are well-known iterative versions of direct procedures for reducing a matrix to special condensed forms. The method of reduction used in these procedures is a sequence of unitary similarity transformations, while the condensed form is a tridiagonal matrix (MINRES) or a Hessenberg matrix (GMRES). The algorithm CSYM proposed in the 1990s for solving systems with complex symmetric matrices was based on the tridiagonal reduction performed via unitary congruences rather than similarities. In this paper, we construct an extension of this algorithm to the entire class of conjugate-normal matrices. (Complex symmetric matrices are a part of this class.) Numerical results are presented. They show that, on many occasions, the proposed algorithm has a superior convergence rate compared to GMRES.     

A Characterization of Nash Equilibrium for the Games with Random Payoffs

We consider a two-player random bimatrix game where each player is interested in the payoffs which can be obtained with certain confidence. The payoff function of each player is defined using a chance constraint. We consider the case where the entries of the random payoff matrix of each player jointly follow a multivariate elliptically symmetric distribution. We show an equivalence between the Nash equilibrium problem and the global maximization of a certain mathematical program. The case where the entries of the payoff matrices are independent normal/Cauchy random variables is also considered. The case of independent normally distributed random payoffs can be viewed as a special case of a multivariate elliptically symmetric distributed random payoffs. As for Cauchy distribution, we show that the Nash equilibrium problem is equivalent to the global maximization of a certain quadratic program. Our theoretical results are illustrated by considering randomly generated instances of the game.     

Invariant factors of integral quaternion matrices

Existence of a diagonal form under unimodular equivalence is proved for matrices with entries from the Hurwitz ring of integral quaternions. The diagonal elements satisfy certain divisibility relations with an unexpected character, and these force a degree of uniqueness to the diagonal form. Connections between the so obtained invariant factors of a full matrix and those of a submatrix are then established.     

Classification of scalar third order ordinary differential equations linearizable via generalized contact transformations

Whereas Lie had linearized scalar second order ordinary differential equations (ODEs) by point transformations, and later Chern had extended to the third order by using contact transformation, till recently no work had been done for higher order (or systems) of ODEs. Lie had found a unique class defined by the number of infinitesimal symmetry generators but the more general ODEs were not so classified. Recently, classifications of higher order and systems of ODEs were provided. In this paper we relate contact symmetries of scalar ODEs with point symmetries of reduced systems. We define a new type of transformation that builds upon this relation and obtain equivalence classes of scalar third order ODEs linearizable via these transformations. Four equivalence classes of such equations are seen to exist.