On Donoho's Log-Exp Subdivision Scheme: Choice of Retraction and Time-Symmetry

06/24/2022
by   Esfandiar Nava-Yazdani, et al.
0

In recent years a number of different approaches for adapting linear subdivision schemes to manifold-valued data were proposed. In this article, we study the following family: (Sx)2i+σ=fxi(∑ℓa2ℓ+σgxi(xi−ℓ)),σ=0,1,i∈Z; here f is a smooth retraction on M, g is the corresponding local inverse, and (a2ℓ+σ) is the mask of a linear subdivision scheme. This particular way of adapting linear subdivision schemes to manifold, in which the same base pointxi is used for both the odd and even rules, is a fundamental building block of the wavelet transform proposed in Ur Rahman et al. [Multiscale Model. Simul., 4 (2005), pp. 1201–1232]. This feature is not shared by the other ways proposed in the recent literature. In this article, we expose the rather subtle smoothness equivalence properties of the above S; here “smoothness equivalence property” refers to how much smoothness the nonlinear S inherits from the underlying linear scheme. We first prove that one always gets C2 equivalence between S and the linear scheme regardless of the choice of f. In contrast, if one wants just one more order of smoothness equivalence, then the choice of f matters. We show that C3 equivalence is guaranteed by a condition on the third order Taylor expansions of f. This condition is further proved to be genuinely geometric in the sense that it is invariant under change of coordinates. Our second main result shows that the most natural choice f=exp in a symmetric space setting always satisfies the condition. Consequently, any third order accurate approximation of the exponential map would satisfy the same condition. This provides the ground for replacing the exponential map by a more computationally efficient approximant. The difficulty is that such an approximant must also be chosen such that it is by itself also a retraction of the underlying symmetric space or Lie group. Fortunately, it is a well-studied problem in the area of numerical geometric integration; many computationally efficient approximations to the exponential map are available for different symmetric spaces. Finally, we discuss the effect of time-symmetry on smoothness.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/30/2021

Equivalence between Sobolev spaces of first-order dominating mixed smoothness and unanchored ANOVA spaces on ℝ^d

We prove that a variant of the classical Sobolev space of first-order do...
research
02/04/2022

About Code Equivalence – a Geometric Approach

The equivalence test is a main part in any classification problem. It he...
research
06/24/2022

Convergence and smoothness analysis of subdivision rules in Riemannian and symmetric spaces

After a discussion on definability of invariant subdivision rules we dis...
research
08/30/2023

Geometric integration on symmetric spaces

We consider geometric numerical integration algorithms for differential ...
research
03/30/2020

Numerical integration without smoothness assumption

We consider numerical integration in classes, for which we do not impose...
research
01/13/2022

Dynamic Local Searchable Symmetric Encryption

In this article, we tackle for the first time the problem of dynamic mem...
research
10/22/2020

Optimal Approximation – Smoothness Tradeoffs for Soft-Max Functions

A soft-max function has two main efficiency measures: (1) approximation ...

Please sign up or login with your details

Forgot password? Click here to reset