Generalization of some results concerning eigenvalues of a certain class of matrices and some applications

In this note, we present a generalization of some results concerning the spectral properties of a certain class of block matrices. As applications, we study some of its implications on nonnegative matrices and doubly stochastic matrices as well as on graph spectra and graph energy.     

The smallest eigenvalue of large Hankel matrices generated by a deformed Laguerre weight

We study the asymptotic behavior of the smallest eigenvalue, λ_N, of the Hankel (or moments) matrix denoted by , with respect to the weight . An asymptotic expression of the polynomials orthogonal with w(x) is established. Using this, we obtain the specific asymptotic formulas of λ_N in this paper. Applying a parallel numerical algorithm, we get a variety of numerical results of λ_N corresponding to our theoretical calculations.     

The inverse eigenvalue problem of generalized reflexive matrices and its approximation

This paper studies inverse eigenvalue problems of generalized reflexive matrices and their optimal approximations. Necessary and sufficient conditions for the solvability of the problems are derived, the solutions and their optimal approximations are provided.     

On the Drazin inverse of block matrices and generalized Schur complement

In this paper, we give an additive result for the Drazin inverse with its applications, we obtain representations for the Drazin inverse of a 2 × 2 complex block matrix having generalized Schur complement S=D-CA^DB equal to zero or nonsingular. Several situations are analyzed and recent results are generalized [R.E. Hartwig, X. Li, Y. Wei, Representations for the Drazin inverse of a 2×2 block matrix, SIAM J. Matrix Anal. Appl. 27 (3) (2006) 757-771].     

On a Lie-theoretic approach to generalized doubly stochastic matrices and applications

In this article, we study generalized doubly stochastic matrices using the theory of Lie groups and Lie algebras. Applications to the inverse eigenvalue problem for symmetric doubly stochastic matrices are presented.     

On a Lie-theoretic approach to generalized doubly stochastic matrices and applications

In this article, we study generalized doubly stochastic matrices using the theory of Lie groups and Lie algebras. Applications to the inverse eigenvalue problem for symmetric doubly stochastic matrices are presented.     

On a certain family of generalized Laguerre polynomials

Following the work of Schur and Coleman, we prove the generalized Laguerre polynomial is irreducible over the rationals for all n?1 and has Galois group A_n if n+1 is an odd square, and S_n otherwise. We also show that for certain negative integer values of α and certain congruence classes of n modulo 8, the splitting field of L_n^(α)(x) can be embedded in a double cover.     

On the inverse of certain patterned sums of matrices with Kronecker product structures

In this article, we derive explicit expressions for the entries of the inverse of a patterned matrix that is a sum of Kronecker products. This matrix keeps the Kronecker structure under matrix inversion, and it is used, for example, in statistics, in particular in the linear mixed model analysis. The obtained results present new and extended existing algorithms for the inversion of the considered patterned matrices. We also obtain a closed-form inverse in terms of block matrices.     

Eigenvalue-Eigenvector analysis for a class of patterned correlation matrices with an application: A comment

A correlation matrix analyzed by Kotz, Pearn and Wichern (1984) is reanalyzed with known results on balanced ANOVA models.     

Inverse spectral problem for normal matrices and the Gauss-Lucas theorem

We establish an analog of the Cauchy-Poincare interlacing theorem for normal matrices in terms of majorization, and we provide a solution to the corresponding inverse spectral problem. Using this solution we generalize and extend the Gauss-Lucas theorem and prove the old conjecture of de Bruijn-Springer on the location of the roots of a complex polynomial and its derivative and an analog of Rolle's theorem, conjectured by Schoenberg.

     

The left and right inverse eigenvalue problems of generalized reflexive and anti-reflexive matrices

Let n×n complex matrices R and S be nontrivial generalized reflection matrices, i.e., R^∗=R=R⁻¹≠±I_n, S^∗=S=S⁻¹≠±I_n. A complex matrix A with order n is said to be a generalized reflexive (or anti-reflexive ) matrix, if RAS=A (or RAS=−A). In this paper, the solvability conditions of the left and right inverse eigenvalue problems for generalized reflexive and anti-reflexive matrices are derived, and the general solutions are also given. In addition, the associated approximation solutions in the solution sets of the above problems are provided. The results in present paper extend some recent conclusions.     

A characterization of the class of credibility matrices corresponding to a certain class of discrete distributions

Recently (see De Vylder & Goovaerts (1984), this issue) so called credibility matrices have been introduced and studied in the framework of general properties of matrices, such as non-negativity, total positivity etc. In the present note we characterize a class of credibility matrices generated by the normed sequence of functions (p_l, p_l,…, p_n) on K = [0, b] where $\text{p}{}_{\mathrm{i}}\text{(θ) =?(i)g(θ)h}{}^{\mathrm{i}}\text{(θ)}$, i=0, …, n, θ ? K, and where ?, g, h are nonnegative (eventually depending on n, n may be finite or infinite). For simplicity we suppose h to be monotonic and continuous.     

Left and right inverse eigenpairs problem of generalized centrosymmetric matrices and its optimal approximation problem

In this paper, the left and right inverse eigenpairs problem for generalized centrosymmetric matrices is considered. We obtain the necessary and sufficient conditions for the solvability of the problem, and we present the general expression of the solution. The related optimal approximation problem to a given matrix over the solution set is solved. In addition, a numerical algorithm and examples to solve the problem are given.     

On single and double Soules matrices

Until now the concept of a Soules basis matrix of sign patternN consisted of an orthogonal matrix R∈R^n,n, generated in a certain way from a positive n-vector, which has the property that for any diagonal matrix Λ = diag(λ₁, … , λ_n), with λ₁ ? ? ? λ_n ? 0, the symmetric matrix A = RΛR^T has nonnegative entries only. In the present paper we introduce the notion of a pair of double Soules basis matrices of sign patternN which is a pair of matrices (P, Q), each in R^n,n, which are not necessarily orthogonal and which are generated in a certain way from two positive vectors, but such that PQ^T = I and such that for any of the aforementioned diagonal matrices Λ, the matrix A = PΛQ^T (also) has nonnegative entries only. We investigate the interesting properties which such matrices A have.As a preamble to the above investigation we show that the iterates, , generated in the course of the QR-algorithm when it is applied to A = RΛR^T, where R is a Soules basis matrix of sign pattern N, are again symmetric matrices generated by the Soules basis matrices R_k of sign pattern N which are themselves modified as the algorithm progresses.Our work here extends earlier works by Soules and Elsner et al.     

On the hierarchical product of graphs and the generalized binomial tree

In this article we follow the study of the hierarchical product of graphs, an operation recently introduced in the context of networks. A well-known example of such a product is the binomial tree which is the (hierarchical) power of the complete graph on two vertices. An appealing property of this structure is that all the eigenvalues are distinct. Here we show how to obtain a graph with this property by applying the hierarchical product. In particular, we propose a generalization of the binomial tree and study some of its main properties.     

关于周期对称三对角矩阵的广义特征值反问题

在给定部分特征值、部分特征向量及附加条件下提出了一类反问题,并给出了此问题解存在性的证明及求解的算法.