Spectral algorithms of multidimensional polynomial approximation
Matematičeskoe modelirovanie, Tome 8 (1996) no. 8, pp. 69-75
Cet article a éte moissonné depuis la source Math-Net.Ru
The algorithms of multidimensional polynomial approximation on the base of spectral representations of multidimensional sequences are suggested. They use Walsh-like miltidimensional discrete orthogonal transformations. Undoubted merit of these algorithms is low multiplicational complexity.
@article{MM_1996_8_8_a5,
author = {F. B. Abutaliev and I. I. Ismagilov},
title = {Spectral algorithms of multidimensional polynomial approximation},
journal = {Matemati\v{c}eskoe modelirovanie},
pages = {69--75},
year = {1996},
volume = {8},
number = {8},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/MM_1996_8_8_a5/}
}
F. B. Abutaliev; I. I. Ismagilov. Spectral algorithms of multidimensional polynomial approximation. Matematičeskoe modelirovanie, Tome 8 (1996) no. 8, pp. 69-75. http://geodesic.mathdoc.fr/item/MM_1996_8_8_a5/