Papers
Topics
Authors
Recent
Search
2000 character limit reached

Numerical Approximation in Riemannian Manifolds by Karcher Means

Published 14 May 2015 in math.NA and math.DG | (1505.03710v1)

Abstract: (1) For a compact Riemannian manifold without boundary $(M,g)$ containing $n+1$ points $p_i$ and the $n$-dimensional standard simplex $\Delta$, the miniser of [ E: M \times \Delta \to {\mathbf R}, (a,\lambda) \mapsto \lambda0 d2(a,p_0) + \dots + \lambdan d2(a,p_n) ] is considered as point with "barycentric coordinates" $\lambda_i$ within the so-called Karcher simplex (or Riemannian simplex or geodesic finite element) defined by vertices $p_i$. In the small, existence and uniqueness is well-known. Now suppose $\Delta$ carries a flat Riemannian metric $ge$ induced by edge lengths $d(p_i,p_j)$, where $d$ is the geodesic distance in $M$. If all edge lengths are small than $h$ and $vol(\Delta,ge) \geq \alpha hn$ for some $\alpha > 0$, then we can show that \begin{equation} |(x*g - ge)(v,w)| \leq c h2 |v| |w|, \qquad |(\nabla{x*g} - \nabla{ge})_v w| \leq c h |v| |w| \end{equation} with some constant $c$ depending only on the curvature tensor $R$ of $(M,g)$ and $\alpha$. From this we derive several estimates for Finite Element calculations in which $(M,g)$ is replaced by a piecewise flat realised simplicial complex. (2) Let $M$ be the geometric realisation of a simplicial complex $K$. The simplicial cohomology $(Ck(K), \partial*)$ has been interpreted as "discrete outer calculus" (DEC) in the literature. We define spaces $P{-1}\Omegak \subset L\infty\Omegak$ and outer differentials and give an isometric cochain map $Ck \to P{-1}\Omegak$. This reduces the computation of variational problems in discrete outer calculus to variational problems in a trial space of non-conforming differential forms. We investigate the approximation properties of $P{-1}\Omegak$ in $H1\Omegak$ and compare the solutions to variational problems in both spaces.

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

Collections

Sign up for free to add this paper to one or more collections.