Displaying similar documents to “Polynomial approximation to integral transforms”

Polynomial approximations and universality

A. Mouze (2010)

Studia Mathematica

Similarity:

We give another version of the recently developed abstract theory of universal series to exhibit a necessary and sufficient condition of polynomial approximation type for the existence of universal elements. This certainly covers the case of simultaneous approximation with a sequence of continuous linear mappings. In the case of a sequence of unbounded operators the same condition ensures existence and density of universal elements. Several known results, stronger statements or new results...

Hausdorff Approximation of Functions Different from Zero at One Point - Implementation in Programming Environment Mathematica

Kyurkchiev, Nikolay, Andreev, Andrey (2013)

Serdica Journal of Computing

Similarity:

ACM Computing Classification System (1998): G.1.2. Moduli for numerical finding of the polynomial of the best Hausdorff approximation of the functions which differs from zero at just one point or having one jump and partially constant in programming environment MATHEMATICA are proposed. They are tested for practically important functions and the results are graphically illustrated. These moduli can be used for scientific research as well in teaching process of Approximation...

Greedy Algorithms for Adaptive Approximation

Albert Cohen (2009)

Bollettino dell'Unione Matematica Italiana

Similarity:

We discuss the performances of greedy algorithms for two problems of numerical approximation. The first one is the best approximation of an arbitrary function by an N-terms linear combination of simple functions adaptively picked within a large dictionary. The second one is the approximation of an arbitrary function by a piecewise polynomial function on an optimally adapted triangulation of cardinality N. Performance is measured in terms of convergence rate with respect to the number...

The Weierstrass theorem on polynomial approximation

Rudolf Výborný (2005)

Mathematica Bohemica

Similarity:

In the paper a simple proof of the Weierstrass approximation theorem on a function continuous on a compact interval of the real line is given. The proof is elementary in the sense that it does not use uniform continuity.

Solving a permutation problem by a fully polynomial-time approximation scheme

Stanisław Gawiejnowicz, Wiesław Kurc, Lidia Pankowska (2010)

Discussiones Mathematicae, Differential Inclusions, Control and Optimization

Similarity:

For a problem of optimal discrete control with a discrete control set composed of vertices of an n-dimensional permutohedron, a fully polynomial-time approximation scheme is proposed.