Stability of Affine Approximations on Bounded Domains

V. Y. Protasov ()
Additional contact information
V. Y. Protasov: Moscow State University

Chapter Chapter 37 in Nonlinear Analysis, 2012, pp 587-606 from Springer

Abstract: Abstract Let f be an arbitrary function defined on a convex subset G of a linear space. Suppose the restriction of f on every straight line can be approximated by an affine function on that line with a given precision ε>0 (in the uniform metric); what is the precision of approximation of f by affine functionals globally on G? This problem can be considered in the framework of stability of linear and affine maps. We show that the precision of the global affine approximation does not exceed C(logd)ε, where d is the dimension of G, and C is an absolute constant. This upper bound is sharp. For some bounded domains G⊂ℝ d , it can be improved. In particular, for the Euclidean balls the upper bound does not depend on the dimension, and the same holds for some other domains. As auxiliary results we derive estimates of the multivariate affine approximation on arbitrary domains and characterize the best affine approximations.

Keywords: Approximation; Affine functionals; Stability; Refinement theorem; 41A50; 41A63; 39A30; 52A20 (search for similar items in EconPapers)
Date: 2012
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:spochp:978-1-4614-3498-6_37

Ordering information: This item can be ordered from
http://www.springer.com/9781461434986

DOI: 10.1007/978-1-4614-3498-6_37

Access Statistics for this chapter

More chapters in Springer Optimization and Its Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().