A discussion and implementation of Brown's REX simplification algorithm

Authors:
Patrick C. McGeer
Affiliations:
University of California, Berkeley, California
Venue:
ACM SIGSAM Bulletin
Year:
1984

Citing 5
Cited 0

Computer algebra: symbolic and algebraic computation (2nd ed.)

Computer algebra: symbolic and algebraic computation (2nd ed.)
The Art of Computer Programming, 2nd Ed. (Addison-Wesley Series in Computer Science and Information

The Art of Computer Programming, 2nd Ed. (Addison-Wesley Series in Computer Science and Information
Algebraic simplification a guide for the perplexed

SYMSAC '71 Proceedings of the second ACM symposium on Symbolic and algebraic manipulation
The user-level semantic matching capability in MACSYMA

SYMSAC '71 Proceedings of the second ACM symposium on Symbolic and algebraic manipulation
ESSAYS IN ALGEBRAIC SIMPLIFICATION

ESSAYS IN ALGEBRAIC SIMPLIFICATION

Quantified Score

Hi-index	0.00

Visualization

Abstract

We discuss a simplification algorithm written by W. S. Brown [Bro69], which gives a normal form algorithm for a class of rational expressions merged with (perhaps complex) exponential expressions. Here we describe the algorithm as revised for implementation in the Maple Symbolic Computation System at the University of Waterloo [Cha83]. We provide some tests and comparisons with alternative systems.