Flat portions on the boundary of the numerical ranges of certain Toeplitz matrices

We give criterions for a flat portion to exist on the boundary of the numerical range of a matrix. A special type of Teoplitz matrices with flat portions on the boundary of its numerical range are constructed. We show that there exist 2 × 2 nilpotent matrices A₁,A₂, an n  × n nilpotent Toeplitz matrix N_n, and an n  × n cyclic permutation matrix S_n(s) such that the numbers of flat portions on the boundaries of W(A₁⊕N_n) and W(A₂⊕S_n(s)) are, respectively, 2(n - 2) and 2n.     

The construction of irreducible normalized representations of the general linear group

A method is described for constructing in an explicit form an irreducible representation T of M_n(F), the set of all n × n matrices over the real or complex field F, satisfying the condition T(A^*)=T^*(A) for all A∈M_n(F).     

Comparison of two norms of matrices

Any complex n × n matrix A satisfies the inequality

A ₁ ≤ n 1/2 A _d

where .₁ is the trace norm and ._d is the norm defined by

Full-size image

,

where B is the set of orthonormal bases in the space of n × 1 matrices. The present work is devoted to the study of matrices A satisfying the identity:

A₁ = n1/2 A _d

This paper is a first step towards a characterization of matrices satisfying this identity. Actually, a workable characterization of matrices subject to this condition is obtained only for n = 2. For n = 3, a partial result on nilpotent matrices is presented. Like our previous study (J. Dazord, Linear Algebra Appl. 254 (1997) 67), this study is a continuation of the work of M. Marcus and M. Sandy (M. Marcus and M. Sandy, Linear and Multilinear Algebra 29 (1991) 283). Also this study is related to the work of R. Gabriel on classification of matrices with respect to unitary similarity (see R. Gabriel, J. Riene Angew, Math. 307/308 (1979) 31; R. Gabriel, Math. Z. 200 (1989) 591).     

Equality of higher numerical ranges of matrices and a conjecture of Kippenhahn on Hermitian pencils

Let M_n be the algebra of all n × n complex matrices. For 1 k n, the kth numerical range of A M_n is defined by W_k(A) = (1/k)∑_j^k=1x_j^*Ax_j : x₁, …, x_k is an orthonormal set in ⁿ]. It is known that tr A/n = W_n(A) W_n−1(A) W₁(A). We study the condition on A under which W_m(A) = W_k(A) for some given 1 m < k n. It turns out that this study is closely related to a conjecture of Kippenhahn on Hermitian pencils. A new class of counterexamples to the conjecture is constructed, based on the theory of the numerical range.     

On k-spaces of real matrices

It is shown that if W is a linear subspace of real n × n matrices, such that rank (A) = k for all 0 ≠ A ∈ W, then dim W≤ n. If dim W = n.5≤ n is prime, and 2 is primitive modulo n then k =1.     

Linear mappings which are rank-k nonincreasing, II

We prove the following result. Let F be an infinite field of characteristic other than two. Let k be a positive integer. Let S_n(F) denote the space of all n × n symmetric matrices with entries in F, and let T:S_n(F)→S_n(F) be a linear operator. Suppose that T is rank-k nonincreasing and its image contains a matrix with rank higher than K. Then, there exist λεF and PεF^n,n such that T(A)=λPAP^t for all AεS_n(F). λ can be chosen to be 1 if F is algebraically closed and ±1 if F=R, the real field.     

An approximate, multivariable version of Specht's theorem

In this article we provide generalizations of Specht's theorem which states that two n × n matrices A and B are unitarily equivalent if and only if all traces of words in two non-commuting variables applied to the pairs (A, A*) and (B, B*) coincide. First, we obtain conditions which allow us to extend this to simultaneous similarity or unitary equivalence of families of operators, and secondly, we show that it suffices to consider a more restricted family of functions when comparing traces. Our results do not require the traces of words in (A, A*) and (B, B*) to coincide, but only to be close.     

A matrix problem associated with computing Cohen-Macaulay type

Suppose A∈M_n×m(F), B∈M_n×t(F) for some field F. Define Г(AB) to be the set of n×n diagonal matrices D such that the column space of DA is contained in the column space of B. In this paper we determine dim Г(AB). For matrices AB of the same rank we provide an algorithm for computing dim Г(AB).     

Additive Maps Preserving Moore-Penrose Inverses of Matrices on Symmetric Matrix Spaces

Suppose F is a field of characteristic not 2. Let M_nF and S_nF be the n × n full matrix space and symmetric matrix space over F, respectively. All additive maps from S_nF to S_nF (respectively, M_nF) preserving Moore-Penrose inverses of matrices are characterized. We first characterize all additive Moore-Penrose inverse preserving maps from S_nF to M_nF, and thereby, all additive Moore-Penrose inverse preserving maps from S_nF to itself are characterized by restricting the range of these additive maps into the symmetric matrix space.     

An inequality for M-matrices

If AB are n × n M matrices with dominant principal diagonal, we show that 3[det(A + B)]^1/n ≥ (det A)^1/n + (det B)^1/n.     

On application of the Lanczos method to solution of some partial differential equations

Let A be a square symmetric n × n matrix, φ be a vector from ⁿ, and f be a function defined on the spectral interval of A. The problem of computation of the vector u = f(A)φ arises very often in mathematical physics.

We propose the following method to compute u. First, perform m steps of the Lanczos method with A and φ. Define the spectral Lanczos decomposition method (SLDM) solution as u_m = φ Qf(H)e₁, where Q is the n × m matrix of the m Lanczos vectors and H is the m × m tridiagonal symmetric matrix of the Lanczos method. We obtain estimates for u − u_m that are stable in the presence of computer round-off errors when using the simple Lanczos method.

We concentrate on computation of exp(− tA)φ, when A is nonnegative definite. Error estimates for this special case show superconvergence of the SLDM solution. Sample computational results are given for the two-dimensional equation of heat conduction. These results show that computational costs are reduced by a factor between 3 and 90 compared to the most efficient explicit time-stepping schemes. Finally, we consider application of SLDM to hyperbolic and elliptic equations.     

Cases of equality for the spectral norm submultiplicativity of the hadamard product

In this note, we characterize those pairs of nonzero r-by-d complex matrices that satisfy N₂(A ∘ B) = N₂(A)N₂(B), in which N₂(·) is the spectral norm and · is the Hadamard product.     

Spherical functions and immanants

Let λ be an irreducible character of S_n corresponding to the partition (r,s) of n. Let A be a positive semidefinite Hermitian n × n matrix. Let d_λ(A) and per(A) be the immanants corresponding to λ and to the trivial character of S_n, respectively. A proof of the inequality dλ(A)≤λ(id)per(A) is given.     

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.     

Combinatorial theorems on contractive mappings in power sets

We prove that to every positive integer n there exists a positive integer h such that the following holds: If S is a set of h elements and ƒ a mapping of the power set of S into such that ƒ(T)T for all T , then there exists a strictly increasing sequence T₁T_n of subsets of S such that one of the following three possibilities holds: (a) all sets ƒ(T_i), i= 1,…,n, are equal; (b) for all i=1,…, n, we have ƒ(T_i)=T_i; (c) T_i=ƒ(T_i+1) for all i= 1,…,n-1. This theorem generalizes theorems of the author, Rado, and Leeb. It has applications for subtrees in power sets.     

Krylov subspace methods for eigenvalues with special properties and their analysis for normal matrices

In this paper we propose a general approach by which eigenvalues with a special property of a given matrix A can be obtained. In this approach we first determine a scalar function ψ: C → C whose modulus is maximized by the eigenvalues that have the special property. Next, we compute the generalized power iterations uinj + 1 = ψ(A)u_j, j = 0, 1,…, where u₀ is an arbitrary initial vector. Finally, we apply known Krylov subspace methods, such as the Arnoldi and Lanczos methods, to the vector u_n for some sufficiently large n. We can also apply the simultaneous iteration method to the subspace span{x⁽ⁿ⁾₁,…,x⁽ⁿ⁾_k} with some sufficiently large n, where x^(j+1)_m = ψ(A)x^(j)_m, j = 0, 1,…, m = 1,…, k. In all cases the resulting Ritz pairs are approximations to the eigenpairs of A with the special property. We provide a rather thorough convergence analysis of the approach involving all three methods as n → ∞ for the case in which A is a normal matrix. We also discuss the connections and similarities of our approach with the existing methods and approaches in the literature.     

Multiplicative properties of generalized matrix functions

We consider scalar-valued matrix functions for n×n matrices A=(a_ij) defined by Where G is a subgroup of S_n the group of permutations on n letters, and χ is a linear character of G. Two such functions are the permanent and the determinant. A function (1) is multiplicative on a semigroup S of n×n matrices if d(AB)=d(A)d(B) AB∈S.

With mild restrictions on the underlying scalar ring we show that every element of a semigroup containing the diagonal matrices on which (1) is multiplicative can have at most one nonzero diagonal(i.e., diagonal with all nonzero entries)and conversely, provided that χ is the principal character(χ≡1).     

The existence of Schröder designs with equal-sized holes

A holey Schröder design of type h₁^n₁h₂^n₂ … h_k^n_k (HSD(h₁^n₁h₂^n₂ … h_k^n_k)) is equivalent to a frame idempotent Schröder quasigroup (FISQ(h₁^n₁h₂^n₂ … h_k^n_k)) of order n with n_i missing subquasigroups (holes) of order h_i, (1 i k), which are disjoint and spanning, that is, Σ_{1 i k} n_ih_i = n. In this paper, it is shown that an HSD(hⁿ) exists if and only if h²n(n − 1) 0 (mod 4) with expceptions (h, n) ε {{(1,5),(1,9),(2,4)}} and the possible exception of (h, n) = (6,4).