Optimale Differentiations- und Integrationsformeln in C0 [a, b]. - Optimal Differentiation and Integration Formulas in C0 [a, b].
Recently it was proved for 1 < p < ∞ that , a modulus of smoothness on the unit sphere, and , a K-functional involving the Laplace-Beltrami operator, are equivalent. It will be shown that the range 1 < p < ∞ is optimal; that is, the equivalence does not hold either for p = ∞ or for p = 1.
We study the problem of Lagrange interpolation of functions of two variables by quadratic polynomials under the condition that nodes of interpolation are vertices of a triangulation. For an extensive class of triangulations we prove that every inner vertex belongs to a local six-tuple of vertices which, used as nodes of interpolation, have the following property: For every smooth function there exists a unique quadratic Lagrange interpolation polynomial and the related local interpolation error...
The paper has been presented at the 12th International Conference on Applications of Computer Algebra, Varna, Bulgaria, June, 2006.To get guaranteed machine enclosures of a special function f(x), an upper bound ε(f) of the relative error is needed, where ε(f) itself depends on the error bounds ε(app); ε(eval) of the approximation and evaluation error respectively. The approximation function g(x) ≈ f(x) is a rational function (Remez algorithm), and with sufficiently high polynomial degrees ε(app) becomes...
* Supported by the Army Research Office under grant DAAD-19-02-10059.Bounds on the error of certain penalized least squares data fitting methods are derived. In addition to general results in a fairly abstract setting, more detailed results are included for several particularly interesting special cases, including splines in both one and several variables.