ACM Home Page
Please provide us with feedback. Feedback
An elementary algorithm for the automatic derivation and proof of tensor product identities via computer algebra
Full text PdfPdf (437 KB)
Source International Conference on Symbolic and Algebraic Computation archive
Proceedings of the 2003 international symposium on Symbolic and algebraic computation table of contents
Philadelphia, PA, USA
Pages: 50 - 57  
Year of Publication: 2003
ISBN:1-58113-641-2
Author
Frederick W. Chapman  University of Waterloo, Waterloo, Ontario, Canada
Sponsors
SIGSAM: ACM Special Interest Group on Symbolic and Algebraic Manipulation
ACM: Association for Computing Machinery
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 14,   Downloads (12 Months): 42,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/860854.860873
What is a DOI?

ABSTRACT

Tensor product identities in two variables are quite common in mathematics: Exponential, logarithmic, trigonometric, and hyperbolic functions all satisfy tensor product identities, and the binomial theorem is a familiar example of a tensor product identity for polynomial functions. This article presents a new elementary technique which can derive and prove all of these identities---automatically! This unified approach is based on the author's recent research on uniqueness theory for dual asymptotic expansions and remainder theory for Taylor interpolation on two lines. These results provide a simple iterative algorithm which derives a tensor product from a closed-form expression using the author's asymptotic splitting operator, and a simple hyperbolic eigenfunction criterion which proves that the two forms are identically equal. The author has implemented these methods as a complete derivation and proof system in the Maple 8 computer algebra system. The Maple code, which is surprisingly brief, is included in its entirety. The article also includes numerous examples which illustrate a variety of novel techniques for deriving and proving tensor product identities using this simple but effective system. (Maple is a registered trademark of Waterloo Maple Inc.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
F. W. Chapman. Theory and Applications of Dual Asymptotic Expansions. Master's thesis, Department of Applied Mathematics, University of Waterloo, Waterloo, Ontario, Canada, May 1998. Supervised by Professor Keith O. Geddes. Available through University Microfilms International. 178 pages.
 
2
F. W. Chapman. Generalized Orthogonal Series for Natural Tensor Product Interpolation. Doctoral thesis, Department of Applied Mathematics, University of Waterloo, Waterloo, Ontario, Canada, May 2003. Supervised by Professor Keith O. Geddes. Available through University Microfilms International. 300+ pages.
 
3
 
4
Maple 8 Getting Started Guide. Webcom Ltd., Toronto, 2002. Prepared by Waterloo Maple Inc. and based in part on the work of B. W. Char.
 
5
Maple 8 Learning Guide. Webcom Ltd., Toronto, 2002. Prepared by Waterloo Maple Inc. and based in part on the work of B. W. Char.
 
6
M. B. Monagan, K. O. Geddes, K. M. Heal, G. Labahn, S. M. Vorkoetter, J. McCarron, and P. DeMarco. Maple 8 Advanced Programming Guide. Webcom Ltd., Toronto, 2002.
 
7
M. B. Monagan, K. O. Geddes, K. M. Heal, G. Labahn, S. M. Vorkoetter, J. McCarron, and P. DeMarco. Maple 8 Introductory Programming Guide. Webcom Ltd., Toronto, 2002.
 
8

Collaborative Colleagues:
Frederick W. Chapman: colleagues