Revision as of 19:17, 24 January 2011 edit LotsOfSoup (talk \| contribs) 2 edits m →Implementation: removed a duplicate word ← Previous edit		Revision as of 20:00, 24 January 2011 edit undo Baccala@freesoft.org (talk \| contribs) 224 edits Geddes book only "summarizes" the algorithm Next edit →
Line 1: The '''Risch algorithm''', named after Robert H. Risch, is an [[algorithm]] for the [[calculus]] operation of indefinite integration (i.e., finding [[antiderivative]]s). The algorithm transforms the problem of integration into a problem in [[differential algebra\|algebra]]. It is based on the form of the function being integrated and on methods for integrating [[rational function]]s, [[Nth root\|radical]]s, [[logarithm]]s, and [[exponential function]]s. Risch, who developed the algorithm in 1968, called it a [[decision procedure]], because it is a method for deciding ''if'' a function has an [[elementary function (differential algebra)\|elementary function]] as an indefinite integral; and also, if it does, determining it. The Risch algorithm is ~~described~~summarized (in more than 100 pages) in "Algorithms for Computer Algebra" by [[Keith Geddes\|Keith O. Geddes]], Stephen R. Czapor and George Labahn. The Risch–Norman algorithm, a faster but less powerful technique, was developed in 1976. ==Description==

Risch algorithm: Difference between revisions