A preview of the next IBM-PC version of muMATH

  • David R. Stoutemyer
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 203)


A complete redesign of muMATH is nearing completion, and this paper previews some of the new capabilities, which include the following:
  1. 1.

    Rational arithmetic can be either exact or automatically rounded to any precision, thus providing a unified alternative to the usual combination of exact rational plus arbitrary-precision floating-point arithmetic.

  2. 2.

    There is function plot graphics.

  3. 3.

    Two-dimensional output of expressions is provided, including raised exponents and built-up fractions.

  4. 4.

    The algebraic capabilities are substantially improved:

  1. a)

    Simplification is more automatic and thorough, with options that are easier to use.

  2. b)

    The default normal form tends to preserve factors at all levels while automatically achieving significant simplification of rational expressions, radicals and elementary transcendental expressions.

  3. c)

    There are polynomial expansion, gcd and factoring algorithms with speeds that compare favorably with those of systems running on mainframes or Lisp machines.



Partial Factorization Greatest Common Divisor Rational Arithmetic Implicit Operator Infinite Precision 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

9. References

  1. Barton, D. and Fitch, J.P. [1972]: "Application of Algebraic Manipulation Programs in Physics", Reports on Progress in Physics 35, pp. 235ff.Google Scholar
  2. Bourne, S.R. [1972]: ACM SIGSAM Bulletin 24, pp. 8–11.Google Scholar
  3. Brown, W.S. [1974]: "On Computing with Factored Rational Expressions", ACM SIGSAM Bulletin 31, August, pp. 26–34.Google Scholar
  4. Campbell, J.A. [1972]: "Problem 2 — The Y2n Functions, ACM SIGSAM Bulletin 22, pp. 8–9.Google Scholar
  5. Fateman, R.J. [1976]: "The MACSYMA ‘Big-Floating-Point’ Arithmetic System", Proceedings of the 1976 ACM Symposium on Symbolic and Algebraic Computation, editor R.D. Jenks, pp. 209–213.Google Scholar
  6. Gentleman, W.M. and Johnson, S.C., [1976]: "Analysis of Algorithms, A Case Study: Determinants of Matrices With Polynomial Entries", ACM Transactions on Mathematical Software 2, No. 3, September, pp. 232–241.CrossRefGoogle Scholar
  7. Hall, A.D. [1974]: "Factored Rational Expressions in ALTRAN", ACM SIGSAM Bulletion 31, August, pp. 35–45.Google Scholar
  8. Horowitz, E. [1975]: "On Computing the Exact Determinant of Matrices with Polynomial Entries", Journal of the ACM 22, No 1, January, pp. 38–50.CrossRefGoogle Scholar
  9. Matula, D.W. and Kornerup, P. [1985]: "Finite Precision Rational Arithmetic: Slash Number Systems", IEEE Transactions on Computers C-34, No. 1, January 1985, pp. 3–18.Google Scholar
  10. Muir, S.T. [1960]: A Treatise on the Theory of Determinants, Dover Press, N.Y.Google Scholar
  11. Sasaki, T. [1979]: "An Arbitrary Precision Real Arithmetic Package in REDUCE", in Symbolic & Algebraic Computation, Lecture Notes in Computer Science # 72, editor E.W. Ng, Springer Verlag, Berlin. pp. 358–368.Google Scholar
  12. Stoutemyer, D.R. [1984a]: "Which Polynomial Representation is Best?", Proceedings of the 1984 MACSYMA Users' Conference, editor E. Golden, General Electric, Schenectady, N.Y. USA, pp. 221–243.Google Scholar
  13. Stoutemyer, D.R. [1984b]: "Polynomial Remainder Sequence Greatest Common Divisors Revisited", proceedings of RSYMSAC, The Second International Symposium on Symbolic and Algebraic Computation by Computers, RIKEN Institute of Physical and Chemical Research, Wako-shi, Saitama, 351–01 Japan, pp. 1–1 through 1–12.Google Scholar
  14. Wang, P.S. [1978]: "An Improved Multivariable Polynomial Factorising Algorithm", Math. Comp. 32, pp. 1215–1231.Google Scholar
  15. Wang, P.S. [1979]: "Matrix Computations in MACSYMA", Proceedings of the 1977 MACSYMA User's Conference, NASA CP 2012, pp. 435–446.Google Scholar
  16. Zippel, R. [1979]: "Probabilistic Algorithms for Sparse Polynomials", Symbolic & Algebraic Computation, editor E.W. Ng, Lecture Notes in Computer Science 72, Springer-Verlag, pp. 227–239.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1985

Authors and Affiliations

  • David R. Stoutemyer
    • 1
  1. 1.Soft Warehouse, Inc.HonoluluUSA

Personalised recommendations