The identification problem for transcendental functions

Details The identification problem for transcendental functions The identification problem for transcendental functions

1996-03-05

arxiv.org/abs/math/9603215v1

Mathematics

Classical Analysis and ODEs

Scientific paper

In this article algorithmic methods are presented that have essentially been introduced into computer algebra systems like Mathematica within the last decade. The main ideas are due to Stanley and Zeilberger. Some of them had already been discovered in the last century by Beke, but because of their complexity the underlying algorithms have fallen into oblivion. We combined these ideas, and added a factorization algorithm in noncommutative rings (Melenk--Koepf \cite{MK}) leading to a solution of the identification problem for a large class of transcendental functions. We present implementations of these algorithms in computer algebra systems.

Affiliated with

Also associated with

No associations

Rating

The identification problem for transcendental functions does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with The identification problem for transcendental functions, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The identification problem for transcendental functions will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-223685