Symbolic Integration
dc.date.accessioned | 2004-10-04T14:08:43Z | |
dc.date.accessioned | 2018-11-24T10:11:01Z | |
dc.date.available | 2004-10-04T14:08:43Z | |
dc.date.available | 2018-11-24T10:11:01Z | |
dc.date.issued | 1966-06-01 | en_US |
dc.identifier.uri | http://hdl.handle.net/1721.1/5900 | |
dc.identifier.uri | http://repository.aust.edu.ng/xmlui/handle/1721.1/5900 | |
dc.description.abstract | A program has been written which is capable of integrating all but two of the problems solved by the Siagle's symbollic integration program SAINT. In contrast to SAINT, it is a purely algorithmic program and it has achieved running times two to three orders of magnitude faster than SAINT. This program and some of the basic routines which it uses are described. A heuristic for integration, called the Edge heuristic, is presented. It is claimed that this heuristic with the aid of a few algorithms is capapble of solving all the problems solved by the algorithmic program and many others as well. | en_US |
dc.format.extent | 17 p. | en_US |
dc.format.extent | 2538141 bytes | |
dc.format.extent | 1988487 bytes | |
dc.language.iso | en_US | |
dc.title | Symbolic Integration | en_US |
Files in this item
Files | Size | Format | View |
---|---|---|---|
AIM-097.pdf | 1.988Mb | application/pdf | View/ |
AIM-097.ps | 2.538Mb | application/postscript | View/ |