Recent documents in Wyoming Scholars Repository
Updated: 4 hours 14 min ago

Brauer's theorem and nonnegative matrices with prescribed diagonal entries

Fri, 2019-02-15 14:17

The problem of the existence and construction of nonnegative matrices with prescribed eigenvalues and diagonal entries is an important inverse problem, interesting by itself, but also necessary to apply a perturbation result, which has played an important role in the study of certain nonnegative inverse spectral problems. A number of partial results about the problem have been published by several authors, mainly by H. \v{S}migoc. In this paper, the relevance of a Brauer's result, and its implication for the nonnegative inverse eigenvalue problem with prescribed diagonal entries is emphasized. As a consequence, given a list of complex numbers of \v{S}migoc type, or a list $\Lambda = \left\{\lambda _{1},\ldots ,\lambda _{n} \right \}$ with $\operatorname{Re}\lambda _{i}\leq 0,$ $\lambda _{1}\geq -\sum\limits_{i=2}^{n}\lambda _{i}$, and $\left\{-\sum\limits_{i=2}^{n}\lambda _{i},\lambda _{2},\ldots ,\lambda _{n} \right\}$ being realizable; and given a list of nonnegative real numbers $% \Gamma = \left\{\gamma _{1},\ldots ,\gamma _{n} \right\}$, the remarkably simple condition $\gamma _{1}+\cdots +\gamma _{n} = \lambda _{1}+\cdots +\lambda _{n}$ is necessary and sufficient for the existence and construction of a realizing matrix with diagonal entries $\Gamma .$ Conditions for more general lists of complex numbers are also given.

Diagonal Sums of Doubly Substochastic Matrices

Fri, 2019-02-15 14:17

Let $\Omega_n$ denote the convex polytope of all $n\times n$ doubly stochastic matrices, and $\omega_{n}$ denote the convex polytope of all $n\times n$ doubly substochastic matrices. For a matrix $A\in\omega_n$, define the sub-defect of $A$ to be the smallest integer $k$ such that there exists an $(n+k)\times(n+k)$ doubly stochastic matrix containing $A$ as a submatrix. Let $\omega_{n,k}$ denote the subset of $\omega_n$ which contains all doubly substochastic matrices with sub-defect $k$. For $\pi$ a permutation of symmetric group of degree $n$, the sequence of elements $a_{1\pi(1)},a_{2\pi(2)}, \ldots, a_{n\pi(n)}$ is called the diagonal of $A$ corresponding to $\pi$. Let $h(A)$ and $l(A)$ denote the maximum and minimum diagonal sums of $A\in \omega_{n,k}$, respectively. In this paper, existing results of $h$ and $l$ functions are extended from $\Omega_n$ to $\omega_{n,k}.$ In addition, an analogue of Sylvesters law of the $h$ function on $\omega_{n,k}$ is proved.

In-sphere property and reverse inequalities for matrix means

Sat, 2019-02-09 18:41

The in-sphere property for matrix means is studied. It is proved that the matrix power mean satisfies in-sphere property with respect to the Hilbert-Schmidt norm. A new characterization of the matrix arithmetic mean is provided. Some reverse AGM inequalities involving unitarily invariant norms and operator monotone functions are also obtained.

Surjective Additive Rank-1 Preservers on Hessenberg Matrices

Sat, 2019-02-09 18:41

Let $H_{n}(\mathbb{F})$ be the space of all $n\times n$ upper Hessenberg matrices over a field~$\mathbb{F}$, where $n$ is a positive integer greater than two. In this paper, surjective additive maps preserving rank-$1$ on $H_{n}(\mathbb{F})$ are characterized.

Solving the Sylvester Equation AX-XB=C when $\sigma(A)\cap\sigma(B)\neq\emptyset$

Tue, 2019-02-05 22:45

The method for solving the Sylvester equation $AX-XB=C$ in complex matrix case, when $\sigma(A)\cap\sigma(B)\neq \emptyset$, by using Jordan normal form is given. Also, the approach via Schur decomposition is presented.

Resolution Of Conjectures Related To Lights Out! And Cartesian Products

Wed, 2019-01-16 22:12

Lights Out!\ is a game played on a $5 \times 5$ grid of lights, or more generally on a graph. Pressing lights on the grid allows the player to turn off neighboring lights. The goal of the game is to start with a given initial configuration of lit lights and reach a state where all lights are out. Two conjectures posed in a recently published paper about Lights Out!\ on Cartesian products of graphs are resolved.

On the Interval Generalized Coupled Matrix Equations

Wed, 2019-01-16 22:12

In this work, the interval generalized coupled matrix equations \begin{equation*} \sum_{j=1}^{p}{{\bf{A}}_{ij}X_{j}}+\sum_{k=1}^{q}{Y_{k}{\bf{B}}_{ik}}={\bf{C}}_{i}, \qquad i=1,\ldots,p+q, \end{equation*} are studied in which ${\bf{A}}_{ij}$, ${\bf{B}}_{ik}$ and ${\bf{C}}_{i}$ are known real interval matrices, while $X_{j}$ and $Y_{k}$ are the unknown matrices for $j=1,\ldots,p$, $k=1,\ldots,q$ and $i=1,\ldots,p+q$. This paper discusses the so-called AE-solution sets for this system. In these types of solution sets, the elements of the involved interval matrices are quantified and all occurrences of the universal quantifier $\forall$ (if any) precede the occurrences of the existential quantifier $\exists$. The AE-solution sets are characterized and some sufficient conditions under which these types of solution sets are bounded are given. Also some approaches are proposed which include a numerical technique and an algebraic approach for enclosing some types of the AE-solution sets.

A note on linear preservers of semipositive and minimally semipositive matrices

Tue, 2019-01-08 12:59

Semipositive matrices (matrices that map at least one nonnegative vector to a positive vector) and minimally semipositive matrices (semipositive matrices whose no column-deleted submatrix is semipositive) are well studied in matrix theory. In this short note, the structure of linear maps which preserve the set of all semipositive/minimally semipositive matrices is studied. An open problem is solved, and some ambiguities in the article [J. Dorsey, T. Gannon, N. Jacobson, C.R. Johnson and M. Turnansky. Linear preservers of semi-positive matrices. {\em Linear and Multilinear Algebra}, 64:1853--1862, 2016.] are clarified.

Vector Cross Product Differential and Difference Equations in R^3 and in R^7

Tue, 2019-01-08 12:58

Through a matrix approach of the $2$-fold vector cross product in $\mathbb{R}^3$ and in $\mathbb{R}^7$, some vector cross product differential and difference equations are studied. Either the classical theory or convenient Drazin inverses, of elements belonging to the class of index $1$ matrices, are applied.

Gershgorin type sets for eigenvalues of matrix polynomials

Wed, 2018-12-26 16:32

New localization results for polynomial eigenvalue problems are obtained, by extending the notions of the Gershgorin set, the generalized Gershgorin set, the Brauer set and the Dashnic-Zusmanovich set to the case of matrix polynomials.

Determinantal Properties of Generalized Circulant Hadamard Matrices

Wed, 2018-12-26 16:31

The derivation of analytical formulas for the determinant and the minors of a given matrix is in general a difficult and challenging problem. The present work is focused on calculating minors of generalized circulant Hadamard matrices. The determinantal properties are studied explicitly, and generic theorems specifying the values of all the minors for this class of matrices are derived. An application of the derived formulae to an interesting problem of numerical analysis, the growth problem, is also presented.

On the Condition Number Theory of the Equality Constrained Indefinite Least Squares Problem

Wed, 2018-12-26 16:31

In this paper, within a unified framework of the condition number theory, the explicit expression of the \emph{projected} condition number of the equality constrained indefinite least squares problem is presented. By setting specific norms and parameters, some widely used condition numbers, like the normwise, mixed and componentwise condition numbers follow as its special cases. Considering practical applications and computation, some new compact forms or upper bounds of the projected condition numbers are given to improve the computational efficiency. The new compact forms are of particular interest in calculating the exact value of the 2-norm projected condition numbers. When the equality constrained indefinite least squares problem degenerates into some specific least squares problems, our results give some new findings on the condition number theory of these specific least squares problems. Numerical experiments are given to illustrate our theoretical results.

Ordering cacti with signless Laplacian spread

Thu, 2018-12-13 10:14

A cactus is a connected graph in which any two cycles have at most one vertex in common. The signless Laplacian spread of a graph is defined as the difference between the largest eigenvalue and the smallest eigenvalue of the associated signless Laplacian matrix. In this paper, all cacti of order n with signless Laplacian spread greater than or equal to n − 1/2 are determined.

Two linear preserver problems on graphs

Thu, 2018-12-13 10:14

Let n, t, k be integers such that 3 ≤ t,k ≤ n. Denote by G_n the set of graphs with vertex set {1,2,...,n}. In this paper, the complete linear transformations on G_n mapping K_t-free graphs to K_t-free graphs are characterized. The complete linear transformations on G_n mapping C_k-free graphs to C_k-free graphs are also characterized when n ≥ 6.

Discontinuity Propagation in Delay Differential-Algebraic Equations

Sun, 2018-12-09 19:22

The propagation of primary discontinuities in initial value problems for linear delay differential-algebraic equations (DDAEs) is discussed. Based on the (quasi-) Weierstra{\ss} form for regular matrix pencils, a complete characterization of the different propagation types is given and algebraic criteria in terms of the matrices are developed. The analysis, which is based on the method of steps, takes into account all possible inhomogeneities and history functions and thus serves as a worst-case scenario. Moreover, it reveals possible hidden delays in the DDAE and allows to study exponential stability of the DDAE based on the spectral abscissa. The new classification for DDAEs is compared to existing approaches in the literature and the impact of splicing conditions on the classification is studied.

Asymptotic results on the condition number of FD matrices approximating semi-elliptic PDEs

Sun, 2018-12-09 19:22

This work studies the asymptotic behavior of the spectral condition number of the matrices $A_{nn}$ arising from the discretization of semi-elliptic partial differential equations of the form \bdm -\left( a(x,y)u_{xx}+b(x,y)u_{yy}\right)=f(x,y), \edm on the square $\Omega=(0,1)^2,$ with Dirichlet boundary conditions, where the smooth enough variable coefficients $a(x,y), b(x,y)$ are nonnegative functions on $\overline{\Omega}$ with zeros. In the case of coefficient functions with a single and common zero, it is discovered that apart from the minimum order of the zero also the direction that it occurs is of great importance for the characterization of the growth of the condition number of $A_{nn}$. On the contrary, when the coefficient functions have non intersecting zeros, it is proved that independently of the order their zeros, and their positions, the condition number of $A_{nn}$ behaves asymptotically exactly as in the case of strictly elliptic differential equations, i.e., it grows asymptotically as $n^2$. Finally, the more complicated case of coefficient functions having curves of roots is considered, and conjectures for future work are given. In conclusion, several experiments are presented that numerically confirm the developed theoretical analysis.

REGULARITY RADIUS: PROPERTIES, APPROXIMATION AND A NOT A PRIORI EXPONENTIAL ALGORITHM

Thu, 2018-12-06 02:30

Commutators Involving Matrix Functions

Fri, 2018-11-30 10:32

Some results are obtained for matrix commutators involving matrix exponentials $\left(\left[e^{A},B\right],\left[e^{A},e^{B}\right]\right)$ and their norms.

Determinants of Interval Matrices

Mon, 2018-11-19 08:16

In this paper we shed more light on determinants of real interval matrices. Computing the exact bounds on a determinant of an interval matrix is an NP-hard problem. Therefore, attention is first paid to approximations. NP-hardness of both relative and absolute approximation is proved. Next, methods computing verified enclosures of interval determinants and their possible combination with preconditioning are discussed. A new method based on Cramer's rule was designed. It returns similar results to the state-of-the-art method, however, it is less consuming regarding computational time. Other methods transferable from real matrices (e.g., the Gerschgorin circles, Hadamard's inequality) are discussed. New results about classes of interval matrices with polynomially computable tasks related to determinant are proved (symmetric positive definite matrices, class of matrices with identity midpoint matrix, tridiagonal H-matrices). The mentioned methods were compared for random general and symmetric matrices.

Inequalities between $\mid A\mid + \mid B\mid$ and $\mid A^{*} \mid + \mid B^{*} \mid$

Sat, 2018-11-17 02:14

Let $A$ and $B$ be complex square matrices. Some inequalities between $\mid A \mid + \mid B \mid$ and $\mid A^{*} \mid + \mid B^{*} \mid$ are established. Applications of these inequalities are also given. For example, in the Frobenius norm, $$\parallel\, A+B \,\parallel_{F} \leq \sqrt[4]{2} \parallel \mid A\mid + \mid B\mid \, \parallel_{F}.$$