1997
DOI: 10.1007/978-3-662-03386-9_5
|View full text |Cite
|
Sign up to set email alerts
|

Integration of Transcendental Functions

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

2
119
0

Year Published

1999
1999
2009
2009

Publication Types

Select...
6
1

Relationship

1
6

Authors

Journals

citations
Cited by 58 publications
(123 citation statements)
references
References 0 publications
2
119
0
Order By: Relevance
“…However a lot of progress has been made in the area of symbolic integration (see e.g. [1]) and many computer algebra systems have an integrated module for symbolic integration. Powerful algorithms have been developed which compute the indefinite integral of an elementary function in case it exists or prove that there is no elementary primitive.…”
Section: Indefinite Integralsmentioning
confidence: 99%
See 1 more Smart Citation
“…However a lot of progress has been made in the area of symbolic integration (see e.g. [1]) and many computer algebra systems have an integrated module for symbolic integration. Powerful algorithms have been developed which compute the indefinite integral of an elementary function in case it exists or prove that there is no elementary primitive.…”
Section: Indefinite Integralsmentioning
confidence: 99%
“…There are several differences between our problem, which is teaching rules for computing integrals and the problem of computing integrals using state-of-theart algorithms for symbolic integration described for example in [1]. We know the answer and want to deduce the steps that were taken in order to solve the problem.…”
Section: Indefinite Integralsmentioning
confidence: 99%
“…The problem of computing the transcendental part of the primitive was finally solved by Lazard and Rioboo [12], Rothstein [17] and Trager [18]. For detailed descriptions and proofs of these algorithms the reader is referred to [5] and [6].…”
Section: Introductionmentioning
confidence: 99%
“…For an extensive list of literature and generalizations/refinements, like e.g. [50], we refer to [12].…”
mentioning
confidence: 99%
“…(t e ), D) of (F, D) in which we have g with (2); in particular, if such an extension exists, it computes such w, f i and c i as given in Theorem 1. For a detailed description of this algorithm see [12].…”
mentioning
confidence: 99%