Matrix geometric means based on shuffled inductive sequences
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 193258 (Why is no real title available?)
- scientific article; zbMATH DE number 2051142 (Why is no real title available?)
- A Multivariable Extension of Two-Variable Matrix Means
- A Riemannian framework for tensor computing
- A note on computing matrix geometric means
- A survey and comparison of contemporary algorithms for computing the matrix geometric mean
- An effective matrix geometric mean satisfying the Ando-Li-Mathias properties
- An extended Lie--Trotter formula and its applications
- Approximations to the Karcher mean on Hadamard spaces via geometric power means
- Computing medians and means in Hadamard spaces
- Computing the Karcher mean of symmetric positive definite matrices
- Discrete-time gradient flows and law of large numbers in Alexandrov spaces
- Geometric Mean Algorithms Based on Harmonic and Arithmetic Iterations
- Geometric means
- Matrix power means and the Karcher mean
- Monotonic properties of the least squares mean
- Monotonicity of the matrix geometric mean
- No dice: a deterministic approach to the Cartan centroid
- On the averaging of symmetric positive-definite tensors
- Operator means of probability measures and generalized Karcher equations
- Riemannian center of mass and mollifier smoothing
- The mathematics of perfect shuffles
- Upper and lower bounds for the arithmetic-geometric-harmonic means of positive definite matrices
- Weighted deterministic walks for the least squares mean on Hadamard spaces
- Weighted inductive means
Cited in
(5)
This page was built for publication: Matrix geometric means based on shuffled inductive sequences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2002785)