Table of Contents
Fetching ...

Hermite interpolation with retractions on manifolds

Axel Séguin, Daniel Kressner

TL;DR

This work addresses Hermite interpolation of manifold-valued data by introducing a retraction-based RH interpolation that avoids the need for explicit exponential/Log maps. It develops a general framework using endpoint retraction curves and retraction-convex sets to ensure well-posedness, proves a manifold analogue of the classical $O(h^4)$ interpolation-error rate, and validates the approach through extensive experiments on the Stiefel and fixed-rank matrix manifolds. The method offers high-order accuracy while remaining applicable to manifolds where the exponential/log maps are difficult to compute, demonstrated through practical examples in Q-factor and SVD interpolation and extended to Riemannian continuation and dynamical low-rank approximation. Overall, RH interpolation provides a flexible, efficient building block for manifold-based numerical methods, with potential impact on manifold ODEs, optimization, and model-order reduction.

Abstract

Interpolation of data on non-Euclidean spaces is an active research area fostered by its numerous applications. This work considers the Hermite interpolation problem: finding a sufficiently smooth manifold curve that interpolates a collection of data points on a Riemannian manifold while matching a prescribed derivative at each point. We propose a novel procedure relying on the general concept of retractions to solve this problem on a large class of manifolds, including those for which computing the Riemannian exponential or logarithmic maps is not straightforward, such as the manifold of fixed-rank matrices. We analyze the well-posedness of the method by introducing and showing the existence of retraction-convex sets, a generalization of geodesically convex sets. We extend to the manifold setting a classical result on the asymptotic interpolation error of Hermite interpolation. We finally illustrate these results and the effectiveness of the method with numerical experiments on the manifold of fixed-rank matrices and the Stiefel manifold of matrices with orthonormal columns.

Hermite interpolation with retractions on manifolds

TL;DR

This work addresses Hermite interpolation of manifold-valued data by introducing a retraction-based RH interpolation that avoids the need for explicit exponential/Log maps. It develops a general framework using endpoint retraction curves and retraction-convex sets to ensure well-posedness, proves a manifold analogue of the classical interpolation-error rate, and validates the approach through extensive experiments on the Stiefel and fixed-rank matrix manifolds. The method offers high-order accuracy while remaining applicable to manifolds where the exponential/log maps are difficult to compute, demonstrated through practical examples in Q-factor and SVD interpolation and extended to Riemannian continuation and dynamical low-rank approximation. Overall, RH interpolation provides a flexible, efficient building block for manifold-based numerical methods, with potential impact on manifold ODEs, optimization, and model-order reduction.

Abstract

Interpolation of data on non-Euclidean spaces is an active research area fostered by its numerous applications. This work considers the Hermite interpolation problem: finding a sufficiently smooth manifold curve that interpolates a collection of data points on a Riemannian manifold while matching a prescribed derivative at each point. We propose a novel procedure relying on the general concept of retractions to solve this problem on a large class of manifolds, including those for which computing the Riemannian exponential or logarithmic maps is not straightforward, such as the manifold of fixed-rank matrices. We analyze the well-posedness of the method by introducing and showing the existence of retraction-convex sets, a generalization of geodesically convex sets. We extend to the manifold setting a classical result on the asymptotic interpolation error of Hermite interpolation. We finally illustrate these results and the effectiveness of the method with numerical experiments on the manifold of fixed-rank matrices and the Stiefel manifold of matrices with orthonormal columns.
Paper Structure (33 sections, 22 theorems, 115 equations, 8 figures, 2 tables, 2 algorithms)

This paper contains 33 sections, 22 theorems, 115 equations, 8 figures, 2 tables, 2 algorithms.

Key Result

Proposition 1

For $b_0, b_1, b_2, b_3\in \mathcal{M}$ consider, as in Figure fig:myDeCast: If, additionally, then the generalized de Casteljau manifold curve satisfies and

Figures (8)

  • Figure 1: Generalized de Casteljau with 4 control points.
  • Figure 2: Illustration of offline computations performed by Algorithm \ref{['alg:offlinePhase']}. Parallelograms indicate tangent spaces whereas dotted lines indicate retraction curves.
  • Figure 3: Orthographic retraction and its inverse.
  • Figure 4: Interpolation error vs $t$ for different retraction-based schemes: linear (L) and Hermite (H), as defined in Section \ref{['sss:otherSchemes']}, and the RH scheme.
  • Figure 5: Interpolation error as a function of the sampling step size $h$ for different retraction-based schemes: linear (L) and Hermite (H), as defined in Section \ref{['sss:otherSchemes']}, and the RH scheme.
  • ...and 3 more figures

Theorems & Definitions (44)

  • Proposition 1
  • proof
  • Definition 2
  • Proposition 3
  • proof
  • Proposition 4
  • proof
  • Definition 5
  • Proposition 6
  • proof
  • ...and 34 more