Reasoning about the elementary functions of complex analysis

被引:0
|
作者
Corless, RM [1 ]
Davenport, JH
Jeffrey, DJ
Litt, G
Watt, SM
机构
[1] Univ Western Ontario, Ontario Res Ctr Comp Algebra, London, ON N6A 3K7, Canada
[2] Univ Bath, Dept Math Sci, Bath BA2 7AY, Avon, England
关键词
elementary functions; branch cuts; complex identities;
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
There are many problems with the simplification of elementary functions, particularly over the complex plane. Systems tend to make major errors, or not to simplify enough. In this paper we outline the "unwinding number" approach to such problems, and show how it can be used to prevent errors and to systematise such simplification, even though we have not yet reduced the simplification process to a complete algorithm. The unsolved problems axe probably more amenable to the techniques of artificial intelligence and theorem proving than the original problem of complex-variable analysis.
引用
收藏
页码:115 / 126
页数:12
相关论文
共 50 条