Linear systems and determinantal random point fields

In random matrix theory, determinantal random point fields describe the distribution of eigenvalues of self-adjoint matrices from the generalized unitary ensemble. This paper considers symmetric Hamiltonian systems and determines the properties of kernels and associated determinantal random point fields that arise from them; this extends work of Tracy and Widom. The inverse spectral problem for self-adjoint Hankel operators gives sufficient conditions for a self-adjoint operator to be the Hankel operator on L²(0,∞) from a linear system in continuous time; thus this paper expresses certain kernels as squares of Hankel operators. For suitable linear systems (−A,B,C) with one-dimensional input and output spaces, there exists a Hankel operator Γ with kernel ?(x)(s+t)=Ce−(2x+s+t)AB such that gx(z)=det(I+(z−1)ΓΓ†) is the generating function of a determinantal random point field on (0,∞). The inverse scattering transform for the Zakharov-Shabat system involves a Gelfand-Levitan integral equation such that the trace of the diagonal of the solution gives . When A?0 is a finite matrix and B=C†, there exists a determinantal random point field such that the largest point has a generalised logistic distribution.     

Hankel matrices and the infinite companion

A formula of Barnett type relating the Bezoutian B(f,g) to the Hankel matrix H(g/f) is extended to rectangular Bezoutians. The proof is based on an interesting relation between the family of all Hankel matrices corresponding to the Markov parameters of g/f and the infinite companion matrix corresponding to f.     

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.     

Strong shift equivalence and shear adjacency of nonnegative square integer matrices

For two square matrices A, B of possibly different sizes with nonnegative integer entries, write A ≈₁ B if A = RS and B = SR for some two nonnegative integer matrices R,S. The transitive closure of this relation is called strong shift equivalence and is important in symbolic dynamics, where it has been shown by R.F. Williams to characterize the isomorphism of two topological Markov chains with transition matrices A and B. One invariant is the characteristic polynomial up to factors of λ. However, no procedure for deciding strong shift equivalence is known, even for 2×2 matrices A, B. In fact, for n × n matrices with n > 2, no nontrivial sufficient condition is known. This paper presents such a sufficient condition: that A and B are in the same component of a directed graph whose vertices are all n × n nonnegative integer matrices sharing a fixed characteristic polynomial and whose edges correspond to certain elementary similarities. For n > 2 this result gives confirmation of strong shift equivalences that previously could not be verified; for n = 2, previous results are strengthened and the structure of the directed graph is determined.     

Singular value inequalities for matrix sums and minors

This paper gives new proofs for certain inequalities previously established by the author involving sums of singular values of matrices A, B, C = A + B, and also sums of singular values of A, B, and C when A, B are complementary submatrices of C. Some new facts concerning these inequalities are also included.     

Separability of distinct Boolean rank-1 matrices

For two distinct rank-1 matricesA andB, a rank-1 matrixC is called aseparating matrix ofA andB if the rank ofA+C is 2 but the rank ofB+C is 1 or vice versa. In this case, rank-1 matricesA andB are said to beseparable. We show that every pair of distinct Boolean rank-1 matrices are separable.     

Note on the weighted generalized inverse of the product of matrices

The weighted generalized inverse has several important applications in the theoretical research and numerical computations. In this paper, we present a representation for the weighted generalized inverse of the product of two matrices A and B.     

Generalized inverse-positivity and splittings of M-matrices

The concepts of matrix monotonicity, generalized inverse-positivity and splittings are investigated and are used to characterize the class of all M-matrices A, extending the well-known property that A^?1?0 whenever A is nonsingular. These conditions are grouped into classes in order to identify those that are equivalent for arbitrary real matrices A. It is shown how the nonnegativity of a generalized left inverse of A plays a fundamental role in such characterizations, thereby extending recent work by one of the authors, by Meyer and Stadelmaier and by Rothblum. In addition, new characterizations are provided for the class of M-matrices with “property c”; that is, matrices A having a representation A=sI?B, s>0, B?0, where the powers of $\text{(}\text{1}\text{s}\text{)B}$ converge. Applications of these results to the study of iterative methods for solving arbitrary systems of linear equations are given elsewhere.     

Globally convergent Jacobi methods for positive definite matrix pairs

The paper derives and investigates the Jacobi methods for the generalized eigenvalue problem A x = λ B x, where A is a symmetric and B is a symmetric positive definite matrix. The methods first “normalize” B to have the unit diagonal and then maintain that property during the iterative process. The global convergence is proved for all such methods. That result is obtained for the large class of generalized serial strategies from Hari and Begovi? Kova? (Trans. Numer. Anal. (ETNA) 47, 107–147, 2017). Preliminary numerical tests confirm a high relative accuracy of some of those methods, provided that both matrices are positive definite and the spectral condition numbers of Δ _A AΔ _A and Δ _B BΔ _B are small, for some nonsingular diagonal matrices Δ _A and Δ _B .     

Generalized iterative methods for semidefinite linear systems

We consider iterative methods for semidefinite systems Ax = b based on splittings A = B ? C, where B is not necessarily nonsingular. Necessary and sufficient conditions for convergence are obtained. These are then used to obtain convergence results for block SOR, block SSOR, and block JOR methods for matrices with semidefinite block diagonal.     

Generalized Drazin inverses of anti-triangular block matrices

In this paper we give formulae for the generalized Drazin inverse Md of an anti-triangular matrix in two different ways: one is to express Md in terms of Ad with arbitrary B and C, the other is to express Md in terms of Bd and Cd with arbitrary A. Moreover, the results are applied to obtain generalized Drazin inverses of various structured matrices and some special cases are analyzed.     

Nonsingular solutions of TA−BT=C

When A, B and C are given square matrices and C is of rank one, sufficient conditions are given for every solution to be nonsingular when solutions exist. When C has arbitrary rank, some sufficient conditions are given; and when, additionally, A and B have disjoint spectra, necessary conditions are given.     

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.     

On the matrix monotonicity of generalized inversion

Let A, B be two matrices of the same order. We write A>B(A>?B) iff A? B is a positive (semi-) definite hermitian matrix. In this paper the well-known result if

$\text{A>B>θ, then B}{}^{\mathrm{?1}}\text{>A}{}^{\mathrm{?1}}\text{> θ}$

(cf. Bellman [1, p.59]) is extended to the generalized inverses of certain types of pairs of singular matrices A,B?θ, where θ denotes the zero matrix of appropriate order.     

Symmetrization of Cuntz’ Picture for the Kasparov <Emphasis Type="Italic">KK</Emphasis>-Bifunctor

Given C^*-algebras A and B, we generalize the notion of a quasi-homomorphism from A to B in the sense of Cuntz by considering quasi-homomorphisms from some C^*-algebra C to B such that C surjects onto A and the two maps forming the quasi-homomorphism agree on the kernel of this surjection. Under an additional assumption, the group of homotopy classes of such generalized quasi-homomorphisms coincides with KK(A, B). This makes the definition of the Kasparov bifunctor slightly more symmetric and provides more flexibility in constructing elements of KK-groups. These generalized quasi-homomorphisms can be viewed as pairs of maps directly from A (instead of various C’s), but these maps need not be *-homomorphisms.     

On generalized stable rings

In this paper, we introduce the class of generalized stable rings and investigate equivalent characterizations of such rings. We show that End_R R is a generalized stable ring if and only if any right H-module decompositions M = A ₁ + B ₁ = A ₂ + B ₂ with A ₁ ? A ? A ₂ implies that there exist C,D,E ≤ M such that M = C + D B ₁ = c + E + B ₂ with.C ? A. Also we show that every generalized stable ring is a GE-ring and matrices over generalized stable regular ring can be diagonalized by some weakly invertible matrices.     

Presenting generalized Schur algebras in types B, C, D

We give explicit presentations by generators and relations of certain generalized Schur algebras (associated with tensor powers of the natural representation) in types B, C, D. This extends previous results in type A obtained by two of the authors. The presentation is compatible with the Serre presentation of the corresponding universal enveloping algebra. In types C, D this gives a presentation of the corresponding classical Schur algebra (the image of the representation on a tensor power) since the classical Schur algebra coincides with the generalized Schur algebra in those types. This coincidence between the generalized and classical Schur algebra fails in type B, in general.     

Produkte positiver elemente in formal-reellen Jordan-Algebren

A generalization of the Rayleigh quotient defined for real symmetric matrices to the elements of a formally real Jordan algebra is used here to give a generalization to formally real Jordan algebras of the theorem that for any real symmetric matrix C with tr C > 0 there are positive definite real symmetric matrices A and B with C = AB + BA.