z-logo
open-access-imgOpen Access
An algorithm for fast discrete transformation for Fourier sums over Sobolev orthogonal polynomials generated by Chebyshev polynomials of the first kind
Author(s) -
М. С. Султанахмедов,
Tadgidin Shakh-Emirov
Publication year - 2018
Publication title -
daghestan electronic mathematical reports
Language(s) - English
Resource type - Journals
ISSN - 2500-3240
DOI - 10.31029/demr.9.6
Subject(s) - chebyshev polynomials , orthogonal polynomials , classical orthogonal polynomials , discrete orthogonal polynomials , gegenbauer polynomials , mathematics , jacobi polynomials , hahn polynomials , discrete fourier transform (general) , chebyshev equation , fourier transform , algorithm , pure mathematics , fourier analysis , mathematical analysis , fractional fourier transform

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom