Partitioning of algebraic subexpressions in computer algebra systems
Richard J. Fateman
Abstract
Richard J. Fateman
Abstract
A popular technique to direct transformations of algebraic expressions in a computer algebra system such as Macsyma/Maxima or Mathematica is to first write out a pattern or template for some expected class of "input" expressions and use a built-in system routine to match it, identifying pieces and giving them names, then proceeding to compute with these parts. Sometimes this is not such a good approach, and an alternative, presented here, may be more appealing.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
A popular technique to direct transformations of algebraic expressions in a computer algebra system such as Macsyma/Maxima or Mathematica is to first write out a pattern or template for some expected class of "input" expressions and use a built-in system routine to match it, identifying pieces and giving them names, then proceeding to compute with these parts. Sometimes this is not such a good approach, and an alternative, presented here, may be more appealing.
Key concepts: Symbolic computation, Algebraic expression, Class (philosophy), Algebraic number, Computer science, Algebra over a field, Theoretical computer science, Maxima