A new zero-test for formal power series

Authors:
Joris van der Hoeven
Affiliations:
Université Paris-Sud, France
Venue:
Proceedings of the 2002 international symposium on Symbolic and algebraic computation
Year:
2002

Citing 5
Cited 6

A differential-equations approach to functional equivalence

ISSAC '89 Proceedings of the ACM-SIGSAM 1989 international symposium on Symbolic and algebraic computation
Fast Algorithms for Manipulating Formal Power Series

Journal of the ACM (JACM)
Fast evaluation of holonomic functions near and in regular singularities

Journal of Symbolic Computation
Testing Identities of Series Defined by Algebraic Partial Differential Equations

AAECC-11 Proceedings of the 11th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
The Uniformity Conjecture

CCA '00 Selected Papers from the 4th International Workshop on Computability and Complexity in Analysis

Better simplification of elementary functions through power series

ISSAC '03 Proceedings of the 2003 international symposium on Symbolic and algebraic computation
A poly-algorithmic approach to simplifying elementary functions

ISSAC '04 Proceedings of the 2004 international symposium on Symbolic and algebraic computation
Adherence is better than adjacency: computing the Riemann index using CAD

Proceedings of the 2005 international symposium on Symbolic and algebraic computation
Solving difference equations whose coefficients are not transcendental

Theoretical Computer Science
Effective analytic functions

Journal of Symbolic Computation
Extended rate, more GFUN

Journal of Symbolic Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we present a new zero-test for expressions which are constructed from formal power solutions to algebraic differential equations using the ring operations and differentiation. We also provide a survey of all existing methods that we know of and a detailed comparison of these methods with our approach.