Displaying similar documents to “On the Approximation of the Generalized Cut Function of Degree p+1 By Smooth Sigmoid Functions”

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

The best uniform quadratic approximation of circular arcs with high accuracy

Abedallah Rababah (2016)

Open Mathematics

Similarity:

In this article, the issue of the best uniform approximation of circular arcs with parametrically defined polynomial curves is considered. The best uniform approximation of degree 2 to a circular arc is given in explicit form. The approximation is constructed so that the error function is the Chebyshev polynomial of degree 4; the error function equioscillates five times; the approximation order is four. For θ = π/4 arcs (quarter of a circle), the uniform error is 5.5 × 10−3. The numerical...

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.

On a Problem of Best Uniform Approximation and a Polynomial Inequality of Visser

M. A. Qazi (2014)

Bulletin of the Polish Academy of Sciences. Mathematics

Similarity:

In this paper, a generalization of a result on the uniform best approximation of α cos nx + β sin nx by trigonometric polynomials of degree less than n is considered and its relationship with a well-known polynomial inequality of C. Visser is indicated.