Lyapunov,Bézout,and Hankel

Given a polynomial f of degree n, we denote by C its companion matrix, and by S the truncated shift operator of order n. We consider Lyapunov-type equations of the form X?SXC=>W and X?CXS=W. We derive some properties of these equations which make it possible to characterize Bezoutian matrices as solutions of the first equation with suitable right-hand sides W (similarly for Hankel and the second equation) and to write down explicit expressions for these solutions. This yields explicit factorization formulae for polynomials in C, for the Schur-Cohn matrix, and for matrices satisfying certain intertwining relations, as well as for Bezoutian matrices.     

Involutory matrices over finite commutative rings

An n × n matrix A is called involutory iff A²=I_n, where I_n is the n × n identity matrix. This paper is concerned with involutory matrices over an arbitrary finite commutative ring R with identity and with the similarity relation among such matrices. In particular the authors seek a canonical set $\text{C}$ with respect to similarity for the n × n involutory matrices over R—i.e., a set $\text{C}$ of n × n involutory matrices over R with the property that each n × n involutory matrix over R is similar to exactly on matrix in $\text{C}$. Because of the structure of finite commutative rings and because of previous research, they are able to restrict their attention to finite local rings of characteristic a power of 2, and although their main result does not completely specify a canonical set $\text{C}$ for such a ring, it does solve the problem for a special class of rings and shows that a solution to the general case necessarily contains a solution to the classically unsolved problem of simultaneously bringing a sequence A₁,…,A_v of (not necessarily involutory) matrices over a finite field of characteristic 2 to canonical form (using the same similarity transformation on each A_i). (More generally, the authors observe that a theory of similarity fot matrices over an arbitrary local ring, such as the well-known rational canonical theory for matrices over a field, necessarily implies a solution to the simultaneous canonical form problem for matrices over a field.) In a final section they apply their results to find a canonical set for the involutory matrices over the ring of integers modulo 2^m and using this canonical set they are able to obtain a formula for the number of n × n involutory matrices over this ring.     

Characterizations of products of symmetric matrices

Characterizations are obtained for matrices C of the form C = AΣ, where A, Σ are n×n matrices over the real field such that A is symmetric and C is nonnegative definite. Among others, a proof of recent generalization of Cochran's theorem is given.     

Fast computation of eigenvalues of companion,comrade, and related matrices

The class of eigenvalue problems for upper Hessenberg matrices of banded-plus-spike form includes companion and comrade matrices as special cases. For this class of matrices a factored form is developed in which the matrix is represented as a product of essentially 2×2 matrices and a banded upper-triangular matrix. A non-unitary analogue of Francis’s implicitly-shifted QR algorithm that preserves the factored form and consequently computes the eigenvalues in O(n ²) time and O(n) space is developed. Inexpensive a posteriori tests for stability and accuracy are performed as part of the algorithm. The results of numerical experiments are mixed but promising in certain areas. The single-shift version of the code applied to companion matrices is much faster than the nearest competitor.     

A matrix pencil approach computing the elementary divisors of a matrix: Numerical aspects and applications

In the present paper is presented a new matrix pencil-based numerical approach achieving the computation of the elementary divisors of a given matrixA ∈ C ^{n × n}. This computation is attained without performing similarity transformations and the whole procedure is based on the construction of the Piecewise Arithmetic Progression Sequence (PAPS) of the associated pencil λI _n - A of matrix A, for all the appropriate values of λ belonging to the set of eigenvalues of A. This technique produces a stable and accurate numerical algorithm working satisfactorily for matrices with a well defined eigenstructure. The whole technique can be applied for the computation of the first, second and Jordan canonical form of a given matrixA ∈ C ^{n × n}. The results are accurate for matrices possessing a well defined canonical form. In case of defective matrices, indications of the most appropriately computed canonical form are given.     

Structural stability of (C, A)-marked subspaces

Given an observable pair of matrices (C, A) we consider the manifold of (C, A)-invariant subspaces having a fixed Brunovsky-Kronecker structure. Using Arnold techniques we obtain the explicit form of a miniversal deformation of a marked (C, A)-invariant subspace with respect to the usual equivalence relation. As an application, we obtain the dimension of the orbit and we characterize the structurally stable subspaces (those with open orbit).     

Some angularity and inertia theorems related to normal matrices

Motivated by the definition of the inertia, introduced by Ostrowski and Schneider, a notion of angularity of a matrix is defined. The angularity characterizes the distribution of arguments of eigenvalues of a matrix. It is proved that if B and C are nonsingular matrices, then B¹AB and C¹AC have the same angularity provided they are diagonal. Some well-known inertia theorems (e.g. Sylvester's law) have been deduced as corollaries of this result. The case when C is permitted to be singular is discussed next. Finally, we prove that (a) any linear transformation T, on the set of n by n complex matrices, mapping Hermitian matrices into themselves and preserving the inertia of each Hermitian matrix is of the form T(A)=C¹AC or T(A)=C^1LA′C where C is some nonsingular matrix, and (b) any linear transformation T mapping normal matrices into normal matrices and preserving the angularity of each normal matrix is also of one of the above forms, but with C=kU where k≠0 and U is unitary.     

Numerical ranges of reducible companion matrices

In this paper, we show that a reducible companion matrix is completely determined by its numerical range, that is, if two reducible companion matrices have the same numerical range, then they must equal to each other. We also obtain a criterion for a reducible companion matrix to have an elliptic numerical range, put more precisely, we show that the numerical range of an n-by-n reducible companion matrix C is an elliptic disc if and only if C is unitarily equivalent to A⊕B, where A∈M_n-2, B∈M₂ with σ(B)={aω₁,aω₂}, , ω₁≠ω₂, and .     

Permanental compounds and permanents of (0, 1)-circulants

It was shown by the author in a recent paper that a recurrence relation for permanents of (0, 1)-circulants can be generated from the product of the characteristic polynomials of permanental compounds of the companion matrix of a polynomial associated with (0, 1)-circulants of the given type. In the present paper general properties of permanental compounds of companion matrices are studied, and in particular of convertible companion matrices, i.e., matrices whose permanental compounds are equal to the determinantal compounds after changing the signs of some of their entries. These results are used to obtain formulas for the limit of the nth root of the permanent of the n × n (0, 1)-circulant of a given type, as n tends to infinity. The root-squaring method is then used to evaluate this limit for a wide range of circulant types whose associated polynomials have convertible companion matrices.     

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.     

Sub-Stonean spaces and corona sets

A self-contained account of the theory of sub-Stonean spaces, and their relations to Stonean spaces and Rickart spaces is given. Of particular interest are the corona sets (of the form β(X) for locally compact, σ-compact spaces, because these highly nontrivial sub-Stonean spaces lend themselves to C?ech-cohomological considerations. The theory of sub-Stonean spaces is essential for our solution of the diagonalization problem for C(X)? M_n, found in K. Grove and G. K. Pedersen, Diagonalizing matrices over C(X), submitted for publication.     

Reachability of condensed forms via unitary congruence transformations

There are several well-known facts about unitary similarity transformations of complex n-by-n matrices: every matrix of order n = 3 can be brought to tridiagonal form by a unitary similarity transformation; if n ≥ 5, then there exist matrices that cannot be brought to tridiagonal form by a unitary similarity transformation; for any fixed set of positions (pattern) S whose cardinality exceeds n(n ? 1)/2, there exists an n-by-n matrix A such that none of the matrices that are unitarily similar to A can have zeros in all of the positions in S. It is shown that analogous facts are valid if unitary similarity transformations are replaced by unitary congruence ones.     

Two Bilinear (3 × 3)-Matrix Multiplication Algorithms of Complexity 25

As is known, a bilinear algorithm for multiplying 3 × 3 matrices can be constructed by using ordered triples of 3 × 3 matrices A _ρ , B _ρ , C _ρ , \(\rho = \overline {1,r} ,\) where r is the complexity of the algorithm. Algorithms with various symmetries are being extensively studied. This paper presents two algorithms of complexity 25 possessing the following two properties (symmetries): (1) the matricesA₁,B₁, and C1 are identity, (2) if the algorithm involves a tripleA, B, C, then it also involves the triples B, C, A and C, A, B. For example, these properties are inherent in the well-known Strassen algorithm for multiplying 2 × 2 matrices. Many existing (3 × 3)-matrix multiplication algorithms have property (2). Methods for finding new algorithms are proposed. It is shown that the found algorithms are different and new.     

Pairs of mutually annihilating operators

Pairs (A,B) of mutually annihilating operators AB=BA=0 on a finite dimensional vector space over an algebraically closed field were classified by Gelfand and Ponomarev [Russian Math. Surveys 23 (1968) 1-58] by method of linear relations. The classification of (A,B) over any field was derived by Nazarova, Roiter, Sergeichuk, and Bondarenko [J. Soviet Math. 3 (1975) 636-654] from the classification of finitely generated modules over a dyad of two local Dedekind rings. We give canonical matrices of (A,B) over any field in an explicit form and our proof is constructive: the matrices of (A,B) are sequentially reduced to their canonical form by similarity transformations (A,B)?(S^-1AS,S^-1BS).     

Subalgebras of matrix algebras generated by companion matrices

Let f,g∈Z[X] be monic polynomials of degree n and let C,D∈M_n(Z) be the corresponding companion matrices. We find necessary and sufficient conditions for the subalgebra Z〈C,D〉 to be a sublattice of finite index in the full integral lattice M_n(Z), in which case we compute the exact value of this index in terms of the resultant of f and g. If R is a commutative ring with identity we determine when R〈C,D〉=M_n(R), in which case a presentation for M_n(R) in terms of C and D is given.     

On the number of matrices and a random matrix with prescribed row and column sums and 0-1 entries

We consider the set Σ(R,C) of all m×n matrices having 0-1 entries and prescribed row sums R=(r₁,…,rm) and column sums C=(c₁,…,cn). We prove an asymptotic estimate for the cardinality |Σ(R,C)| via the solution to a convex optimization problem. We show that if Σ(R,C) is sufficiently large, then a random matrix D∈Σ(R,C) sampled from the uniform probability measure in Σ(R,C) with high probability is close to a particular matrix Z=Z(R,C) that maximizes the sum of entropies of entries among all matrices with row sums R, column sums C and entries between 0 and 1. Similar results are obtained for 0-1 matrices with prescribed row and column sums and assigned zeros in some positions.     

Generalized Hankel matrices of Markov parameters and their applications to control problems

The concept of Hankel matrices of Markov parameters associated with two polynomials is generalized for matrices. The generalized Hankel matrices of Markov parameters are then used to develop methods for testing the relative primeness of two matrices A and B, for determining stability and inertia of a matrix, and for constructing a class of matrices C such that A + C has a desired spectrum. Neither the method of construction of the generalized Hankel matrices nor the methods developed using these matrices require explicit computation of the characteristic polynomial of A (or of B).     

A solution of the affine quadratic inverse eigenvalue problem

The quadratic inverse eigenvalue problem (QIEP) is to find the three matrices M,C, and K, given a set of numbers, closed under complex conjugations, such that these numbers become the eigenvalues of the quadratic pencil P(λ)=λ²M+λC+K. The affine inverse quadratic eigenvalue problem (AQIEP) is the QIEP with an additional constraint that the coefficient matrices belong to an affine family, that is, these matrices are linear combinations of substructured matrices. An affine family of matrices very often arise in vibration engineering modeling and analysis. Research on QIEP and AQIEP are still at developing stage. In this paper, we propose three methods and the associated mathematical theories for solving AQIEP: A Newton method, an alternating projections method, and a hybrid method combining the two. Validity of these methods are illustrated with results on numerical experiments on a spring-mass problem and comparisons are made with these three methods amongst themselves and with another Newton method developed by Elhay and Ram (2002) [12]. The results of our experiments show that the hybrid method takes much smaller number of iterations and converges faster than any of these methods.