2003
DOI: 10.1145/944567.944571
|View full text |Cite
|
Sign up to set email alerts
|

Symbolic computation of integrals by recurrence

Abstract: We discuss (1) the construction of recurrence formulas for several types of indefinite and definite integral, (2) the conversion of some of the recurrence schemes to general closed formulas, (3) the mechanization of these processes, (4) "vectorized" recurrence, (5) "telescoped" recurrence, (6) the outperformance of present automatic integration software by the procedures that use our formulas, and (7) the interface between symbolic computation (computer algebra) and mathematical discourse.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2007
2007
2011
2011

Publication Types

Select...
2

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(1 citation statement)
references
References 14 publications
(36 reference statements)
0
1
0
Order By: Relevance
“…This article is first and foremost an ode to the vision and ingenuity of computing pioneers, but it also makes the point that there are lots of hidden treasures in the "old" scientific literature, that can be revisited with today's powerful symbolic computation software. We are not the first to advocate using symbolic computations in scientific computing, see for example [3] (unfortunately he was unaware of [13]), and the current impressive application to high-energy physics [4], but we believe that there is a huge potential for exploiting symbolic computation on problems that previously seemed intractable. This would complement the extensive use (and according to Nobelist Philip Anderson, excessive and sometimes abusive use [1]) of Monte Carlo methods.…”
Section: Discussionmentioning
confidence: 99%
“…This article is first and foremost an ode to the vision and ingenuity of computing pioneers, but it also makes the point that there are lots of hidden treasures in the "old" scientific literature, that can be revisited with today's powerful symbolic computation software. We are not the first to advocate using symbolic computations in scientific computing, see for example [3] (unfortunately he was unaware of [13]), and the current impressive application to high-energy physics [4], but we believe that there is a huge potential for exploiting symbolic computation on problems that previously seemed intractable. This would complement the extensive use (and according to Nobelist Philip Anderson, excessive and sometimes abusive use [1]) of Monte Carlo methods.…”
Section: Discussionmentioning
confidence: 99%