BIB-VERSION:: CS-TR-v2.0
          ID:: SBCS//stark/ratfun.pdf
       ENTRY:: October 1, 2010
ORGANIZATION:: State University of New York at Stony Brook, Computer Science
       TITLE:: An Efficient Representation for Large Arrays of Rational Expressions
        TYPE:: Technical Report
      AUTHOR:: Stark, Eugene W.
     CONTACT:: Eugene W. Stark, Department of Computer Science,
                   SUNY at Stony Brook, Stony Brook, NY 11794-4400
                   Tel: 631-632-8444 <stark@cs.sunysb.edu>
        DATE:: October 1, 2010
   RETRIEVAL:: HTTP from BSD7.CS.SUNYSB.EDU with the URL
		   http://bsd7.cs.sunysb.edu/~stark/REPORTS/ratfun.abstract

ABSTRACT::

The paper describes a method of representing an n-dimensional array of
rational expressions as an (n+1)-dimensional array of scalars and shows
how this representation readily supports the implementation of various
common array operations.
A feature of the representation is that it can take advantage of
memory-saving schemes for encoding large, sparse scalar arrays
using multi-terminal binary decision diagrams (MTBDDs).
The representation involves taking partial fraction expansions of the
entries of the array; refining the factorizations of the denominator
polynomials as required rather than presupposing the existence of a
complete factorization at the outset.