A characterization of even doubly-stochastic matrices

Even doubly-stochastic matrices are characterized with the aid of the minima of functionals defined by the even diagonals contained in the matrix.     

A note on Cartan matrices for symmetric groups

Using generating functions, a very simple explicit formula for the determinants of the p-Cartan matrices of symmetric groups is given. Our method works also when p is a composite number.Received: 5 September 2001     

A note on refining eigenelements of symmetric matrices

By means of a Fixed Slope Inexact Newton Method we define an Iterative Refinement Process for approximating eigenvalues and eigenvectors of real symmetric matrices.     

A small note on the scaling of symmetric positive definite semiseparable matrices

In this paper we will adapt a known method for diagonal scaling of symmetric positive definite tridiagonal matrices towards the semiseparable case. Based on the fact that a symmetric, positive definite tridiagonal matrix satisfies property A, one can easily construct a diagonal matrix such that has the lowest condition number over all matrices , for any choice of diagonal matrix . Knowing that semiseparable matrices are the inverses of tridiagonal matrices, one can derive similar properties for semiseparable matrices. Here, we will construct the optimal diagonal scaling of a semiseparable matrix, based on a new inversion formula for semiseparable matrices. Some numerical experiments are performed. In a first experiment we compare the condition numbers of the semiseparable matrices before and after the scaling. In a second numerical experiment we compare the scalability of matrices coming from the reduction to semiseparable form and matrices coming from the reduction to tridiagonal form. *The research was partially supported by the Research Council K.U. Leuven, project OT/00/16 (SLAP: Structured Linear Algebra Package), by the Fund for Scientific Research–Flanders (Belgium), projects G.0078.01 (SMA: Structured Matrices and their Applications), G.0176.02 (ANCILA: Asymptotic aNalysis of the Convergence behavior of Iterative methods in numerical Linear Algebra), G.0184.02 (CORFU: Constructive study of Orthogonal Functions) and G.0455.0 (RHPH: Riemann–Hilbert problems, random matrices and Padé–Hermite approximation), and by the Belgian Programme on Interuniversity Poles of Attraction, initiated by the Belgian State, Prime Minister's Office for Science, Technology and Culture, project IUAP V-22 (Dynamical Systems and Control: Computation, Identification & Modelling). The scientific responsibility rests with the authors. The second author participates in the SCCM program, Gates 2B, Stanford University, CA, USA and is also partially supported by the NSF. The first author visited the second one with a grant by the Fund for Scientific Research–Flanders (Belgium).     

A note on properties of splittings of singular symmetric positive semidefinite matrices

Summary. Recently, Benzi and Szyld have published an important paper [1] concerning the existence and uniqueness of splittings for singular matrices. However, the assertion in Theorem 3.9 on the inheriting property of P-regular splitting for singular symmetric positive semidefinite matrices seems to be incorrect. As a complement of paper [1], in this short note we point out that if a matrix T is resulted from a P-regular splitting of a symmetric positive semidefinite matrix A, then splittings induced by T are not all P-regular. Received January 7, 1999 / Published online December 19, 2000     

The harmonic means of diagonals of doubly-stochastic matrices

It is shown that every doubly-stochastic n × n matrix with precisely r positive elements possesses a positive diagonal whose harmonic mean is at least equal to n/r.     

A note on eigenvalue distribution of constraint‐preconditioned symmetric saddle point matrices

In this note, some inaccuracies in the article (Numer. Linear Algebra Appl. 2012; 19:754–772) are pointed out and correct results are presented. Copyright © 2013 John Wiley & Sons, Ltd.     

A result on integral symmetric matrices

Let A be an integral matrix such that det A = 1 mod mA ≡ A^T mod m, where m is odd. It is shown that a symmetric integral matrix B of determinant 1 exists such that B ≡ A mod m. The result is false if m is even.     

A note on idempotent matrices

Let H be an n × n matrix, and let the trace, the rank, the conjugate transpose, the Moore-Penrose inverse, and a g-inverse (or an inner inverse) of H be respectively denoted by trH, ρ(H), H¹, H², and H^?. This note develops two results: (i) the class of idempotent g-inverse of an idempotent matrix, and (ii) if H is an n × n matrix and ρ(H) = trH, then $\text{tr}\text{(H}{}^2\text{H}{}^2\text{H}{}^1\text{) ? ρ(H)}$, and the equality holds iff H is idempotent. This result is compared with the previous result of Khatri (1983), and some consequences of (i) and (ii) are given.     

A note on stable matrices

A new similarity-canonical form for stable matrices is given in the real and complex cases, and is used to derive new proofs for the (respective) real and complex cases of the Stein-Pfeffer theorem.     

A note on fast approximate minimum degree orderings for symmetric matrices with some dense rows

Recently, a number of variants of the approximate minimum degree algorithm have been proposed that aim to efficiently order symmetric matrices containing some dense rows. We compare the performance of these variants on a range of problems and highlight their potential limitations. This leads us to propose a new variant that offers both speed and robustness. Copyright © 2009 John Wiley & Sons, Ltd.     

A note on labeled symmetric graphs

By using the known results of groups and graphs, we determine the number of labeled symmetric graphs with a prime number of vertices.