A structural characterization of real k-potent matrices

Some well-known characterizations of nonnegative k-potent matrices have been obtained by Flor [P. Flor, On groups of nonnegative matrices, Compositio Math. 21 (1969), pp. 376–382.] and Jeter and Pye [M. Jeter and W. Pye, Nonnegative (s,?t)-potent matrices, Linear Algebra Appl. 45 (1982), pp. 109–121.]. In this article, we obtain a structural characterization of a real k-potent matrix A, provided that (sgn(A)) ^k+1 is unambiguously defined, regardless of whether A is nonnegative or not.     

Rank-one nonincreasing mappings on triangular matrices and some related preserver problems

Let T_n (F) be the algebra of all n×n upper triangular matrices over an arbitrary field F. We first characterize those rank-one nonincreasing mappings ψ: T_n (F)→T_m (F)n?m such that ψ(I_n ) is of rank n. We next deduce from this result certain types of singular rank-one r-potent preservers and nonzero r-potent preservers on T_n (F). Characterizations of certain classes of homomorphisms and semi-homomorphisms on T_n (F) are also given.     

关于四个三幂等阵线性组合的可逆性和群逆

本文研究了四个三幂等阵线性组合的可逆性及群逆.利用矩阵分解的方法,获得了它们可逆及群逆的一些条件,并得到其逆和群逆的计算公式,这些结论完善了k幂等阵可逆性理论.     

Nonsingularity and group invertibility of linear combinations of two k-potent matrices

An n × n complex matrix A is said to be k-potent if A ^k = A. Let T ₁ and T ₂ be k-potent and c ₁ and c ₂ be two nonzero complex numbers. We study the range space, null space, nonsingularity and group invertibility of linear combinations T = c ₁ T ₁ + c ₂ T ₂ of two k-potent matrices T ₁ and T ₂.     

A Brauer’s theorem and related results

Given a square matrix A, a Brauer’s theorem [Brauer A., Limits for the characteristic roots of a matrix. IV. Applications to stochastic matrices, Duke Math. J., 1952, 19(1), 75–91] shows how to modify one single eigenvalue of A via a rank-one perturbation without changing any of the remaining eigenvalues. Older and newer results can be considered in the framework of the above theorem. In this paper, we present its application to stabilization of control systems, including the case when the system is noncontrollable. Other applications presented are related to the Jordan form of A and Wielandt’s and Hotelling’s deflations. An extension of the aforementioned Brauer’s result, Rado’s theorem, shows how to modify r eigenvalues of A at the same time via a rank-r perturbation without changing any of the remaining eigenvalues. The same results considered by blocks can be put into the block version framework of the above theorem.     

A new infinite family of minimally nonideal matrices

Minimally nonideal matrices are a key to understanding when the set covering problem can be solved using linear programming. The complete classification of minimally nonideal matrices is an open problem. One of the most important results on these matrices comes from a theorem of Lehman, which gives a property of the core of a minimally nonideal matrix. Cornuéjols and Novick gave a conjecture on the possible cores of minimally nonideal matrices. This paper disproves their conjecture by constructing a new infinite family of square minimally nonideal matrices. In particular, we show that there exists a minimally nonideal matrix with r ones in each row and column for any r?3.     

Properties of normalr-potent matrices

The main goal of this paper is to present several new results concerning r-potent matrices which are also assumed to be normal. Included will be a theorem on the Moore-Penrose generalized inverse of a normal r-potent matrix, an equivalent characterization of a normal r-potent matrix, and some other basic properties. Finally, a generalization of the algebraic formulation of Cochran's theorem will be developed for complex normalr-potent matrices.     

Multilateral Inversion of A r , C r , and D r Basic Hypergeometric Series

In [Electron. J. Combin. 10 (2003), #R10], the author presented a new basic hypergeometric matrix inverse with applications to bilateral basic hypergeometric series. This matrix inversion result was directly extracted from an instance of Bailey’s very-well-poised ₆ψ₆ summation theorem, and involves two infinite matrices which are not lower-triangular. The present paper features three different multivariable generalizations of the above result. These are extracted from Gustafson’s A _r and C _r extensions and from the author’s recent A _r extension of Bailey’s ₆ψ₆ summation formula. By combining these new multidimensional matrix inverses with A _r and D _r extensions of Jackson’s ₈ϕ₇ summation theorem three balanced verywell- poised ₈ψ₈ summation theorems associated to the root systems A _r and C _r are derived.     

Double circulant matrices

Double circulant matrices are introduced and studied. By a matrix-theoretic method, the rank r of a double circulant matrix is computed, and it is shown that any consecutive r rows of the double circulant matrix are linearly independent. As a generalization, multiple circulant matrices are also introduced. Two questions on square double circulant matrices are posed.     

Embedding theorems for classes of GBL-algebras

The poset product construction is used to derive embedding theorems for several classes of generalized basic logic algebras (GBL-algebras). In particular it is shown that every n-potent GBL-algebra is embedded in a poset product of finite n-potent MV-chains, and every normal GBL-algebra is embedded in a poset product of totally ordered GMV-algebras. Representable normal GBL-algebras have poset product embeddings where the poset is a root system. We also give a Conrad-Harvey-Holland-style embedding theorem for commutative GBL-algebras, where the poset factors are the real numbers extended with −∞. Finally, an explicit construction of a generic commutative GBL-algebra is given, and it is shown that every normal GBL-algebra embeds in the conucleus image of a GMV-algebra.     

On Distinguished Solutions of Truncated Matricial Hamburger Moment Problems

We study two slightly different versions of the truncated matricial Hamburger moment problem. A central topic is the construction and investigation of distinguished solutions of both moment problems under consideration. These solutions turn out to be nonnegative Hermitian q × q Borel measures on the real axis which are concentrated on a finite number of points. These points and the corresponding masses will be explicitly described in terms of the given data. Furthermore, we investigate a particular class of sequences (s_j)^∞_{j = 0} of complex q × q matrices for which the corresponding infinite matricial Hamburger moment problem has a unique solution. Our approach is mainly algebraic. It is based on the use of particular matrix polynomials constructed from a nonnegative Hermitian block Hankel matrix. These matrix polynomials are immediate generalizations of the monic orthogonal matrix polynomials associated with a positive Hermitian block Hankel matrix. We generalize a classical theorem due to Kronecker on infinite Hankel matrices of finite rank to block Hankel matrices and discuss its consequences for the nonnegative Hermitian case.     

H‐self‐adjoint matrices. Application to radiosity

In computer graphics, in the radiosity context, a linear system Φx=b must be solved and there exists a diagonal positive matrix H such that H Φ is symmetric. In this article, we extend this property to complex matrices: we are interested in matrices which lead to Hermitian matrices under premultiplication by a Hermitian positive‐definite matrix H. We shall prove that these matrices are self‐adjoint with respect to a particular innerproduct defined on ?ⁿ. As a result, like Hermitian matrices, they have real eigenvalues and they are diagonalizable. We shall also show how to extend the Courant–Fisher theorem to this class of matrices. Finally, we shall give a new preconditioning matrix which really improves the convergence speed of the conjugate gradient method used for solving the radiosity problem. Copyright © 2002 John Wiley & Sons, Ltd.     

On almost normal matrices

An almost normal matrix is defined as an n by n matrix having n − 1 mutually orthogonal eigenvectors. The properties of these matrices are shown to be intermediate between the properties of conventional normal matrices and those of general matrices. In particular, the Schur form of an almost normal matrix can in a certain sense be considered canonical.     

On the eigenvalues of double band matrices

We consider matrices containing two diagonal bands of positive entries. We show that all eigenvalues of such matrices are of the form rζ, where r is a nonnegative real number and ζ is a pth root of unity, where p is the period of the matrix, which is computed from the distance between the bands. We also present a problem in the asymptotics of spectra in which such double band matrices are perturbed by banded matrices.     

Estimates for eigenvalues of stochastic matrices

It is well-known that the eigenvalues of stochastic matrices lie in the unit circle and at least one of them has the value one. Let {1, r 2 , ··· , r N } be the eigenvalues of stochastic matrix X of size N × N . We will present in this paper a simple necessary and sufficient condition for X such that |r j | < 1, j = 2, ··· , N . Moreover, such condition can be very quickly examined by using some search algorithms from graph theory.     

A Hadamard matrix of order 268

The existence of Hadamard matrices of order 268 is established. More generally, suppose that there exist Williamson matrices of orderr. It is shown that this implies the existence of a Hadamard matrix of order 268r. The existence of Baumert-Hall arrays of order 335, and 603 is established as well.     

矩阵几何在保持问题中的几个应用

借助矩阵几何基本定理,关于矩阵空间的某些半线性保持算子和加法保持算子被刻画.例如,秩可加性保持,全矩阵环的弱半自同构,幂等性保持,平方保持,以及交错阵的粘切性保持.     

Conjugate-normal matrices with conjugate-normal submatrices

In studying the reduction of a complex n × n matrix A to its Hessenberg form by the Arnoldi algorithm, T. Huckle discovered that an irreducible Hessenberg normal matrix with a normal leading principal m × m submatrix, where 1 < m < n, actually is tridiagonal. We prove a similar assertion for the conjugate-normal matrices, which play the same role in the theory of unitary congruences as the conventional normal matrices in the theory of unitary similarities. This fact is stated as a purely matrix-theoretic theorem, without any reference to Arnoldi-like algorithms. Bibliography: 2 titles. __________ Translated from Zapiski Nauchnykh Seminarov POMI, Vol. 346, 2007, pp. 21–25.     

An implicit QR algorithm for symmetric semiseparable matrices

The QR algorithm is one of the classical methods to compute the eigendecomposition of a matrix. If it is applied on a dense n × n matrix, this algorithm requires O(n³) operations per iteration step. To reduce this complexity for a symmetric matrix to O(n), the original matrix is first reduced to tridiagonal form using orthogonal similarity transformations. In the report (Report TW360, May 2003) a reduction from a symmetric matrix into a similar semiseparable one is described. In this paper a QR algorithm to compute the eigenvalues of semiseparable matrices is designed where each iteration step requires O(n) operations. Hence, combined with the reduction to semiseparable form, the eigenvalues of symmetric matrices can be computed via intermediate semiseparable matrices, instead of tridiagonal ones. The eigenvectors of the intermediate semiseparable matrix will be computed by applying inverse iteration to this matrix. This will be achieved by using an O(n) system solver, for semiseparable matrices. A combination of the previous steps leads to an algorithm for computing the eigenvalue decompositions of semiseparable matrices. Combined with the reduction of a symmetric matrix towards semiseparable form, this algorithm can also be used to calculate the eigenvalue decomposition of symmetric matrices. The presented algorithm has the same order of complexity as the tridiagonal approach, but has larger lower order terms. Numerical experiments illustrate the complexity and the numerical accuracy of the proposed method. Copyright © 2005 John Wiley & Sons, Ltd.     

Residuated Structures,Concentric Sums and Finiteness Conditions

This article is motivated by a concern with finiteness conditions on varieties of residuated structures—particularly residuated meet semilattice-ordered commutative monoids. A “concentric sum” construction is developed and is used to prove, among other results, a local finiteness theorem for a class that encompasses all n-potent hoops and all idempotent subdirect products of residuated chains. This in turn implies that a range of residuated lattice-based varieties have the finite embeddability property, whence their quasi-equational theories are decidable. Applications to substructural logics are discussed.