Preserving positivity for matrices with sparsity constraints
DOI10.1090/tran6669zbMath1350.15014arXiv1406.3408OpenAlexW3098909886MaRDI QIDQ2822725
Apoorva Khare, Dominique Guillot, Bala Rajaratnam
Publication date: 4 October 2016
Published in: Transactions of the American Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1406.3408
numerical rangelinear preserver problemabsolutely monotonic functionsLoewner orderingpositive semidefinitenessentrywise positive mapsfractional Schur powersmatrices with structure of zerosLoewner positivitymultiplicatively convex functions
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Norms of matrices, numerical range, applications of functional analysis to matrix theory (15A60) Positive matrices and their generalizations; cones of matrices (15B48) Linear preserver problems (15A86)
Related Items (9)
Cites Work
- Retaining positive definiteness in thresholded matrices
- Complete characterization of Hadamard powers preserving Loewner positivity, monotonicity, and convexity
- Positive definite sequences and absolutely monotonic functions
- Monotonicity for entrywise functions of matrices
- Positive semidefinite matrices with a given sparsity pattern
- Positive definite matrices and absolutely monotonic functions
- Functions of matrices with nonnegative entries
- On functions which preserve the class of Stieltjes matrices
- On fractional Hadamard powers of positive definite matrices
- Strictly positive definite functions on a real inner product space
- Functions that preserve families of positive semidefinite matrices
- The critical exponent conjecture for powers of doubly nonnegative matrices
- Positivity preserving Hadamard matrix functions
- Fonctions opérant sur les fonctions définies-positives
- Positive definite functions on spheres
- Functions Preserving Nonnegativity of Matrices
- Functions Operating on Positive Definite Matrices and a Theorem of Schoenberg
- Spectral graph theory and the inverse eigenvalue problem of a graph
- Preserving positivity for rank-constrained matrices
- Functions preserving positive definiteness for sparse matrices
- The Theory of Infinitely Divisible Matrices and Kernels
- Convex functions and their applications. A contemporary approach
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Preserving positivity for matrices with sparsity constraints