Efficient Algorithms for Approximate Smooth Selection

Charles Fefferman, Bernat Guillén Pegueroles

Research output: Contribution to journalArticle


In this paper, we provide efficient algorithms for approximate Cm(Rn, RD) - selection. In particular, given a set E, a constant M> 0 , and convex sets K(x) ⊂ RD for x∈ E, we show that an algorithm running in C(τ) Nlog N steps is able to solve the smooth selection problem of selecting a point y∈ (1 + τ) ⧫K(x) for x∈ E for an appropriate dilation of K(x), (1 + τ) ⧫K(x) , and guaranteeing that a function interpolating the points (x, y) will be Cm(Rn, RD) with norm bounded by CM.

Original languageEnglish (US)
JournalJournal of Geometric Analysis
StateAccepted/In press - Jan 1 2019

All Science Journal Classification (ASJC) codes

  • Geometry and Topology


  • Approximate algorithms
  • Efficient algorithms
  • Partition of unity
  • Smooth selection

Fingerprint Dive into the research topics of 'Efficient Algorithms for Approximate Smooth Selection'. Together they form a unique fingerprint.

  • Cite this