Electronic Journal of Linear AlgebraCopyright (c) 2019 University of Wyoming All rights reserved.
https://repository.uwyo.edu/ela
Recent documents in Electronic Journal of Linear Algebraen-usMon, 25 Mar 2019 01:41:56 PDT3600Condensed Forms for Linear Port-Hamiltonian Descriptor Systems
https://repository.uwyo.edu/ela/vol35/iss1/6
https://repository.uwyo.edu/ela/vol35/iss1/6Sat, 23 Mar 2019 10:57:10 PDT
Motivated by the structure which arises in the port-Hamiltonian formulation of constraint dynamical systems, structure preserving condensed forms for skew-adjoint differential-algebraic equations (DAEs) are derived. Moreover, structure preserving condensed forms under constant rank assumptions for linear port-Hamiltonian differential-algebraic equations are developed. These condensed forms allow for the further analysis of the properties of port-Hamiltonian DAEs and to study, e.g., existence and uniqueness of solutions or to determine the index. It can be shown that under certain conditions for regular port-Hamiltonian DAEs the strangeness index is bounded by $\mu\leq1$.
]]>
Lena ScholzBrauer's theorem and nonnegative matrices with prescribed diagonal entries
https://repository.uwyo.edu/ela/vol35/iss1/5
https://repository.uwyo.edu/ela/vol35/iss1/5Fri, 15 Feb 2019 13:17:52 PST
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.
]]>
Ricardo L. Soto et al.Diagonal Sums of Doubly Substochastic Matrices
https://repository.uwyo.edu/ela/vol35/iss1/4
https://repository.uwyo.edu/ela/vol35/iss1/4Fri, 15 Feb 2019 13:17:33 PST
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.
]]>
Lei Cao et al.In-sphere property and reverse inequalities for matrix means
https://repository.uwyo.edu/ela/vol35/iss1/3
https://repository.uwyo.edu/ela/vol35/iss1/3Sat, 09 Feb 2019 17:41:40 PST
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.
]]>
Trung Hoa Dinh et al.Surjective Additive Rank-1 Preservers on Hessenberg Matrices
https://repository.uwyo.edu/ela/vol35/iss1/2
https://repository.uwyo.edu/ela/vol35/iss1/2Sat, 09 Feb 2019 17:41:29 PST
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.
]]>
PRATHOMJIT KHACHORNCHAROENKUL et al.Solving the Sylvester Equation AX-XB=C when $\sigma(A)\cap\sigma(B)\neq\emptyset$
https://repository.uwyo.edu/ela/vol35/iss1/1
https://repository.uwyo.edu/ela/vol35/iss1/1Tue, 05 Feb 2019 21:45:04 PST
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.
]]>
Nebojša Č. DinčićResolution Of Conjectures Related To Lights Out! And Cartesian Products
https://repository.uwyo.edu/ela/vol34/iss1/51
https://repository.uwyo.edu/ela/vol34/iss1/51Wed, 16 Jan 2019 21:12:33 PST
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.
]]>
Bryan A. Curtis et al.On the Interval Generalized Coupled Matrix Equations
https://repository.uwyo.edu/ela/vol34/iss1/50
https://repository.uwyo.edu/ela/vol34/iss1/50Wed, 16 Jan 2019 21:12:23 PST
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.
]]>
Marzieh Dehghani-MadisehA note on linear preservers of semipositive and minimally semipositive matrices
https://repository.uwyo.edu/ela/vol34/iss1/49
https://repository.uwyo.edu/ela/vol34/iss1/49Tue, 08 Jan 2019 11:59:04 PST
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.
]]>
Projesh Nath Choudhury et al.Vector Cross Product Differential and Difference Equations in R^3 and in R^7
https://repository.uwyo.edu/ela/vol34/iss1/48
https://repository.uwyo.edu/ela/vol34/iss1/48Tue, 08 Jan 2019 11:58:51 PST
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.
]]>
Patrícia D. Beites et al.Gershgorin type sets for eigenvalues of matrix polynomials
https://repository.uwyo.edu/ela/vol34/iss1/47
https://repository.uwyo.edu/ela/vol34/iss1/47Wed, 26 Dec 2018 15:32:09 PST
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.
]]>
Christina Michailidou et al.Determinantal Properties of Generalized Circulant Hadamard Matrices
https://repository.uwyo.edu/ela/vol34/iss1/46
https://repository.uwyo.edu/ela/vol34/iss1/46Wed, 26 Dec 2018 15:31:57 PST
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.
]]>
Marilena Mitrouli et al.On the Condition Number Theory of the Equality Constrained Indefinite Least Squares Problem
https://repository.uwyo.edu/ela/vol34/iss1/45
https://repository.uwyo.edu/ela/vol34/iss1/45Wed, 26 Dec 2018 15:31:43 PST
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.
]]>
Shaoxin Wang et al.Ordering cacti with signless Laplacian spread
https://repository.uwyo.edu/ela/vol34/iss1/44
https://repository.uwyo.edu/ela/vol34/iss1/44Thu, 13 Dec 2018 09:14:42 PST
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.
]]>
Zhen Lin et al.Two linear preserver problems on graphs
https://repository.uwyo.edu/ela/vol34/iss1/43
https://repository.uwyo.edu/ela/vol34/iss1/43Thu, 13 Dec 2018 09:14:29 PST
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.
]]>
Yanan Hu et al.Discontinuity Propagation in Delay Differential-Algebraic Equations
https://repository.uwyo.edu/ela/vol34/iss1/42
https://repository.uwyo.edu/ela/vol34/iss1/42Sun, 09 Dec 2018 18:22:54 PST
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.
]]>
Benjamin UngerAsymptotic results on the condition number of FD matrices approximating semi-elliptic PDEs
https://repository.uwyo.edu/ela/vol34/iss1/41
https://repository.uwyo.edu/ela/vol34/iss1/41Sun, 09 Dec 2018 18:22:43 PST
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.
]]>
Paris VassalosREGULARITY RADIUS: PROPERTIES, APPROXIMATION AND A NOT A PRIORI EXPONENTIAL ALGORITHM
https://repository.uwyo.edu/ela/vol33/iss1/12
https://repository.uwyo.edu/ela/vol33/iss1/12Thu, 06 Dec 2018 01:30:22 PST
The radius of regularity, sometimes spelled as the radius of nonsingularity, is a measure providing the distance of a given matrix to the nearest singular one. Despite its possible application strength this measure is still far from being handled in an efficient way also due to findings of Poljak and Rohn providing proof that checking this property is NP-hard for a general matrix. There are basically two approaches to handle this situation. Firstly, approximation algorithms are applied and secondly, tighter bounds for radius of regularity are considered. Improvements of both approaches have been recently shown by Hartman and Hlad\'{i}k (doi:10.1007/978-3-319-31769-4\_9) utilizing relaxation of the radius computation to semidefinite programming. An estimation of the regularity radius using any of the above mentioned approaches is usually applied to general matrices considering none or just weak assumptions about the original matrix. Surprisingly less explored area is represented by utilization of properties of special classes of matrices as well as utilization of classical algorithms extended to be used to compute the considered radius. This work explores a process of regularity radius analysis and identifies useful properties enabling easier estimation of the corresponding radius values. At first, checking finiteness of this characteristic is shown to be a polynomial problem along with determining a sharp upper bound on the number of nonzero elements of the matrix to obtain infinite radius. Further, relationship between maximum (Chebyshev) norm and spectral norm is used to construct new bounds for the radius of regularity. Considering situations where the known bounds are not tight enough, a new method based on Jansson-Rohn algorithm for testing regularity of an interval matrix is presented which is not a priory exponential along with numerical experiments. For a situation where an input matrix has a special form, several corresponding results are provided such as exact formulas for several special classes of matrices, e.g., for totally positive and inverse non-negative, or approximation algorithms, e.g., rank-one radius matrices. For tridiagonal matrices, an algorithm by Bar-On, Codenotti and Leoncini is utilized to design a polynomial algorithm to compute the radius of regularity.
]]>
David Hartman et al.Commutators Involving Matrix Functions
https://repository.uwyo.edu/ela/vol33/iss1/11
https://repository.uwyo.edu/ela/vol33/iss1/11Fri, 30 Nov 2018 09:32:47 PST
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.
]]>
Osman KAN et al.Determinants of Interval Matrices
https://repository.uwyo.edu/ela/vol33/iss1/10
https://repository.uwyo.edu/ela/vol33/iss1/10Mon, 19 Nov 2018 07:16:49 PST
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.
]]>
Jaroslav Horáček et al.