Approximating maps into manifolds with lower curvature bounds
arXiv:2403.16785 · doi:10.1007/s10543-025-01080-x
Abstract
Many interesting functions arising in applications map into Riemannian manifolds. We present an algorithm, using the manifold exponential and logarithm, for approximating such functions. Our approach extends approximation techniques for functions into linear spaces in such a way that we can upper bound the forward error in terms of a lower bound on the manifold's sectional curvature. Furthermore, when the sectional curvature is nonnegative, such as for compact Lie groups, the error is guaranteed to not be worse than in the linear case. We implement the algorithm in a Julia package ManiFactor.jl and apply it to two example problems.
References in corpus (12)
- The AAA algorithm for rational approximation
- Derivatives of Multilinear Functions of Matrices
- Spectral tensor-train decomposition
- A Grassmann Manifold Handbook: Basic Geometry and Computational Aspects
- A Riemannian Trust Region Method for the Canonical Tensor Rank Approximation Problem
- A variational model for data fitting on manifolds by minimizing the acceleration of a Bézier curve
- Manifolds.jl: An Extensible Julia Framework for Data Analysis on Manifolds
- Scale and curvature effects in principal geodesic analysis
- Low-rank tensor approximations for solving multi-marginal optimal transport problems
- Tensor completion using geodesics on Segre manifolds
- Approximation in the extended functional tensor train format
- Principal Geodesic Analysis in Director-Based Dynamics of Hybrid Mechanical Systems