Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

A discussion and implementation of Brown's REX simplification algorithm

A discussion and implementation of Brown's REX simplification algorithm 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. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png ACM SIGSAM Bulletin Association for Computing Machinery

A discussion and implementation of Brown's REX simplification algorithm

ACM SIGSAM Bulletin , Volume 18 (1) – Feb 1, 1984

Loading next page...
 
/lp/association-for-computing-machinery/a-discussion-and-implementation-of-brown-s-rex-simplification-d7qLg5XFyy

References (12)

Publisher
Association for Computing Machinery
Copyright
Copyright © 1984 by ACM Inc.
ISSN
0163-5824
DOI
10.1145/1089348.1089350
Publisher site
See Article on Publisher Site

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.

Journal

ACM SIGSAM BulletinAssociation for Computing Machinery

Published: Feb 1, 1984

There are no references for this article.