Displaying similar documents to “Polynomial approximations and universality”

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

On approximation with nodes

S. Paszkowski

Similarity:

CONTENTSIntroduction1. Approximation with nodes............................................................................................. 32. Characteristic property of the optimal polynomial......................................................... 43. Notation......................................................................................................................... 5CHAPTER I. Limit properties of approximation with nodes4. Statement of the problem.................................................................................................

Asymptotic differential approximation ratio: Definitions, motivations and application to some combinatorial problems

Marc Demange, Vangelis Th. Paschos (2010)

RAIRO - Operations Research

Similarity:

We first motivate and define a notion of asymptotic differential approximation ratio. For this, we introduce a new class of problems called radial problems including in particular the hereditary ones. Next, we validate the definition of the asymptotic differential approximation ratio by proving positive, conditional and negative approximation results for some combinatorial problems. We first derive a differential approximation analysis of a classical greedy algorithm for bin packing,...