Nonlinear approximation
Ronald DeVore · Acta Numerica · 1998
This is a survey of nonlinear approximation, especially that part of the subject which is important in numerical computation. Nonlinear approximation means that the approximants do not come from linear spaces but rather from nonlinear manifolds. The central question to be studied is what, if any, are the advantages of nonlinear approximation over the simpler, more established, linear methods. This question is answered by studying the rate of approximation which is the decrease in error versus the number of parameters in the approximant. The number of parameters usually correlates well with computational effort. It is shown that in many settings the rate of nonlinear approximation can be characterized by certain smoothness conditions which are significantly weaker than required in the linear theory. Emphasis in the survey will be placed on approximation by piecewise polynomials and wavelets as well as their numerical implementation. Results on highly nonlinear methods such as optimal basis selection and greedy algorithms (adaptive pursuit) are also given. Applications to image processing, statistical estimation, regularity for PDEs, and adaptive algorithms are discussed.
Cited by 877 works. doi:10.1017/s0962492900002816
Authors
References
- Orthonormal bases of compactly supported wavelets
- A Wavelet Tour of Signal Processing
- Singular Integrals and Differentiability Properties of Functions.
- Ideal Spatial Adaptation by Wavelet Shrinkage
- Entropy-based algorithms for best basis selection
- Wavelet Shrinkage: Asymptopia?
- Estimation of Dependences Based on Empirical Data.
- Biorthogonal bases of compactly supported wavelets
- Contributions to the problem of approximation of equidistant data by analytic functions. Part A. On the problem of smoothing or graduation. A first class of analytic approximation formulae
- Interpolation Spaces