Displaying similar documents to “On restricted derivative 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...

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...