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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Suslov, S.K. (2003). Numerical Investigation of Basic Fourier Series. In: An Introduction to Basic Fourier Series. Developments in Mathematics, vol 9. Springer, Boston, MA. https://doi.org/10.1007/978-1-4757-3731-8_11
Download citation
DOI: https://doi.org/10.1007/978-1-4757-3731-8_11
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4419-5244-8
Online ISBN: 978-1-4757-3731-8
eBook Packages: Springer Book Archive