Abstract
Our main objective in this chapter is to discuss several computational aspects of the theory of basic Fourier series. This includes numerical evaluation of the zeros of basic trigonometric functions, study of their bounds and asymptotics, and numerical examples demonstrating convergence of the q-Fourier series. Most of this material appeared in our joint paper with Bill Gosper [48], who wrote the special Macsyma program “namesum” for numerical evaluation of infinite sums and infinite products.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
