Fetching the paper…
Reading the bibliography…
We prove a matrix trace inequality for completely monotone functions and for Bernstein functions.
P. Montel, “Sur les fonctions convexes et les fonctions sousharmoniques”, J. Math. Pures Appl. Neuvième Série, 7
1928
Earlier work this paper cites.
C.A. McCarthy, “ c p c_{p} ”, Israel J. Math. 5
1967
Earlier work this paper cites.
K.V. Bhagwat and A. Subramanian, “Inequalities between means of positive operators”, Math. Proc. Camb. Phil. Soc. 83
1978
Earlier work this paper cites.
R. Bhatia, Matrix Analysis
1997
Cited alongside, same era.
K.M.R. Audenaert, “A norm compression inequality for block partitioned positive semidefinite matrices,” Lin. Alg. Appl. 413
2006
Cited alongside, same era.
T. Kosem, “Inequalities between ‖ f ( A + B ) ‖ ||f(A+B)|| and ‖ f ( A ) + f ( B ) ‖ ||f(A)+f(B)|| ,” Lin. Alg. Appl. 418
2006
Cited alongside, same era.
J.-C. Bourin, M. Uchiyama, “A matrix subadditivity inequality for f ( A + B ) f(A+B) and f ( A ) + f ( B ) f(A)+f(B) ,” Lin. Alg. Appl. 423
2007
Later among the works it cites.
R.L. Schilling, R. Song and Z. Vondracek, Bernstein functions, theory and applications
2010
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…