We establish local characterizations of matrix monotonicity and convexity of fixed order by giving integral representations connecting the Loewner and Kraus matrices, previously known to characterize these properties, to respective Hankel matrices. Our results are new already in the general case of matrix convexity, and our approach significantly simplifies the corresponding work on matrix monotonicity. We also obtain an extension of the original characterization for matrix convexity by Kraus and tighten the relationship between monotonicity and convexity.Peer reviewe
Let $f : (a,b) → \mathbb{R}.$ The function f is said to be matrix monotone if $A \leq B$ implies $f(...
The concept of a monotone operator --- which covers both linear positive semi-definite operators and...
This note is based on [8, 19]. The main purpose is to give a new method to construct an operator mon...
We establish local characterizations of matrix monotonicity and convexity of fixed order by giving i...
AbstractWe prove some matrix monotonicity and matrix convexity properties for functions derived from...
This book provides an in depth discussion of Loewner’s theorem on the characterization of matrix mon...
AbstractLet A and B be Hermitian matrices. We say that A⩾B if A−B is nonnegative definite. A functio...
AbstractWe prove some matrix monotonicity and matrix convexity properties for functions derived from...
AbstractWe analyze matrix convex functions of a fixed order defined in a real interval by differenti...
Let f be a function from R+ into itself. A classic theorem of K. Löwner says that f is operator mono...
AbstractWe survey various generalizations of matrix monotonicity. Of much interest to us are relatio...
AbstractWe characterize real functions f on an interval (-α,α) for which the entrywise matrix functi...
The concept of a monotone operator — which covers both linear positive semi-definite operators and s...
Let f be a smooth function on R. The divided difference matrices whose (i, j) entries are» f(λi) − f...
AbstractLet A and B be Hermitian matrices. We say that A⩾B if A−B is nonnegative definite. A functio...
Let $f : (a,b) → \mathbb{R}.$ The function f is said to be matrix monotone if $A \leq B$ implies $f(...
The concept of a monotone operator --- which covers both linear positive semi-definite operators and...
This note is based on [8, 19]. The main purpose is to give a new method to construct an operator mon...
We establish local characterizations of matrix monotonicity and convexity of fixed order by giving i...
AbstractWe prove some matrix monotonicity and matrix convexity properties for functions derived from...
This book provides an in depth discussion of Loewner’s theorem on the characterization of matrix mon...
AbstractLet A and B be Hermitian matrices. We say that A⩾B if A−B is nonnegative definite. A functio...
AbstractWe prove some matrix monotonicity and matrix convexity properties for functions derived from...
AbstractWe analyze matrix convex functions of a fixed order defined in a real interval by differenti...
Let f be a function from R+ into itself. A classic theorem of K. Löwner says that f is operator mono...
AbstractWe survey various generalizations of matrix monotonicity. Of much interest to us are relatio...
AbstractWe characterize real functions f on an interval (-α,α) for which the entrywise matrix functi...
The concept of a monotone operator — which covers both linear positive semi-definite operators and s...
Let f be a smooth function on R. The divided difference matrices whose (i, j) entries are» f(λi) − f...
AbstractLet A and B be Hermitian matrices. We say that A⩾B if A−B is nonnegative definite. A functio...
Let $f : (a,b) → \mathbb{R}.$ The function f is said to be matrix monotone if $A \leq B$ implies $f(...
The concept of a monotone operator --- which covers both linear positive semi-definite operators and...
This note is based on [8, 19]. The main purpose is to give a new method to construct an operator mon...