Spectral algorithms of multidimensional polynomial approximation

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.