Piecewise polynomial approximation on optimal meshes
نویسندگان
چکیده
منابع مشابه
On optimal polynomial meshes
Let P d n be the the space of real algebraic polynomials of d variables and degree at most n, K ⊂ R a compact set, ||p||K := supx∈K |p(x)| the usual supremum norm on K, card(Y ) the cardinality of a finite set Y . A family of sets Y = {Yn ⊂ K, n ∈ N} is called an admissible mesh in K if there exists a constant c1 > 0 depending only on K such that ||p||K ≤ c1||p||Yn , p ∈ P d n , n ∈ N, where th...
متن کامل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...
متن کاملPolynomial Meshes: Computation and Approximation
We present the software package WAM, written in Matlab, that generates Weakly Admissible Meshes and Discrete Extremal Sets of Fekete and Leja type, for 2d and 3d polynomial least squares and interpolation on compact sets with various geometries. Possible applications range from data fitting to high-order methods for PDEs.
متن کامل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 ...
متن کامل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 ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Approximation Theory
سال: 1975
ISSN: 0021-9045
DOI: 10.1016/0021-9045(75)90084-2