Results 11 to 20 of about 438 (60)
Circulant matrices: norm, powers, and positivity [PDF]
In their recent paper "The spectral norm of a Horadam circulant matrix", Merikoski, Haukkanen, Mattila and Tossavainen study under which conditions the spectral norm of a general real circulant matrix ${\bf C}$ equals the modulus of its row/column sum ...
Lindner, Marko
core +2 more sources
On the polyhedral cones of convex and concave vectors [PDF]
Convex or concave sequences of n positive terms, viewed as vectors in n-space, constitute convex cones with 2n − 2 and n extreme rays, respectively.
Foldes, Stephan, Major, Laszlo
core +2 more sources
Sufficient conditions for symmetric matrices to have exactly one positive eigenvalue
Let A = [aij] be a real symmetric matrix. If f : (0, ∞) → [0, ∞) is a Bernstein function, a sufficient condition for the matrix [f (aij)] to have only one positive eigenvalue is presented.
Al-Saafin Doaa, Garloff Jürgen
doaj +1 more source
Matrix functions that preserve the strong Perron-Frobenius property
In this note, we characterize matrix functions that preserve the strong Perron-Frobenius property using the real Jordan canonical form of a real matrix.Comment: To appear in The Electronic Journal of Linear ...
Paparella, Pietro
core +1 more source
Matrix Roots of Eventually Positive Matrices [PDF]
Eventually positive matrices are real matrices whose powers become and remain strictly positive. As such, eventually positive matrices are a fortiori matrix roots of positive matrices, which motivates us to study the matrix roots of primitive matrices ...
McDonald, Judith J. +2 more
core +1 more source
A note on matrices mapping a positive vector onto its element-wise inverse
For any primitive matrix $M\in\mathbb{R}^{n\times n}$ with positive diagonal entries, we prove the existence and uniqueness of a positive vector $\mathbf{x}=(x_1,\dots,x_n)^t$ such that $M\mathbf{x}=(\frac{1}{x_1},\dots,\frac{1}{x_n})^t$.
Labbé, Sébastien
core +1 more source
Singular M-matrices which may not have a nonnegative generalized inverse
A matrix A ∈ ℝn×n is a GM-matrix if A = sI − B, where 0 < ρ(B) ≤ s and B ∈WPFn i.e., both B and Bthave ρ(B) as their eigenvalues and their corresponding eigenvector is entry wise nonnegative.
Sushama Agrawal N. +2 more
doaj +1 more source
Simple expressions for the long walk distance
The walk distances in graphs are defined as the result of appropriate transformations of the $\sum_{k=0}^\infty(tA)^k$ proximity measures, where $A$ is the weighted adjacency matrix of a connected weighted graph and $t$ is a sufficiently small positive ...
Bapat +14 more
core +1 more source
The critical exponent conjecture for powers of doubly nonnegative matrices
Doubly non-negative matrices arise naturally in many setting including Markov random fields (positively banded graphical models) and in the convergence analysis of Markov chains. In this short note, we settle a recent conjecture by C.R.
Guillot, Dominique +2 more
core +1 more source
New approximations for the cone of copositive matrices and its dual
We provide convergent hierarchies for the cone C of copositive matrices and its dual, the cone of completely positive matrices. In both cases the corresponding hierarchy consists of nested spectrahedra and provide outer (resp. inner) approximations for C
A Grundmann +16 more
core +5 more sources

