NDLI: Algorithmic Approach for Formal Fourier Series

Please wait, while we are loading the content...

Algorithmic Approach for Formal Fourier Series

Content Provider	Springer Nature Link
Author	Koepf, Wolfram Chiadjeu, Etienne Nana
Copyright Year	2014
Abstract	The study of trigonometric series has started at the beginning of the nineteenth century. Joseph Fourier made the important observation that almost every function of a closed interval can be decomposed into the sum of sine and cosine functions. This technique to develop a function into a trigonometric series was published for the first time in 1822 by Joseph Fourier. The resulting series is nowadays called Fourier series. Since Fourier’s time, many different approaches to understand the concept of Fourier series have been discovered, each of which emphasizes different aspects of the topic. Some of the more powerful and elegant approaches are based on mathematical ideas and tools that were not available at the time Fourier completed his original work. Although the original motivation was to solve the heat equation for a metal plate, it later became obvious that the same technique could be applied to a wide variety of mathematical and physical problems and has many applications in electrical engineering, vibration analysis, acoustics, optics, signal treatment, image processing, etc. Despite the importance of Fourier series, the method used until now to compute them via computer algebra systems (CAS) is essentially based on the same principle as in Fourier’s time, i.e. by the evaluation of certain integrals. Unfortunately this technique is not completely successful for many functions. Although numeric values of the Fourier coefficients might be available, symbolic values are often not accessible. Modern CAS like Maple or Mathematica can compute such integrals in many cases for a given $${n \in \mathbb{Z}}$$ . However if one is interested in the Fourier coefficients for all $${n \in \mathbb{Z}}$$ , then n is considered as a given symbolic variable and such integrals can be computed only in few cases. In this paper we introduce an algorithmic approach to compute those Fourier coefficients, involving differential equations of a particular form, and recurrence equations. This approach extrapolates the computation of the Fourier series for functions for which the computation of Fourier coefficients via the definition is out of reach for current CAS.A holonomic recurrence equation for a $_{ n }$, i.e. a recurrence equation which is linear, homogeneous and has polynomial coefficients, can be written in operator notation as L(a $_{ n }$) = 0. The operator L can be interpreted as a non-commutative polynomial via the commutator rule Nn − nN = N, N denoting the shift operator Na $_{ n }$ = a $_{ n+1}$. In the last section we show how our algorithm can be used to factorize such recurrence operators in certain cases.
Starting Page	365
Ending Page	389
Page Count	25
File Format	PDF
ISSN	16618270
Journal	Mathematics in Computer Science
Volume Number	9
Issue Number	3
e-ISSN	16618289
Language	English
Publisher	Springer Basel
Publisher Date	2014-11-14
Publisher Place	Basel
Access Restriction	One Nation One Subscription (ONOS)
Subject Keyword	Fourier series Fourier coefficients Trigonometric holonomic function Holonomic recurrence equation Non-commutative factorization Symbolic computation Symbolic computation and algebraic computation Mathematics Computer Science
Content Type	Text
Resource Type	Article
Subject	Applied Mathematics Computational Theory and Mathematics Computational Mathematics

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

A Fast Approach to Creative Telescoping

Trigonometric interpolation on lattice grids

Symbolic Computation Applied to the Study of the Kernel of a Singular Integral Operator with Non-Carleman Shift and Conjugation

The natural algorithmic approach of mixed trigonometric-polynomial problems

Space Saving Calculation of Symbolic Resultants

Generalized Gibbs phenomenon for Fourier partial sums and de la Vallée-Poussin sums

Combinatorial Sublinear-Time Fourier Algorithms

Cylindrical Algebraic Sub-Decompositions

Exploring the Spectra of Some Classes of Singular Integral Operators with Symbolic Computation

Algorithmic Approach for Formal Fourier Series

Similar Documents

A Fast Approach to Creative Telescoping

Trigonometric interpolation on lattice grids

Symbolic Computation Applied to the Study of the Kernel of a Singular Integral Operator with Non-Carleman Shift and Conjugation

The natural algorithmic approach of mixed trigonometric-polynomial problems

Space Saving Calculation of Symbolic Resultants

Generalized Gibbs phenomenon for Fourier partial sums and de la Vallée-Poussin sums

Combinatorial Sublinear-Time Fourier Algorithms

Cylindrical Algebraic Sub-Decompositions

Exploring the Spectra of Some Classes of Singular Integral Operators with Symbolic Computation

Algorithmic Approach for Formal Fourier Series