An algorithm for fast discrete transformation for Fourier sums over Sobolev orthogonal polynomials generated by Chebyshev polynomials of the first kind | Zendy

AI Assistant Blog Pricing

An algorithm for fast discrete transformation for Fourier sums over Sobolev orthogonal polynomials generated by Chebyshev polynomials of the first kind

Details

The content you want is available to Zendy users.Already have an account? Click here. to sign in.