On best error bounds for approximation by piecewise polynomial functions
نویسندگان
چکیده
منابع مشابه
Algorithms and Error Bounds for Multivariate Piecewise Constant Approximation
Let Ω be a bounded domain in R, d ≥ 2. Suppose that ∆ is a partition of Ω into a finite number of subsets ω ⊂ Ω called cells, where the default assumptions are just these: |ω| := meas(ω) > 0 for all ω ∈ ∆, |ω ∩ ω′| = 0 if ω 6= ω, and ∑ ω∈∆ |ω| = |Ω|. For a finite set D we denote its cardinality by |D|, so that |∆| stands for the number of cells ω in ∆. Given a function f : Ω → R, we are interes...
متن کامل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 operators for spectral approximation of piecewise analytic functions
We construct a sequence of globally defined polynomial valued operators, using linear combinations of either the coefficients in the orthogonal polynomial expansion of the target function with respect to a very general mass distribution μ or the values of the function at suitable points on [−1, 1], so that the degree of approximation by these operators globally is commensurate with the degree o...
متن کاملThe best uniform polynomial approximation of two classes of rational functions
In this paper we obtain the explicit form of the best uniform polynomial approximations out of Pn of two classes of rational functions using properties of Chebyshev polynomials. In this way we present some new theorems and lemmas. Some examples will be given to support the results.
متن کاملCompressing ECG signals by piecewise polynomial approximation
Compression of digital ElectroCardioGram (ECG) signals has traditionally been tackled by heuristical approaches. Recently, it has been demonstrated [1] that exact optimization algorithms outclass these heuristical approaches by a wide margin with respect to reconstruction error. As opposed to traditional time-domain algorithms, where some heuristic is used to extract representative signal sampl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Numerische Mathematik
سال: 1976
ISSN: 0029-599X,0945-3245
DOI: 10.1007/bf01396181