A computable extension for D-finite functions: DD-finite functions
| Autor: | Antonio Jiménez-Pastor, Veronika Pillwein |
|---|---|
| Rok vydání: | 2019 |
| Předmět: |
Large class
Class (set theory) Algebra and Number Theory Formal power series 010102 general mathematics Closure (topology) 010103 numerical & computational mathematics Extension (predicate logic) 01 natural sciences Algebra Computational Mathematics Iterated function 0101 mathematics Variety (universal algebra) Mathematics |
| Zdroj: | Journal of Symbolic Computation. 94:90-104 |
| ISSN: | 0747-7171 |
| DOI: | 10.1016/j.jsc.2018.07.002 |
| Popis: | Differentiably finite (D-finite) formal power series form a large class of useful functions for which a variety of symbolic algorithms exists. Among these methods are several closure properties that can be carried out automatically. We introduce a natural extension of these functions to a larger class of computable objects for which we prove closure properties. These are again algorithmic. This extension can be iterated constructively preserving the closure properties. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full Text from ScienceDirect