Algorithmic approach for formal Fourier series

DOI10.1007/s11786-014-0215-8zbMath1341.68313OpenAlexW2070084260MaRDI QIDQ748752

Etienne Nana Chiadjeu, Wolfram Koepf

Publication date: 30 October 2015

Published in: Mathematics in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11786-014-0215-8

zbMATH Keywords

Fourier seriesFourier coefficientsholonomic recurrence equationnon-commutative factorizationtrigonometric holonomic function

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) General harmonic expansions, frames (42C15) Symbolic computation of special functions (Gosper and Zeilberger algorithms, etc.) (33F10)

Uses Software

• gfun
• Maple
• Mathematica
• SumTools

Cites Work

• Differentiably finite power series
• Power series in computer algebra
• Hypergeometric solutions of linear recurrences with polynomial coefficients
• Finite singularities and hypergeometric solutions of linear recurrence equations
• Factorization of differential operators with rational functions coefficients
• Recurrence relations for the coefficients of the Fourier series expansions with respect to q-classical orthogonal polynomials
• Computing hypergeometric solutions of linear recurrence equations
• Hypergeometric summation. An algorithmic approach to summation and special function identities
• GFUN
• Computeralgebra
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Algorithmic approach for formal Fourier series