Abstract

We provide an expression for the derivative of the weighted matrix geometric mean, with respect to both the matrix arguments and the weights, that can be easily translated to an algorithm for its computation. As an application, we consider the problem of the approximate decomposition of a tensor grid M, a matrix whose entries are positive definite matrices. For different geometries on the set of positive definite matrices, we derive an approximate decomposition such that any column of M is a barycentric combination of the columns of a smaller tensor grid. This extends the Euclidean case, already considered in the literature, to the geometry in which the barycenter is the matrix geometric mean and the log-Euclidean geometry.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.