Saved in:
Bibliographic Details
Main Authors: Mataigne, Simon, Zimmermann, Ralf, Miolane, Nina
Format: Preprint
Published: 2024
Subjects:
Online Access:https://arxiv.org/abs/2403.11730
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866913625861521408
author Mataigne, Simon
Zimmermann, Ralf
Miolane, Nina
author_facet Mataigne, Simon
Zimmermann, Ralf
Miolane, Nina
contents Since the popularization of the Stiefel manifold for numerical applications in 1998 in a seminal paper from Edelman et al., it has been exhibited to be a key to solve many problems from optimization, statistics and machine learning. In 2021, Hüper et al. proposed a one-parameter family of Riemannian metrics on the Stiefel manifold, subsuming the well-known Euclidean and canonical metrics. Since then, several methods have been proposed to obtain a candidate for the Riemannian logarithm given any metric from the family. Most of these methods are based on the shooting method or rely on optimization approaches. For the canonical metric, Zimmermann proposed in 2017 a particularly efficient method based on a pure matrix-algebraic approach. In this paper, we derive a generalization of this algorithm that works for the one-parameter family of Riemannian metrics. The algorithm is proposed in two versions, termed backward and forward, for which we prove that it conserves the local linear convergence previously exhibited in Zimmermann's algorithm for the canonical metric.
format Preprint
id arxiv_https___arxiv_org_abs_2403_11730
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle An efficient algorithm for the Riemannian logarithm on the Stiefel manifold for a family of Riemannian metrics
Mataigne, Simon
Zimmermann, Ralf
Miolane, Nina
Numerical Analysis
Differential Geometry
15B10, 15B57, 53Z50, 65B99, 15A16
Since the popularization of the Stiefel manifold for numerical applications in 1998 in a seminal paper from Edelman et al., it has been exhibited to be a key to solve many problems from optimization, statistics and machine learning. In 2021, Hüper et al. proposed a one-parameter family of Riemannian metrics on the Stiefel manifold, subsuming the well-known Euclidean and canonical metrics. Since then, several methods have been proposed to obtain a candidate for the Riemannian logarithm given any metric from the family. Most of these methods are based on the shooting method or rely on optimization approaches. For the canonical metric, Zimmermann proposed in 2017 a particularly efficient method based on a pure matrix-algebraic approach. In this paper, we derive a generalization of this algorithm that works for the one-parameter family of Riemannian metrics. The algorithm is proposed in two versions, termed backward and forward, for which we prove that it conserves the local linear convergence previously exhibited in Zimmermann's algorithm for the canonical metric.
title An efficient algorithm for the Riemannian logarithm on the Stiefel manifold for a family of Riemannian metrics
topic Numerical Analysis
Differential Geometry
15B10, 15B57, 53Z50, 65B99, 15A16
url https://arxiv.org/abs/2403.11730