Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Review Help
Search
Symbolic computation of derivations using labelled trees
Grossman R., Larson R. Journal of Symbolic Computation13 (5):511-523,1992.Type:Article
Date Reviewed: Feb 1 1994

It is well known that symbolic computation of derivations often leads to expressions of which some terms cancel in the end. The authors start with an example: a third-order differential operator the naïve computation of which requires 24 N 3 terms to be considered, but only 6 N 3 terms do not cancel, where N is the number of variables. The point of the paper is to reformulate the problem in the terminology of Lie and Hopf algebras by studying vector spaces of labeled trees. By applying a theorem of Milnor and Moore on the structure of Hopf algebras, the authors can compute a set of trees that does not contain the cancelled terms. The last section describes a parallel version of the algorithm.

The paper is an extended version of a previous conference contribution and does not contain new results. Even a misprint is not corrected: the ratio serial-to-parallel is still reversed. The authors make extensive use of theorems they have proven in former papers. People who work on simplifying expressions should be interested in these ideas, but readers must have a good knowledge of algebra.

Reviewer:  H. J. Schneider Review #: CR117255
Bookmark and Share
  Featured Reviewer  
 
Simplification Of Expressions (I.1.1 ... )
 
 
Trees (E.1 ... )
 
 
Trees (G.2.2 ... )
 
 
Miscellaneous (I.1.m )
 
Would you recommend this review?
yes
no
Other reviews under "Simplification Of Expressions": Date
Understanding expression simplification
Carette J.  Symbolic and algebraic computation (Proceedings of the 2004 International Symposium on Symbolic and Algebraic Computation, Santander, Spain, Jul 4-7, 2004)72-79, 2004. Type: Proceedings
Dec 3 2004
 Automated simplification of large symbolic expressions
Bailey D., Borwein J., Kaiser A. Journal of Symbolic Computation 60120-136, 2014. Type: Article
Nov 19 2014

E-Mail This Printer-Friendly
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud®
Terms of Use
| Privacy Policy