Monotonicity of the matrix geometric mean
By Rajendra Bhatia, Rajeeva Laxman Karandikar. 2012
91 citations recorded by the source corpus.
Subfields: Applied Mathematics, Computational Theory and Mathematics
View Paper: https://www.semanticscholar.org/paper/3cd12a1510791180d50eb345d90a1bfba706fee6
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Applied Mathematics
In Computational Theory and Mathematics
Citations in the corpus
- Generalized locally Toeplitz sequences : Theory and applications (2017, background): “It was proved with some effort [13, 62, 72] that the Karcher mean satisfies all the ALM axioms and some further properties, and thus now everyone agrees that the Karcher mean has the right to be called the geometric mean of matrices.”
- On the Bures–Wasserstein distance between positive definite matrices (2017, unknown): “See [7] [8] [9] [10] [19] [23] [24] [25] [26].”
- Weighted deterministic walks for the least squares mean on Hadamard spaces (2014, background): “The proof was simplified by Bhatia and Karandikar [5] and at the same time Bhatia [3] considers an obvious deterministic sequence generated by the unweighted inductive means and raises the question, whether this deterministic sequence converges to the least squares mean.”