A considerable portion of the work on special functions in computer algebra during the past decades was focused on D-finite functions. This focus was chosen for good reasons, as the concept of D-finiteness has proven to provide a fairly good compromise between, on the one hand, covering as many functions as possible, and on the other hand, keeping the class of functions restricted enough that computations stay reasonably efficient. In the talk, we will illustrate how questions about D-finite functions naturally arise in applications and how computer algebra is nowadays routinely used to answer such questions.
D-Finiteness: A Success Story
Published 2025 in International Symposium on Symbolic and Algebraic Computation
ABSTRACT
PUBLICATION RECORD
- Publication year
2025
- Venue
International Symposium on Symbolic and Algebraic Computation
- Publication date
2025-07-28
- Fields of study
Mathematics, Computer Science
- Identifiers
- External record
- Source metadata
Semantic Scholar
CITATION MAP
EXTRACTION MAP
CLAIMS
- No claims are published for this paper.
CONCEPTS
- No concepts are published for this paper.
REFERENCES
Showing 1-81 of 81 references · Page 1 of 1
CITED BY
- No citing papers are available for this paper.
Showing 0-0 of 0 citing papers · Page 1 of 1