Simultaneous solutions of Sylvester equations and idempotent matrices separating the joint spectrum

We investigate simultaneous solutions of the matrix Sylvester equations A_iX-XB_i=C_i,i=1,2,…,k, where {A₁,…,A_k} and {B₁,…,B_k} are k-tuples of commuting matrices of order m×m and p×p, respectively. We show that the matrix Sylvester equations have a unique solution X for every compatible k-tuple of m×p matrices {C₁,…,C_k} if and only if the joint spectra σ(A₁,…,A_k) and σ(B₁,…,B_k) are disjoint. We discuss the connection between the simultaneous solutions of Sylvester equations and related questions about idempotent matrices separating disjoint subsets of the joint spectrum, spectral mapping for the differences of commuting k-tuples, and a characterization of the joint spectrum via simultaneous solutions of systems of linear equations.     

Automorphisms of Mn,partially ordered by the star order

Let Mn be the space of all n × n matrices with coefficients in [image omitted] or [image omitted], where n ≥ 3. The star order on Mn is defined by [image omitted] iff [image omitted], where A* is the Hermitian adjoint (i.e., the conjugate transpose) of A. We characterize surjective mappings Φ on Mn such that [image omitted] iff [image omitted]. The tools we use are the Fundamental theorem of projective geometry, Wigner's theorem, and the Penrose decomposition, which we need to describe the main result as well.     

Continuity of the spectrum on a class of upper triangular operator matrices

Let B(H) denote the algebra of operators on an infinite dimensional complex Hilbert space H, and let A^○∈B(K) denote the Berberian extension of an operator A∈B(H). It is proved that the set theoretic function σ, the spectrum, is continuous on the set C(i)⊂B(Hi) of operators A for which σ(A)={0} implies A is nilpotent (possibly, the 0 operator) and at every non-zero λ∈σp(A^○) for some operators X and B such that λ∉σp(B) and σ(A^○)={λ}∪σ(B). If CS(m) denotes the set of upper triangular operator matrices , where Aii∈C(i) and Aii has SVEP for all 1?i?m, then σ is continuous on CS(m). It is observed that a considerably large number of the more commonly considered classes of Hilbert space operators constitute sets C(i) and have SVEP.     

Bounds on the inverses of nonnegative triangular matrices with monotonicity properties

Some bounds on the entries and on the norm of the inverse of triangular matrices with nonnegative and monotone entries are found. All the results are obtained by exploiting the properties of the fundamental matrix of the recurrence relation which generates the sequence of the entries of the inverse matrix. One of the results generalizes a theorem contained in a recent article of one of the authors about Toeplitz matrices.     

A new Gershgorin‐type result for the localisation of the spectrum of matrices

We present a Gershgorin's type result on the localisation of the spectrum of a matrix. Our method is elementary as it relies upon the method of Schur complements, but it outperforms the one based on the Cassini ovals of Ostrovski and Brauer. Furthermore, it yields estimates that hold without major differences in the cases of both scalar and operator matrices. Several refinements of known results are obtained.     

On the perturbations of spectra of upper triangular operator matrices

In this paper we investigate perturbations of the regular spectrum of an upper triangular operator matrix such as acting on a Hilbert space H⊕K.     

Geometry of 2×2 Hermitian matrices II

Let Z be a field of characteristic ≠2, D be a quaternion division algebra over Z and have a nonstandard involution of the first kind. The fundamental theorem of geometry of 2× 2 Hermitian matrices over D are proved. Thus, if D is a quaternion division algebra over Z with an involution of the first kind, then the fundamental theorem of geometry of 2× 2 Hermitian matrices over D are obtained.     

Convex hull of powers of a complex number,trinomial equations and the Farey sequence

The color of a complex number is defined as the number of vertices of the convex hull of powers of that number. This induces a coloring of the unit disk. The structure of the set of points where the color changes is investigated here. It is observed that there is a connection between this fractal set and some family of trinomial equations. Three algorithms for coloring the unit disk are described, the last one (related to the Farey sequence) arising out of a conjecture. This conjecture is formulated and proved in this presentation.     

Upper triangular operator matrices with the single-valued extension property

If A=(Aij)_1?i,j?n∈B(X) is an upper triangular Banach space operator such that AiiAij=AijAjj for all 1?i?j?n, then A has SVEP or satisfies (Dunford's) condition (C) or (Bishop's) property (β) or (the decomposition) property (δ) if and only if Aii, 1?i?n, has the corresponding property.     

Approximate real inversion formulas of the gaussian convolution

We shall give very and surprisingly simple approximate real inversion formulas of the Gaussian convolution (the Weierstrass transform) for the first-order Sobolev Hilbert space on the whole real line by using best approximations and the theory of reproducing kernels and by using a good connection with the Tikhonov regularization.     

The projected newton method for solving inverse eigenvalue problems - the case of multiple eigenvaues

This paper deals with the optimal solution of ill-posed linear problems, i.e..linear problems for which the solution operator is unbounded. We consider worst-case ar,and averagecase settings. Our main result is that algorithms having finite error (for a given setting) exist if and only if the solution operator is bounded (in that setting). In the worst-case setting, this means that there is no algorithm for solving ill-posed problems having finite error. In the average-case setting, this means that algorithms having finite error exist if and only lf the solution operator is bounded on the average. If the solution operator is bounded on the average, we find average-case optimal information of cardinality n and optimal algorithms using this information, and show that the average error of these algorithms tends to zero as n→∞. These results are then used to determine the [euro]-complexity, i.e., the minimal costof finding an [euro]-accurate approximation. In the worst-case setting, the [euro]comp1exity of an illposed problem is infinite for all [euro]>0; that is, we cannot find an approximation having finite error and finite cost. In the average-case setting, the [euro]-complexity of an ill-posed problem is infinite for all [euro]>0 iff the solution operator is not bounded on the average, moreover, if the the solutionoperator is bounded on the average, then the [euro]-complexity is finite for all [euro]>0.     

Critical Points and Error Rank in Best H 2 Matrix Rational Approximation of Fixed McMillan Degree

This paper deals with best rational approximation of prescribed McMillan degree to matrix-valued functions in the real Hardy space of the complement of the unit disk endowed with the Frobenius L ₂ -norm. We describe the topological structure of the set of approximants in terms of inner-unstable factorizations. This allows us to establish a two-sided tangential interpolation equation for the critical points of the criterion, and to prove that the rank of the error F-H is at most k-n when F is rational of degree k , and H is critical of degree n . In the particular case where k=n , it follows that H=F is the unique critical point, and this entails a local uniqueness result when approximating near-rational functions. January 23, 1996. Date revised: September 16, 1996.