Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Review Help
Search
Multilinear Cayley factorization
White N. Journal of Symbolic Computation11 (5-6):421-438,1991.Type:Article
Date Reviewed: May 1 1993

The computer algebra algorithm developed in this paper is useful in computer-aided geometric reasoning. In particular, certain geometric calculations can be converted into manipulations in the exterior algebra (Grassman algebra). Rewriting these statements to provide a geometric interpretation is more complex, however. By making use of the natural relationship between projective geometry and the Cayley algebra, statements in the exterior algebra can be expressed as Cayley algebra expressions through a process called Cayley factorization. The necessary background on Cayley algebra and the exterior algebra are provided as part of the detailed explanation of the algorithm. Implementation details and open questions are also discussed.

Reviewer:  R. W. Wilkerson Review #: CR116193
Bookmark and Share
 
Algebraic Algorithms (I.1.2 ... )
 
 
Computations On Discrete Structures (F.2.2 ... )
 
Would you recommend this review?
yes
no
Other reviews under "Algebraic Algorithms": Date
On the synthetic factorization of projectively invariant polynomials
Sturmfels B. (ed), Whiteley W. Journal of Symbolic Computation 11(5-6): 439-453, 1991. Type: Article
Dec 1 1992
Invariant and geometric aspects of algebraic complexity theory I
Morgenstern J. Journal of Symbolic Computation 11(5-6): 455-469, 1991. Type: Article
Jun 1 1993
The dotted straightening algorithm
McMillan T., White N. Journal of Symbolic Computation 11(5-6): 471-482, 1991. Type: Article
May 1 1993
more...

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