Approximating Lipschitz functions by affine functions

Author(s):  
Guy David ◽  
Stephen Semmes
Author(s):  
Tuomas Orponen

Abstract A theorem of Dorronsoro from 1985 quantifies the fact that a Lipschitz function $f \colon \mathbb{R}^{n} \to \mathbb{R}$ can be approximated by affine functions almost everywhere, and at sufficiently small scales. This paper contains a new, purely geometric, proof of Dorronsoro’s theorem. In brief, it reduces the problem in $\mathbb{R}^{n}$ to a problem in $\mathbb{R}^{n - 1}$ via integralgeometric considerations. For the case $n = 1$, a short geometric proof already exists in the literature. A similar proof technique applies to parabolic Lipschitz functions $f \colon \mathbb{R}^{n - 1} \times \mathbb{R} \to \mathbb{R}$. A natural Dorronsoro estimate in this class is known, due to Hofmann. The method presented here allows one to reduce the parabolic problem to the Euclidean one and to obtain an elementary proof also in this setting. As a corollary, I deduce an analogue of Rademacher’s theorem for parabolic Lipschitz functions.


Optimization ◽  
2008 ◽  
Vol 57 (2) ◽  
pp. 249-261 ◽  
Author(s):  
S. Zlobec
Keyword(s):  

1994 ◽  
Vol 04 (03) ◽  
pp. 271-280 ◽  
Author(s):  
FLORIN BALASA ◽  
FRANK H.M. FRANSSEN ◽  
FRANCKY V.M. CATTHOOR ◽  
HUGO J. DE MAN

For multi-dimensional (M-D) signal and data processing systems, transformation of algorithmic specifications is a major instrument both in code optimization and code generation for parallelizing compilers and in control flow optimization as a preprocessor for architecture synthesis. State-of-the-art transformation techniques are limited to affine index expressions. This is however not sufficient for many important applications in image, speech and numerical processing. In this paper, a novel transformation method is introduced, oriented to the subclass of algorithm specifications that contains modulo expressions of affine functions to index M-D signals. The method employs extensively the concept of Hermite normal form. The transformation method can be carried out in polynomial time, applying only integer arithmetic.


2017 ◽  
Vol 28 (7-8) ◽  
pp. 1157-1165 ◽  
Author(s):  
S. El Ouadih ◽  
R. Daher
Keyword(s):  

1986 ◽  
Vol 46 (4) ◽  
pp. 371-384 ◽  
Author(s):  
Christian Ronse
Keyword(s):  

Sign in / Sign up

Export Citation Format

Share Document