TITLE

# Approximation of Functions of Few Variables in High Dimensions

AUTHOR(S)
DeVore, Ronald; Petrova, Guergana; Wojtaszczyk, Przemyslaw
PUB. DATE
February 2011
SOURCE
Constructive Approximation;Feb2011, Vol. 33 Issue 1, p125
SOURCE TYPE
DOC. TYPE
Article
ABSTRACT
Let f be a continuous function defined on O:=[0,1] which depends on only l coordinate variables, $f(x_{1},\ldots,x_{N})=g(x_{i_{1}},\ldots,x_{i_{\ell}})$. We assume that we are given m and are allowed to ask for the values of f at m points in O. If g is in Lip1 and the coordinates i,..., i are known to us, then by asking for the values of f at m= L uniformly spaced points, we could recover f to the accuracy | g| L in the norm of C( O). This paper studies whether we can obtain similar results when the coordinates i,..., i are not known to us. A prototypical result of this paper is that by asking for C( l) L(log N) adaptively chosen point values of f, we can recover f in the uniform norm to accuracy | g| L when g?Lip1. Similar results are proven for more general smoothness conditions on g. Results are also proven under the assumption that f can be approximated to some tolerance e (which is not known) by functions of l variables.
ACCESSION #
56588700

## Related Articles

• ON THE CONVERSE THEOREM OF APPROXIMATION IN VARIOUS METRICS FOR NONPERIODIC FUNCTIONS. Tomić, Miloš // Publications de l'Institut Mathematique;2014, Vol. 95 Issue 109, p161

The modulus of smoothness in the norm of space Lq of nonperiodic functions of several variables is estimated by best approximations by entire functions of exponential type in the metric of space Lp, 1 â‰¤ p â‰¤ q < âˆž.

• Approximating Characteristics of the Analogs of Besov Classes with Logarithmic Smoothness. Stasyuk, S. // Ukrainian Mathematical Journal;Sep2014, Vol. 66 Issue 4, p553

We obtain the exact-order estimates of some approximating characteristics for the analogs of Besov classes of periodic functions of several variables (with logarithmic smoothness).

• APPROXIMATION OF CONTINUOUS FUNCTIONS ON V.K. DZJADYK CURVES. Jafarov, Sadulla Z. // Studia Universitatis Babes-Bolyai, Mathematica;2009, Issue 1, p107

In the given paper rational approximation is studied on closed curves of a complex plane for continuous functions in terms of the k-th modulus of continuity, k â©¾ 1. Here a rational function interpolates a continuous function at definite points.

• Sensitivity of a Land Change Model to Pixel Resolution and Precision of the Independent Variable. Chen, Hao; Pontius, Robert // Environmental Modeling & Assessment;Feb2011, Vol. 16 Issue 1, p37

It is important to know how the results from a land change model vary based on both the pixel resolution of the maps and the precision of the independent variables because subjective decisions or default values frequently determine these two factors. This paper presents an approach to measure...

• A Hybridized Finite Taylor Formula by Fluctuation Free Remainder Term for a Multivariable Function Approximation. BAYKARA, N. A.; GÜRVİT, Ercan; DEMİRALP, Metin // AIP Conference Proceedings;8/13/2009, Vol. 1148 Issue 1, p21

Based on the Taylorâ€™s Theorem for functions of several variables, a new formulation is developed here to approximate the remainder term of the Multivariate Taylor polynomial by means of the recently developed Fluctuation Theorem. This new formulation is tested on functions of two variables.

• Probabilistic Reasoning with Continuous Constraints. Carvalho, E.; Cruz, J.; Barahona, P. // AIP Conference Proceedings;9/6/2007, Vol. 936 Issue 1, p105

Continuous constraint reasoning assumes the uncertainty of numerical variables within given bounds and propagates such knowledge through a network of constraints, reducing the uncertainty. In some problems there is also information about the plausibility distribution of values within such...

• Smooth finite-dimensional approximations of distributed optimization problems via control discretization. Chernov, A. // Computational Mathematics & Mathematical Physics;Dec2013, Vol. 53 Issue 12, p1839

Approximating finite-dimensional mathematical programming problems are studied that arise from piecewise constant discretization of controls in the optimization of distributed systems of a fairly broad class. The smoothness of the approximating problems is established. Gradient formulas are...

• Bernstein-Walsh Type Theorems for Real Analytic Functions in Several Variables. Kraus, Christiane // Constructive Approximation;Apr2011, Vol. 33 Issue 2, p191

The aim of this paper is to extend the classical maximal convergence theory of Bernstein and Walsh for holomorphic functions in the complex plane to real analytic functions in R. In particular, we investigate the polynomial approximation behavior for functions F: L?C, L={(Re z,Im z): z? K}, of...

• New exact penalty function for solving constrained finite min-max problems. Ma, Cheng; Li, Xun; Cedric Yiu, Ka-Fai; Zhang, Lian-sheng // Applied Mathematics & Mechanics;Feb2012, Vol. 33 Issue 2, p253

This paper introduces a new exact and smooth penalty function to tackle constrained min-max problems. By using this new penalty function and adding just one extra variable, a constrained min-max problem is transformed into an unconstrained optimization one. It is proved that, under certain...

Share