On the complexity of approximate realization of analytic functions by schemes and formulas
Vestnik Moskovskogo universiteta. Matematika, mehanika, no. 4 (1983), pp. 36-43
Voir la notice de l'article provenant de la source Math-Net.Ru
Upper and lower bounds are found for the complexity of approximate calculation of real analytic functions of one real variable using networks of functional elements and formulas.
@article{VMUMM_1983_4_a6,
author = {S. B. Gashkov},
title = {On the complexity of approximate realization of analytic functions by schemes and formulas},
journal = {Vestnik Moskovskogo universiteta. Matematika, mehanika},
pages = {36--43},
publisher = {mathdoc},
number = {4},
year = {1983},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/VMUMM_1983_4_a6/}
}
TY - JOUR AU - S. B. Gashkov TI - On the complexity of approximate realization of analytic functions by schemes and formulas JO - Vestnik Moskovskogo universiteta. Matematika, mehanika PY - 1983 SP - 36 EP - 43 IS - 4 PB - mathdoc UR - http://geodesic.mathdoc.fr/item/VMUMM_1983_4_a6/ LA - ru ID - VMUMM_1983_4_a6 ER -
S. B. Gashkov. On the complexity of approximate realization of analytic functions by schemes and formulas. Vestnik Moskovskogo universiteta. Matematika, mehanika, no. 4 (1983), pp. 36-43. http://geodesic.mathdoc.fr/item/VMUMM_1983_4_a6/