ISSAC '91 Proceedings of the 1991 international symposium on Symbolic and algebraic computation
Formal solutions and factorization of differential operators with power series coefficients
Journal of Symbolic Computation
Factorization of differential operators with rational functions coefficients
Journal of Symbolic Computation
Fast evaluation of holonomic functions
Theoretical Computer Science - Special issue on real numbers and computers
Modern computer algebra
Around the numeric-symbolic computation of differential Galois groups
Journal of Symbolic Computation
Efficient accelero-summation of holonomic functions
Journal of Symbolic Computation
NumGfun: a package for numerical and analytic computation with D-finite functions
Proceedings of the 2010 International Symposium on Symbolic and Algebraic Computation
Desingularization explains order-degree curves for ore operators
Proceedings of the 38th international symposium on International symposium on symbolic and algebraic computation
Hi-index | 0.00 |
We present a new algorithm for computing hyperexponential solutions of linear ordinary differential equations with polynomial coefficients. The algorithm relies on interpreting formal series solutions at the singular points as analytic functions and evaluating them numerically at some common ordinary point. The numerical data is used to determine a small number of combinations of the formal series that may give rise to hyperexponential solutions.