Bounds for D-finite closure properties
Symbolic Computation
2014-08-26 v1 Combinatorics
Abstract
We provide bounds on the size of operators obtained by algorithms for executing D-finite closure properties. For operators of small order, we give bounds on the degree and on the height (bit-size). For higher order operators, we give degree bounds that are parameterized with respect to the order and reflect the phenomenon that higher order operators may have lower degrees (order-degree curves).
Cite
@article{arxiv.1408.5514,
title = {Bounds for D-finite closure properties},
author = {Manuel Kauers},
journal= {arXiv preprint arXiv:1408.5514},
year = {2014}
}