Trace preserving linear transformations on matrix algebras

A characterization is given for all linear transformations on a matrix algebra which preserve (1) the trace (2) the unit matrix (3) the trace and the second elementary symmetric function of the eigenvalues.     

Linear transformations on symmetric matrices

In this paper we study the problem of characterizing those linear transformations on the vector space of symmetric matrices which preserve a fixed rank or the signature.     

一个线性组合定理的证明

利用初等行变换与初等矩阵的关系,可证明线性组合定理：初等行变换不改变矩阵中列向量的线性关系.     

Positivity of matrices with generalized matrix functions

Using an elementary fact on matrices we show by a unified approach the positivity of a partitioned positive semidefinite matrix with each square block replaced by a compound matrix, an elementary symmetric function or a generalized matrix function. In addition, we present a refined version of the Thompson determinant compression theorem.     

Linear transformations on matrices: rank 1 preservers and determinant preservers

A theorem of Marcus and Moyls on linear transformations on matrices preserving rank 1 and a classical result of Frobenius on determinant preservers are re-proved by elementary matrix methods.     

A Jacobi eigenreduction algorithm for definite matrix pairs

Summary We propose a Jacobi eigenreduction algorithm for symmetric definite matrix pairsA, J of small to medium-size real symmetric matrices withJ ²=I,J diagonal (neitherJ norA itself need be definite). Our Jacobi reduction works only on one matrix and usesJ-orthogonal elementary congruences which include both trigonometric and hyperbolic rotations and preserve the symmetry throughout the process. For the rotation parameters only the pivotal elements of the current matrix are needed which facilitates parallelization. We prove the global convergence of the method; the quadratic convergence was observed in all experiments. We apply our method in two situations: (i) eigenreducing a single real symmetric matrix and (ii) eigenreducing an overdamped quadratic matrix pencil. In both cases our method is preceded by a symmetric indefinite decomposition and performed in its one-sided variant on the thus obtained factors. Our method outdoes the standard methods like standard Jacobi orqr/ql in accuracy in spite of the use of hyperbolic transformations which are not orthogonal (a theoretical justification of this behaviour is made elsewhere). The accuracy advantage of our method can be particularly drastic if the eigenvalues are of different order. In addition, in working with quadratic pencils our method is shown to either converge or to detect non-overdampedness.     

論矩陣的一種變換

<正> 在本文中,數域限定為複數域.我們要來研究如下的變換:(1)(它將方陣A變成方陣B),式中P表示任意正則陣,P表示P的元素的共軛救構成的陣.所有的變换(1)顯然成羣.這種變換現在姑稱之為種變換.如果二方陣A與B可由一個種變換變此成彼,我們就說,A與B是對相似的.     

Linear operators preserving certain functions on singular values of matrices

We study the structure of those linear operators on the rectangular complex or real matrix spaces that preserve certain functions on singular values. We first do a brief survey on the existing results in the area and then prove a theorem which covers and extends all of them. In particular. our theorem confirms two conjectures about the structure of those linear operators preserving the completely symmetric functions on powers of singular values of matrices.     

Linear operators preserving certain functions on singular values of matrices

We study the structure of those linear operators on the rectangular complex or real matrix spaces that preserve certain functions on singular values. We first do a brief survey on the existing results in the area and then prove a theorem which covers and extends all of them. In particular. our theorem confirms two conjectures about the structure of those linear operators preserving the completely symmetric functions on powers of singular values of matrices.     

An algorithm for the symmetric generalized eigenvalue problem

A new method is presented for the solution of the matrix eigenvalue problem Ax=λBx, where A and B are real symmetric square matrices and B is positive semidefinite. It reduces A and B to diagonal form by congruence transformations that preserve the symmetry of the problem. This method is closely related to the QR algorithm for real symmetric matrices.     

Bijective linear rank preservers for spaces of matrices over antinegative semirings

We classify the bijective linear operators on spaces of matrices over antinegative commutative semirings with no zero divisors which preserve certain rank functions such as the symmetric rank, the factor rank and the tropical rank. We also classify the bijective linear operators on spaces of matrices over the max-plus semiring which preserve the Gondran-Minoux row rank or the Gondran-Minoux column rank.     

Similarity transformations of decomposable matrix polynomials and related questions

A relationship is found between the similarity transformations of decomposable matrix polynomials with relatively prime elementary divisors and the equivalence transformations of the corresponding matrices with scalar entries. Matrices with scalar entries are classified with respect to equivalence transformations based on direct sums of lower triangular almost Toeplitz matrices. This solves the similarity problem for a special class of finite matrix sets over the field of complex numbers. Eventually, this problem reduces to the one of special diagonal equivalence between matrices. Invariants of this equivalence are found.     

Generalized Leibniz functional matrices and factorizations of some well-known matrices

In this paper, we introduce the generalized Leibniz functional matrices and study some algebraic properties of such matrices. To demonstrate applications of these properties, we derive several novel factorization forms of some well-known matrices, such as the complete symmetric polynomial matrix and the elementary symmetric polynomial matrix. In addition, by applying factorizations of the generalized Leibniz functional matrices, we redevelop the known results of factorizations of Stirling matrices of the first and second kind and the generalized Pascal matrix.     

Linear mappings on second symmetric product spaces that Preserve rank less than or equal to one

In this paper we characterize those linear mappings from a second symmetric product space to another which preserve decomposable elements of the form λu⋅u where u is a vector and λ is a scalar. This leads to the corresponding result concerning linear mappings from one vector space of symmetric matrices to another which preserve rank less than or equal to one. We also discuss some consequences of this characterization theorem.     

矩阵初等变换的推广及其应用

矩阵的初等变换及矩阵的分块是矩阵理论中的两个重要方法。本文将初等变换推广到分块矩阵上去，在引进了准初等变换概念后，证明了它的某些性质。本文的目的在于简化某些矩阵运算，并希望本文建立的概念与结论得到更加广泛的应用。     

On functions which preserve the class of Stieltjes matrices

A positive definite symmetric matrix is called a Stieltjes matrix provided that all its off diagonal elements are nonpositive. We characterize functions which preserve the class of Stieltjes matrices.     

A power function of statistical tests dependent on elementary symmetric polynomials

Statistical tests not changed under an affine change of coordinate system are considered in the multivariate analysis. In the case of a multivariate linear model and a model using the canonical correlation analysis, these tests are functions of eigenvalues of matrices following a Wishart distribution. In this paper we prove the monotonicity property of test power functions being functions of elementary symmetric polynomials of eigenvalues of a matrix following a noncentral Wishart distribution.     

Finding Symmetry Groups of Some Quadratic Programming Problems

Solution and analysis of mathematical programming problems may be simplified when these problems are symmetric under appropriate linear transformations. In particular, a knowledge of the symmetries may help decrease the problem dimension, reduce the size of the search space by means of linear cuts. While the previous studies of symmetries in the mathematical programming usually dealt with permutations of coordinates of the solutions space, the present paper considers a larger group of invertible linear transformations. We study a special case of the quadratic programming problem, where the objective function and constraints are given by quadratic forms. We formulate conditions, which allow us to transform the original problem to a new system of coordinates, such that the symmetries may be sought only among orthogonal transformations. In particular, these conditions are satisfied if the sum of all matrices of quadratic forms, involved in the constraints, is a positive definite matrix. We describe the structure and some useful properties of the group of symmetries of the problem. Besides that, the methods of detection of such symmetries are outlined for different special cases as well as for the general case.     

A method of congruent type for linear systems with conjugate-normal coefficient matrices

Minimal residual methods, such as MINRES and GMRES, are well-known iterative versions of direct procedures for reducing a matrix to special condensed forms. The method of reduction used in these procedures is a sequence of unitary similarity transformations, while the condensed form is a tridiagonal matrix (MINRES) or a Hessenberg matrix (GMRES). The algorithm CSYM proposed in the 1990s for solving systems with complex symmetric matrices was based on the tridiagonal reduction performed via unitary congruences rather than similarities. In this paper, we construct an extension of this algorithm to the entire class of conjugate-normal matrices. (Complex symmetric matrices are a part of this class.) Numerical results are presented. They show that, on many occasions, the proposed algorithm has a superior convergence rate compared to GMRES.     

Determinant preserving maps: an infinite dimensional version of a theorem of Frobenius

In this paper we investigate the structure of maps on classes of Hilbert space operators leaving the determinant of linear combinations invariant. Our main result is an infinite dimensional version of the famous theorem of Frobenius about determinant preserving linear maps on matrix algebras. In this theorem of ours, we use the notion of (Fredholm) determinant of bounded Hilbert space operators which differ from the identity by an element of the trace class. The other result of the paper describes the structure of those transformations on sets of positive semidefinite matrices which preserve the determinant of linear combinations with fixed coefficients.