Symmetry stabilization for fast discrete monomial transforms and polynomial evaluation
A concept of symmetric argumentations is introduced into an algorithm for stabilizing the fast discrete monomial transforms, while retaining the asymptotic complexity of the computation.
discrete orthogonal polynomial transforms
scientific article; zbMATH DE number 484447
scientific article