Efficient algorithms for approximate smooth selection
From MaRDI portal
Publication:2050514
DOI10.1007/s12220-019-00242-yzbMath1482.46036arXiv1905.04156OpenAlexW2967252436WikidataQ127375035 ScholiaQ127375035MaRDI QIDQ2050514
Bernat Guillén Pegueroles, Charles L. Fefferman
Publication date: 31 August 2021
Published in: The Journal of Geometric Analysis (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1905.04156
Sobolev spaces and other spaces of ``smooth functions, embedding theorems, trace theorems (46E35) Approximations and expansions (41A99)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Whitney-type extension theorems for jets generated by Sobolev functions
- Étude de quelques algèbres tayloriennes
- Whitney's extension problem for \(C^m\)
- Higher-order tangents and Fefferman's paper on Whitney's extension problem
- \({\mathcal C}^m\)-norms on finite sets and \({\mathcal C}^m\) extension
- \(C^{m,\omega}\) extension by bounded-depth linear operators
- Extension of \(C^{m, \omega}\)-smooth functions by linear operators
- Fitting a \(C^m\)-smooth function to data. II
- The Whitney problem of existence of a linear extension operator
- Differentiable functions defined in closed sets. A problem of Whitney
- Extension of smooth functions from finitely connected planar domains
- A sharp form of Whitney's extension theorem
- Fitting a \(C^m\)-smooth function to data. I.
- Interpolation and extrapolation of smooth functions by linear operators
- A generalized sharp Whitney theorem for jets
- Finiteness principles for smooth selection
- Minimal Lipschitz extensions to differentiable functions defined on a Hilbert space
- Whitney’s extension problem for multivariate 𝐶^{1,𝜔}-functions
- Sobolev extension by linear operators
- Linear Programming in Linear Time When the Dimension Is Fixed
- A decomposition of multidimensional point sets with applications to k -nearest-neighbors and n -body potential fields
- Whitney's problem on extendability of functions and an intrinsic metric
This page was built for publication: Efficient algorithms for approximate smooth selection
