Pentadiagonal Oscillatory Matrices with Two Spectrum in Common

We denote the spectrum of an square matrix A by σ(A), and that of the matrix obtained by deleting the first i rows and columns of A by σ_i(A). It is known that a symmetric pentadiagonal oscillatory (SPO) matrix may be constructed from σ, σ₁ and σ₂. The pairs σ, σ₁ and σ₁, σ₂ must interlace; the construction is not unique; and the conditions on the data which ensure that A is oscillatory are extremely complicated. Given one SPO matrix A, the paper shows that operations may be applied to A to construct a family of such matrices with σ and σ₁ in common. Moreover, given one totally positive (TP) matrix A, we construct a family of TP matrices with σ, σ₁ and σ₂ in common.     

Convergence of block iterative methods for linear systems arising in the numerical solution of Euler equations

Summary We discuss block matrices of the formA=[A _ij ], whereA _ij is ak×k symmetric matrix,A _ij is positive definite andA _ij is negative semidefinite. These matrices are natural block-generalizations of Z-matrices and M-matrices. Matrices of this type arise in the numerical solution of Euler equations in fluid flow computations. We discuss properties of these matrices, in particular we prove convergence of block iterative methods for linear systems with such system matrices.     

Commuting extensions and cubature formulae

Based on a novel point of view on 1-dimensional Gaussian quadrature, we present a new approach to d-dimensional cubature formulae. It is well known that the nodes of 1-dimensional Gaussian quadrature can be computed as eigenvalues of the so-called Jacobi matrix. The d-dimensional analog is that cubature nodes can be obtained from the eigenvalues of certain mutually commuting matrices. These are obtained by extending (adding rows and columns to) certain noncommuting matrices A₁,...,A_d, related to the coordinate operators x₁,...,x_d, in R^d. We prove a correspondence between cubature formulae and “commuting extensions” of A₁,...,A_d, satisfying a compatibility condition which, in appropriate coordinates, constrains certain blocks in the extended matrices to be zero. Thus, the problem of finding cubature formulae can be transformed to the problem of computing (and then simultaneously diagonalizing) commuting extensions. We give a general discussion of existence and of the expected size of commuting extensions and briefly describe our attempts at computing them.     

Characterization of ray pattern matrix whose determinantal region has two components after deleting the origin

Ray nonsingular matrices are generalizations of sign nonsingular matrices. The problem of characterizing ray nonsingular matrices is still open. The study of the determinantal regions R_A of ray pattern matrices is closely related to the study of ray nonsingular matrices. It was proved that if R_A?{0} is disconnected, then it is a union of two opposite open sectors (or open rays). In this paper, we characterize those ray patterns whose determinantal regions become disconnected after deleting the origin. The characterization is based on three classes (F1), (F2) and (F3) of matrices, which can further be characterized in terms of the sets of the distinct signed transversal products of their ray patterns. Moreover, we show that in the fully indecomposable case, a matrix A is in the class (F1) (or (F2), respectively) if and only if A is ray permutation equivalent to a real SNS (or non-SNS, respectively) matrix.     

On the spectral radius and the spectral norm of Hadamard products of nonnegative matrices

We prove the spectral radius inequality ρ(A₁°A₂°?°A_k)?ρ(A₁A₂?A_k) for nonnegative matrices using the ideas of Horn and Zhang. We obtain the inequality ‖A°B‖?ρ(A^TB) for nonnegative matrices, which improves Schur’s classical inequality ‖A°B‖?‖A‖‖B‖, where ‖·‖ denotes the spectral norm. We also give counterexamples to two conjectures about the Hadamard product.     

Simultaneous congruence representations: a special case

We study the problem of representing a pair of algebraic lattices, L₁ and L₀, as Con(A₁) and Con(A₀), respectively, with A₁ an algebra and A₀ a subalgebra of A₁, and we provide such a representation in a special case. Received September 11, 2004; accepted in final form January 7, 2005.     

On approximately simultaneously diagonalizable matrices

A collection A₁, A₂, …, A_k of n × n matrices over the complex numbers C has the ASD property if the matrices can be perturbed by an arbitrarily small amount so that they become simultaneously diagonalizable. Such a collection must perforce be commuting. We show by a direct matrix proof that the ASD property holds for three commuting matrices when one of them is 2-regular (dimension of eigenspaces is at most 2). Corollaries include results of Gerstenhaber and Neubauer-Sethuraman on bounds for the dimension of the algebra generated by A₁, A₂, …, A_k. Even when the ASD property fails, our techniques can produce a good bound on the dimension of this subalgebra. For example, we establish for commuting matrices A₁, …, A_k when one of them is 2-regular. This bound is sharp. One offshoot of our work is the introduction of a new canonical form, the H-form, for matrices over an algebraically closed field. The H-form of a matrix is a sparse “Jordan like” upper triangular matrix which allows us to assume that any commuting matrices are also upper triangular. (The Jordan form itself does not accommodate this.)     

Congruence of Hermitian matrices by Hermitian matrices

Two Hermitian matrices A,B∈M_n(C) are said to be Hermitian-congruent if there exists a nonsingular Hermitian matrix C∈M_n(C) such that B=CAC. In this paper, we give necessary and sufficient conditions for two nonsingular simultaneously unitarily diagonalizable Hermitian matrices A and B to be Hermitian-congruent. Moreover, when A and B are Hermitian-congruent, we describe the possible inertias of the Hermitian matrices C that carry the congruence. We also give necessary and sufficient conditions for any 2-by-2 nonsingular Hermitian matrices to be Hermitian-congruent. In both of the studied cases, we show that if A and B are real and Hermitian-congruent, then they are congruent by a real symmetric matrix. Finally we note that if A and B are 2-by-2 nonsingular real symmetric matrices having the same sign pattern, then there is always a real symmetric matrix C satisfying B=CAC. Moreover, if both matrices are positive, then C can be picked with arbitrary inertia.     

Eigenvalues of products of matrices

Let A and B be n?×?n matrices over an algebraically closed field F. The pair ( A,?B ) is said to be spectrally complete if, for every sequence c₁,…,c_n ∈F such that det (AB)=c₁ ,…,c_n , there exist matrices A′,B,′∈F,^n×n similar to A,?B, respectively, such that A′B′ has eigenvalues c₁,…,c_n . In this article, we describe the spectrally complete pairs. Assuming that A and B are nonsingular, the possible eigenvalues of A′B′ when A′ and B′ run over the sets of the matrices similar to A and B, respectively, were described in a previous article.     

On the singular graph and the Weyr characteristic of anM-matrix

LetA be anM-matrix in standard lower block triangular form, with diagonal blocksA _ii irreducible. LetS be the set of indices such that the diagonal blockA is singular. We define the singular graph ofA to be the setS with partial order defined by > if there exists a chain of non-zero blocksA _i, A_ij, , A_l.Let ₁ be the set of maximal elements ofS, and define thep-th level _p ,p = 2, 3, , inductively as the set of maximal elements ofS \( _{1 p-1}). Denote by _p the number of elements in _p . The Weyr characteristic (associated with 0) ofA is defined to be (A) = ( ₁, ₂,, _h ), where ₁ + + _p = dim KerA ^p ,p = 1, 2, , and _h > 0, _h+1 = 0.Using a special type of basis, called anS-basis, for the generalized eigenspaceE(A) of 0 ofA, we associate a matrixD withA. We show that(A) = ( ₁, , _h) if and only if certain submatricesD _p,p+1 ,p = 1, , h – 1, ofD have full column rank. This condition is also necessary and sufficient forE(A) to have a basis consisting of non-negative vectors, which is a Jordan basis for –A. We also consider a given finite partially ordered setS, and we find a necessary and sufficient condition that allM-matricesA with singular graphS have(A) = ( ₁, , _h). This condition is satisfied ifS is a rooted forest.The work of the second-named author was partly supported by the National Science Foundation, under grant MPS-08618 A02.     

On a class of matrices which arise in the numerical solution of Euler equations

Summary We study block matricesA=[A_ij], where every blockA _ij ^k,k is Hermitian andA _ii is positive definite. We call such a matrix a generalized H-matrix if its block comparison matrix is a generalized M-matrix. These matrices arise in the numerical solution of Euler equations in fluid flow computations and in the study of invariant tori of dynamical systems. We discuss properties of these matrices and we give some equivalent conditions for a matrix to be a generalized H-matrix.Research supported by the Graduiertenkolleg mathematik der Universität Bielefeld     

A result about determinantal divisors

Let Rbe a principal ideal ringR_n the ring of n× nmatrices over R, and d_k (A) the kth determinantal divisor of Afor 1 ? k? n, where Ais any element of R_n , It is shown that if A,BεR_n , det(A) det(B:) ≠ 0, then d_k (AB) ≡ 0 mod d_k (A) d_k (B). If in addition (det(A), det(B)) = 1, then it is also shown that d_k (AB) = d_k (A) d_k (B). This provides a new proof of the multiplicativity of the Smith normal form for matrices with relatively prime determinants.     

Particular formulae for the Moore-Penrose inverse of a columnwise partitioned matrix

An essential part of Cegielski’s [Obtuse cones and Gram matrices with non-negative inverse, Linear Algebra Appl. 335 (2001) 167-181] considerations of some properties of Gram matrices with nonnegative inverses, which are pointed out to be crucial in constructing obtuse cones, consists in developing some particular formulae for the Moore-Penrose inverse of a columnwise partitioned matrix A = (A₁ : A₂) under the assumption that it is of full column rank. In the present paper, these results are generalized and extended. The generalization consists in weakening the assumption mentioned above to the requirement that the ranges of A₁ and A₂ are disjoint, while the extension consists in introducing the conditions referring to the class of all generalized inverses of A.     

On the span of Hadamard products of vectors

Let A₁, … , A_k be positive semidefinite matrices and B₁, … , B_k arbitrary complex matrices of order n. We show that

span{(A₁x)°(A₂x)°?°(A_kx)|x∈Cⁿ}=range(A₁°A₂°?°A_k)     

Some inequalities for communtators and an application to spectral variation

Summary If –I is a positive semidefinite operator andA andB are either both Hermitian or both unitary, then every unitarily invariant norm ofA–B is shown to be bounded by that ofA–B. Some related inequalities are proved. An application leads to a generalization of the Lidskii-Wielandt inequality to matrices similar to Hermitian.Dedicated to the memory of Alexander M. Ostrowski on the occasion of the 100th anniversary of his birth     

Shorted operators of partitioned matrices and application

In this paper, our main objective is to study the effect of appending/deleting a column/row on the shorted operators. It turns out that for matrices A and B for which the shorted operator S(A|B) exists, S(A₁|B₁) of the matrix A₁=[A:a] with respect to the matrix B₁=[B:b], when it exists, is obtained by appending a suitable column to S(A|B). Moreover, if S(A₁|B₁) exists, then S(A|B) exists and is obtained from S(A₁|B₁) by dropping its last column. In the process, we study the effect of appending/deleting a column/row on the space pre-order and the parallel sum of parallel summable matrices. Finally, we specialize to the case of and matrices and study the effect of bordering (by an additional column and a row) on the shorted operator. We conclude the paper with an application to Linear Models with singular dispersion structure.     

Perturbation bounds for theLDL H andLU decompositions

LetA andA+A be Hermitian positive definite matrices. Suppose thatA=LDL ^H and (A+A)=(L+L)(D+D)(L+L)^H are theLDL ^H decompositons ofA andA+A, respectively. In this paper upper bounds on |D| _F and |L| _F are presented. Moreover, perturbation bounds are given for theLU decomposition of a complexn ×n matrix.