递归积分的符号计算

SIGSAM Bull. Pub Date : 2003-06-01 DOI:10.1145/944567.944571

M. P. Barnett

{"title":"递归积分的符号计算","authors":"M. P. Barnett","doi":"10.1145/944567.944571","DOIUrl":null,"url":null,"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.","PeriodicalId":314801,"journal":{"name":"SIGSAM Bull.","volume":"12 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2003-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"Symbolic computation of integrals by recurrence\",\"authors\":\"M. P. Barnett\",\"doi\":\"10.1145/944567.944571\",\"DOIUrl\":null,\"url\":null,\"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.\",\"PeriodicalId\":314801,\"journal\":{\"name\":\"SIGSAM Bull.\",\"volume\":\"12 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2003-06-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"SIGSAM Bull.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/944567.944571\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"SIGSAM Bull.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/944567.944571","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 4

摘要

我们讨论了(1)几种不定积分和定积分的递归公式的构造，(2)一些递归格式转化为一般封闭公式，(3)这些过程的机械化，(4)“矢量化”递归式，(5)“伸缩”递归，(6)使用我们的公式的程序优于当前的自动集成软件，以及(7)符号计算(计算机代数)和数学话语之间的接口。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Symbolic computation of integrals by recurrence

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.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

SIGSAM Bull.

自引率

0.00%

发文量