Nonlinear piecewise polynomial approximation beyond Besov spaces
نویسندگان
چکیده
منابع مشابه
Nonlinear piecewise polynomial approximation beyond Besov spaces
We study nonlinear n-term approximation in Lp(R) (0 < p <∞) from Courant elements or (discontinuous) piecewise polynomials generated by multilevel nested triangulations of R2 which allow arbitrarily sharp angles. To characterize the rate of approximation we introduce and develop three families of smoothness spaces generated by multilevel nested triangulations. We call them B-spaces because they...
متن کاملNonlinear piecewise polynomial approximation: Theory and Algorithms
Nonlinear piecewise polynomial approximation: Theory and Algorithms Borislav Karaivanov We study nonlinear n-term approximation in Lp(R) (0 < p < ∞) from Courant elements or (discontinuous) piecewise polynomials generated by multilevel nested triangulations of R which allow arbitrarily sharp angles. To characterize the rate of approximation we introduce and develop three families of smoothness ...
متن کاملAlgorithms for Nonlinear Piecewise Polynomial Approximation: Theoretical Aspects
In this article algorithms are developed for nonlinear n-term Courant element approximation of functions in Lp (0 < p ≤ ∞) on bounded polygonal domains in R2. Redundant collections of Courant elements, which are generated by multilevel nested triangulations allowing arbitrarily sharp angles, are investigated. Scalable algorithms are derived for nonlinear approximation which both capture the rat...
متن کاملRemarks on Piecewise Polynomial Approximation
The theoretical and experimental background for the approximation of "real-world" functions is reviewed to motivate the use of piecewise polynomial approximations. It is possible in practice ~o achieve the results suggested by the theory for piecewise polynomials. A convergent adaptive algorithm is outlined which effectively and efficiently computes smooth piecewise polynomial approxImations to...
متن کاملFiltering Motion Data Through Piecewise Polynomial Approximation
In this work we propose a system to filter human movement data and store them into a compact representation. We are interested both in noise reduction and in segmentation. The method described in this paper relies on a iterative optimization and guarantee to converge to a local optimum: it proved anyway to produce stable results and to provide an accurate segmentation on the analyzed data . We ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied and Computational Harmonic Analysis
سال: 2003
ISSN: 1063-5203
DOI: 10.1016/j.acha.2003.08.002