Hausdorff Approximation of Functions Different from Zero at One Point - Implementation in Programming Environment Mathematica
Kyurkchiev, Nikolay; Andreev, Andrey
Serdica Journal of Computing (2013)
- Volume: 7, Issue: 2, page 135-152
- ISSN: 1312-6555
Access Full Article
topAbstract
topHow to cite
topKyurkchiev, Nikolay, and Andreev, Andrey. "Hausdorff Approximation of Functions Different from Zero at One Point - Implementation in Programming Environment Mathematica." Serdica Journal of Computing 7.2 (2013): 135-152. <http://eudml.org/doc/268665>.
@article{Kyurkchiev2013,
abstract = {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 theory and its application.},
author = {Kyurkchiev, Nikolay, Andreev, Andrey},
journal = {Serdica Journal of Computing},
keywords = {Hausdorff Distance; Best Approximation; Hausdorff distance; best approximation; synthesis of optimum aerial grids},
language = {eng},
number = {2},
pages = {135-152},
publisher = {Institute of Mathematics and Informatics Bulgarian Academy of Sciences},
title = {Hausdorff Approximation of Functions Different from Zero at One Point - Implementation in Programming Environment Mathematica},
url = {http://eudml.org/doc/268665},
volume = {7},
year = {2013},
}
TY - JOUR
AU - Kyurkchiev, Nikolay
AU - Andreev, Andrey
TI - Hausdorff Approximation of Functions Different from Zero at One Point - Implementation in Programming Environment Mathematica
JO - Serdica Journal of Computing
PY - 2013
PB - Institute of Mathematics and Informatics Bulgarian Academy of Sciences
VL - 7
IS - 2
SP - 135
EP - 152
AB - 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 theory and its application.
LA - eng
KW - Hausdorff Distance; Best Approximation; Hausdorff distance; best approximation; synthesis of optimum aerial grids
UR - http://eudml.org/doc/268665
ER -
NotesEmbed ?
topTo embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.