A bandstructure-invariant deflation for real symmetric matrices

By means of an eigenvector and eigenvalue of a real symmetric matrix A, a unitary matrix U is constructed such that U¹AU deflates A and, moreover, the transformation preserves the bandstructure.     

Spin Leonard pairs

Let ${\mathbb K}$ denote a field, and let V denote a vector space over ${\mathbb K}$ of finite positive dimension. A pair A, A* of linear operators on V is said to be a Leonard pair on V whenever for each B∈{A, A*}, there exists a basis of V with respect to which the matrix representing B is diagonal and the matrix representing the other member of the pair is irreducible tridiagonal. A Leonard pair A, A* on V is said to be a spin Leonard pair whenever there exist invertible linear operators U, U* on V such that UA = A U, U*A* = A*U*, and UA* U ^?1 = U*^?1 AU*. In this case, we refer to U, U* as a Boltzmann pair for A, A*. We characterize the spin Leonard pairs. This characterization involves explicit formulas for the entries of the matrices that represent A and A* with respect to a particular basis. The formulas are expressed in terms of four algebraically independent parameters. We describe all Boltzmann pairs for a spin Leonard pair in terms of these parameters. We then describe all spin Leonard pairs associated with a given Boltzmann pair. We also describe the relationship between spin Leonard pairs and modular Leonard triples. We note a modular group action on each isomorphism class of spin Leonard pairs.     

On simultaneous diagonalization of one Hermitian and one symmetric form

It is remarked that if A, B ? M_n(C), A = A^t, and B? = B^t, B positive definite, there exists a nonsingular matrix U such that (1) ū^tBU = I and (2) U^tAU is a diagonal matrix with nonnegative entries. Some related actions of the real orthogonal group and equations involving the unitary group are studied.     

Upper triangularization of matrices by permutations and lower triangular similarity transformations

Let A be an arbitary (square) matrix. As is well known, there exists an invertible matrix S such that S^-1AS is upper triangular. The present paper is concerned with the observation that S can always be chosen in the form S=∏L, where ∏ is a permutation matrix and L is lower triangular. Assuming that the eigenvalues of A are given, the matrices ∏, L, and U=L^-1∏^-1A∏L are constructed in an explicit way. The construction gives insight into the freedom one has in choosing the permutation matrix ∏. Two cases where ∏ can be chosen to be the identity matrix are discussed (A diagonable, A a low order Toeplitz matrix). There is a connection with systems theory.     

Norms of certain Jordan elementary operators

Let H be a complex Hilbert space and let B(H) denote the algebra of all bounded linear operators on H. For A,B∈B(H), the Jordan elementary operator UA,B is defined by UA,B(X)=AXB+BXA, ∀X∈B(H). In this short note, we discuss the norm of UA,B. We show that if dimH=2 and ‖UA,B‖=‖A‖‖B‖, then either AB^∗ or B^∗A is 0. We give some examples of Jordan elementary operators UA,B such that ‖UA,B‖=‖A‖‖B‖ but AB^∗≠0 and B^∗A≠0, which answer negatively a question posed by M. Boumazgour in [M. Boumazgour, Norm inequalities for sums of two basic elementary operators, J. Math. Anal. Appl. 342 (2008) 386-393].     

Hermitian pencils with a cubic minimal polynomial

Let A be an n × n complex matrix and write A = H + iK, where H and K are Hermitian matrices. We show that if the minimal polynomial of the pencil xH + yK has degree 3, then there is a unitary matrix U such that U^-1AU is block diagonal with blocks of size 3 × 3 or smaller. This is a special case of a conjecture made by Kippenhahn in 1951.     

Sufficiency of Favard's condition for a class of band-dominated operators on the axis

The purpose of this paper is to show that, for a large class of band-dominated operators on ?^∞(Z,U), with U being a complex Banach space, the injectivity of all limit operators of A already implies their invertibility and the uniform boundedness of their inverses. The latter property is known to be equivalent to the invertibility at infinity of A, which, on the other hand, is often equivalent to the Fredholmness of A. As a consequence, for operators A in the Wiener algebra, we can characterize the essential spectrum of A on ?p(Z,U), regardless of p∈[1,∞], as the union of point spectra of its limit operators considered as acting on ?^∞(Z,U).     

Some observations on the Youla form and conjugate-normal matrices

Two square complex matrices A, B are said to be unitarily congruent if there is a unitary matrix U such that A = UBU^T. The Youla form is a canonical form under unitary congruence. We give a simple derivation of this form using coninvariant subspaces. For the special class of conjugate-normal matrices the associated Youla form is discussed.     

Nonintegral criterion for oscillations of linear Hamiltonian matrix systems

In this paper we present nonintegral criteria for oscillation of linear Hamiltonian matrix system U^′=A(x)U+B(x)V, V^′=C(x)U−A^*(x)V under the hypothesis (H): A(x), B(x)=B^*(x)>0, and C(x)=C^*(x) are 2×2 matrices of real valued continuous functions on the interval I=[a,∞),(−∞<a). These criteria are conditions of algebraic type only. Our results are also useful for the detection of the oscillation of particular matrix differential systems.     

On the Schur multiplier norm of matrices

The Schur product of two n×n complex matrices A=(a_ij), B=(b_ij) is defined by A°B=(a_ijb_ij. By a result of Schur [2], the algebra of n×n matrices with Schur product and the usual addition is a commutative Banach algebra under the operator norm (the norm of the operator defined on $\text{C}$ⁿ by the matrix). For a fixed matrix A, the norm of the operator B?A°B on this Banach algebra is called the Schur multiplier norm of A, and is denoted by ∥A∥^m. It is proved here that $\text{∥A∥=∥U}{}^1\text{AU∥}{}_{\mathrm{m}}$ for all unitary U (where ∥·∥ denotes the operator norm) iff A is a scalar multiple of a unitary matrix; and that ∥A∥_m=∥A∥ iff there exist two permutations P, Q, a p×p (1?p?n) unitary U, an (n?p)×(n?p)1 contraction C, and a nonnegative number λ such that

$\text{A=λP}\text{U}\text{0}\text{0}\text{C}\text{Q;}$

and this is so iff $\text{∥A°}\text{A}\text{?}\text{∥=∥A∥}{}^2$, where ā is the matrix obtained by taking entrywise conjugates of A.     

Inverse matrix representation with one triangular array

We describe a technique that permits the representation of the inverse of a matrix A with only one additional triangular array. Let $\text{L1A = U}$, with L lower and U upper triangular arrays of order N. Algorithms are presented that use A and L to compute the matrix-vector products $\text{A}{}^{-1}\text{1b}$ and $\text{b}{}^{\mathrm{T}}\text{1A}{}^{-1}$ with N² multiplications and additions. The array L can be computed, with N³/3 multiplications, with a technique that avoids the computation of U. Standard Gaussian elimination simultaneously computes L and U as follows: start with $\text{I1A = A}$, where I is the identity matrix; perform identical linear combinations of rows on I and on the right hand side array A; gradually transform I into L and A into U. At an intermediate stage, where A has not yet been fully triangularized, we have $\text{L′1A = U′.L′}$ and Ú represent one of the pairs of arrays present before each linear combination of rows is performed. The key observation is that we only need two elements of Ú to compute each linear combination of rows of ?. Compute them with a scalar product of the appropriate rows of ? and columns of A. Instead of storing the arrays Ú, recompute their few needed elements whenever necessary.     

A conjecture of Kippenhahn about the characteristic polynomial of a pencil generated by two Hermitian matrices. II

Let A be an n × n matrix; write A = H+iK, where i²=—1 and H and K are Hermitian. Let f(x,y,z) = det(zI?xH?yK). We first show that a pair of matrices over an algebraically closed field, which satisfy quadratic polynomials, can be put into block, upper triangular form, with diagonal blocks of size 1×1 or 2×2, via a simultaneous similarity. This is used to prove that if $\text{f(x,y,z) = [g(x,y,z)]}{}^{\mathrm{<mtext>n</mtext><mtext>2</mtext>}}$, where g has degree 2, then for some unitary matrix U, the matrix U¹AU is the direct sum of $\text{n}\text{2}$ copies of a 2×2 matrix A₁, where A₁ is determined, up to unitary similarity, by the polynomial g(x,y,z). We use the connection between f(x,y,z) and the numerical range of A to investigate the case where f(x,y,z) has the form (z?αax? βy)^r[g(x,y,z)]^s, where g(x,y,z) is irreducible of degree 2.     

On a conjecture of Kippenhahn about the characteristic polynomial of a pencil generated by two Hermitian matrices. I

Let A be an n × n complex matrix, and write A = H + iK, where i² = ?1 and H and K are Hermitian matrices. The characteristic polynomial of the pencil xH + yK is f(x, y, z) = det(zI ? xH ? yK). Suppose f(x, y, z) is factored into a product of irreducible polynomials. Kippenhahn [5, p. 212] conjectured that if there is a repeated factor, then there is a unitary matrix U such that U^?1AU is block diagonal. We prove that if f(x, y, z) has a linear factor of multiplicity greater than n?3, then H and K have a common eigenvector. This may be viewed as a special case of Kippenhahn’s conjecture.     

Factorization of nonnegative matrices—II

Suppose A is an n×n nonnegative matrix. Necessary and sufficient conditions are given for A to be factored as LU, where L is a lower triangular nonnegative matrix, and U is an upper triangular nonnegative matrix with u_ii = 1.     

Exponential sums and rectangular partitions

Let F denote a finite field with q=p^f elements, and let σ(A) equal the trace of the square matrix A. This paper evaluates exponential sums of the form S(E,X₁,…,X_n)e{?σ(CX₁?X_nE)}, where S(E,X₁,…,X_n) denotes a summation over all matrices E,X₁,…,X_n of appropriate sizes over F, and C is a fixed matrix. This evaluation is then applied to the problem of counting ranked solutions to matrix equations of the form U₁?U_αA+DV₁?V_β=B where A,B,D are fixed matrices over F.     

Metrics defined via discrepancy functions

We introduce the notion of a discrepancy function, as an extended real-valued function that assigns to a pair (A,U) of sets a nonnegative extended real number ω(A,U), satisfying specific properties. The pairs (A,U) are certain pairs of sets such that A⊆U, and for fixed A, the function ω takes on arbitrarily small nonnegative values as U varies. We present natural examples of discrepancy functions and show how they can be used to define traditional pseudo-metrics, quasimetrics and metrics on hyperspaces of topological spaces and measure spaces.     

Two-sided hyperbolic SVD

In this paper, we propose the two-sided hyperbolic SVD (2HSVD) for square matrices, i.e., A=UΣV^[∗], where U and V^[∗] are J-unitary (J=diag(±1)) and Σ is a real diagonal matrix of “double-hyperbolic” singular values. We show that, with some natural conditions, such decomposition exists without the use of hyperexchange matrices. In other words, U and V^[∗] are really J-unitary with regard to J and not some matrix which is permutationally similar to matrix J. We provide full characterization of 2HSVD and completely relate it to the semidefinite J-polar decomposition.     

Pointwise bounded approximation and Dirichlet algebras

Those open sets U of S² for which A(U) is pointwise boundedly dense in H^∞(U) are characterized in terms of analytic capacity. It is also shown that the real parts of the functions in A(U) are uniformly dense in C_R(∂U) if and only if each component of U is simply connected and A(U) is pointwise boundedly dense in H^∞(U).     

Tor gives the inverse to the Hilbert function of a graded algebra

The Hilbert generating function of Tor^U(A, A) gives the inverse of the Hilbert generating function of U where U is a graded A algebra.