High-Dimensional Menger-Type Curvatures—Part II: d-Separation and a Menagerie of Curvatures

By Gilad Lerman, J. Tyler Whitehouse. 2008

50 citations recorded by the source corpus.

We estimate d-dimensional least squares approximations of an arbitrary d-regular measure μ via discrete curvatures of d+2 variables. The main result bounds the least squares error of approximating μ (or its restrictions to balls) with a d-plane by an average of the discrete Menger-type curvature over a restricted set of simplices. Its proof is constructive and even suggests an algorithm for an approximate least squares d-plane. A consequent result bounds a multiscale error term (used for quantifying the approximation of μ with a sufficiently regular surface) by an integral of the discrete Menger-type curvature over all simplices. The preceding paper (part I) provided the opposite inequalities of these two results. This paper also demonstrates the use of a few other discrete curvatures which are different from the Menger-type curvature. Furthermore, it shows that a curvature suggested by Léger (Ann. Math. 149(3), pp. 831–869, 1999) does not fit within our framework.

Subfields: Applied Mathematics, Numerical Analysis

View Paper: https://www.semanticscholar.org/paper/aab41a651d47a31f4be4d4a86f4bfb2538ff28f2

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Applied Mathematics

  1. Pawel Strzelecki
  2. H. von der Mosel
  3. Gilad Lerman
  4. Guangliang Chen
  5. J. Tyler Whitehouse
  6. Michael Struwe
  7. Changyou Wang
  8. Armin Schikorra

In Numerical Analysis

  1. Guangliang Chen
  2. Gilad Lerman
  3. Pawel Strzelecki
  4. H. von der Mosel
  5. J. Tyler Whitehouse

Citations in the corpus