Skip to main content
SpringerLink
Log in

Current problems in computer algebra systems design

  • Symbolic And Algebraic Computation — Systems Design
  • Conference paper
  • First Online:
Design and Implementation of Symbolic Computation Systems (DISCO 1990)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 429))

Abstract

Computer Algebra systems have been with us for over twenty years, but there is still no consensus on what an “ideal” system would look like. There are all sorts of trade-offs between portability, functionality and efficiency. This paper discusses a few of these issues.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [Anderson et al., 1979] Anderson, J.D., Lau, E.L. & Hellings, R.W., Use of Macsyma as an Automatic Fortran Generator. Proc. 1979 MACSYMA Users' Conference (M.I.T., Cambridge, Mass., 1979) pp. 583–595.

    Google Scholar 

  2. [Antweiler et al., 1988] Antweiler,W., Strotmann,A. & Winkelmann,V., A REDUCE-TEX-Interface. University of Cologne Computer Center Technical Report, April 1988.

    Google Scholar 

  3. [Bradford et al., 1986] Bradford, R.J., Hearn, A.C., Padget, J.A. & Schrufer, E., Enlarging the RE-DUCE Domain of Computation. Proc. SYMSAC 86 (ACM, New York, 1986) pp. 100–106.

    Google Scholar 

  4. Cohen, J., Garbage Collection of Linked Data Structures. Computing Surveys 13 (1981) pp. 341–367.

    Google Scholar 

  5. Coppersmith,D. & Davenport,J.H., Polynomials whose Powers are Sparse. IBM Research Report RC 14859, August 21, 1989

    Google Scholar 

  6. Deutsch,P., Bytelisp and its Alto Implementation. Proc. LISP 80, pp. 231–242.

    Google Scholar 

  7. Deutsch, P., & Bobrow, D., An efficient, Incremental Automatic Garbage Collector. Comm. ACM 19 (1976) pp. 522–526.

    Google Scholar 

  8. Dewar, M.C., IRENA — An Integrated Symbolic and Numerical Computation Environment. Proc. ISSAC 89 (ACM, New York, 1989), pp. 171–179.

    Google Scholar 

  9. Dewar,M.C. & Richardson,M.G., Reconciling Symbolic and Numeric Computation in a Practical Setting. To appear in Proc. DISCO 90.

    Google Scholar 

  10. Fitch,J.P., CAMAL Users' Manual. University of Cambridge Computer Laboratory, 1974.

    Google Scholar 

  11. Fitch,J.P. & Hall,R.G., A Delivery System for Reduce. Submitted to ISSAC '90.

    Google Scholar 

  12. Fitch, J.P. & Norman, A.C., Implementing LISP in a High-level Language. Software — Practice and Experience, 7 (1977) pp. 713–725. CR 33,698 (Vol. 19 (1978)).

    Google Scholar 

  13. [Fitch et al., 1976] Fitch, J.P., Herbert, P. & Norman, A.C., Design Features of COBALG. Proc. SYMSAC 76 (ACM, New York, 1976) pp. 185–188.

    Google Scholar 

  14. Gates, B.L., GENTRAN: An Automatic Code Generation Facility for REDUCE. SIGSAM Bulletin 19 (1985) 3, pp. 24–42.

    Google Scholar 

  15. Gates, B.L., A Numeric Code Generation Facility for Reduce. Proc. SYMSAC 86 (ACM, New York, 1986) pp. 94–99.

    Google Scholar 

  16. [Griss et al., 1982] Griss,M.L., Benson,E. & Hearn,A.C., Current Status of a Portable LISP Compiler. Proc. SIGPLAN '82 Symposium on Compiler Construction (SIGPLAN Notices 17 (1982) No. 6) pp. 276–283.

    Google Scholar 

  17. Hulshof,B.J.A. & van Hulzen,J.A., An Expression Compression Package for REDUCE based on Factorization and Controlled Expansion. Proc. EUROCAL 85, Vol. 2 (Springer Lecture Notes in Computer Science Vol. 204, Springer-Verlag, 1985) pp. 315–316.

    Google Scholar 

  18. van Hulzen, J.A., Breuer's Grow Factor Algorithm in Computer Algebra. Proc. SYMSAC 81 (ACM, New York, 1981) pp. 100–104.

    Google Scholar 

  19. van Hulzen,J.A., Code Optimization of Multivariate Polynomial Schemes: A Pragmatic Approach. Proc. EUROCAL 83 [Springer Lecture Notes in Computer Science 162, Springer-Verlag, 1983] pp. 286–300.

    Google Scholar 

  20. Jenks, R.D., A Brief Introduction to Scratchpad II. Scratchpad II Newsletter 1 (1985) 1, pp. 1–3.

    Google Scholar 

  21. Kernighan,B.W. & Ritchie,D.M., The C Programming Language. Prentice-Hall, 1978.

    Google Scholar 

  22. [Marti et al., 1978] Marti, J.B., Hearn, A.C., Griss M.L. & Griss, C., Standard LISP Report. Utah Symbolic Computation Group Report UCP-60, University of Utah, Salt Lake City, Jan. 1978. SIGSAM Bulletin 14 (1980) 1, pp. 23–43.

    Google Scholar 

  23. Neun,W., Private Communication 8 Feb. 1990

    Google Scholar 

  24. Rényi, A., On the Minimal Number of Terms of the Square of a Polynomial. Hungarica Acta Math. 1 (1947) pp. 30–34.

    Google Scholar 

  25. Richard, F., Graphical Analysis of Complex O.D.E. Solutions. Computer Graphics Forum 6 (1987) 4, pp. 335–341.

    Google Scholar 

  26. Richard,F., Représentations graphiques de solutions d'équations différentielles dans le champ complexe. Thèse de Doctorat, Strasbourg, 16.9.88 (IRMA Publication 1988 368/TS-08).

    Google Scholar 

  27. Sharma,N. & Wang,P.S., Symbolic Derivation and Automatic Generation of Parallel Routines for Finite Element Analysis. Proc. ISSAC '88 (ed. P. Gianni) Springer lecture Notes in Computer Science 358, pp. 33–56.

    Google Scholar 

  28. Steele,G.L.,Jr., Common LISP: The Language. Digital Press, 1984.

    Google Scholar 

  29. Steinberg, S. & Roache, P.J., Using MACSYMA to Write FORTRAN Subroutines. J. Symbolic Comp. 2 (1986) pp. 213–216.

    Google Scholar 

  30. Tournier,E., Solutions Formelles d'Equations différentielles: Le Logiciel de Calcul Formel: Desir Etude Théorique et Réalisation. Thèse d'Etat, University of Grenoble, 2 April 1987.

    Google Scholar 

  31. Wallis,P.J.L.W. (ed.), Improving Floating Point Programming. Wiley, 1990

    Google Scholar 

  32. Wolfe, P.S., Checking the Calculation of Gradients. ACM TOMS 8 (1982) pp. 337–343. Zbl. 493.65027. CR 8412-1021.

    Google Scholar 

  33. Yuasa,T. & Hagiya,M., The Kyoto Common Lisp Report. Research Institute for Mathematical Sciences, Kyoto University. June 1985.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Mathematical Sciences, University of Bath, BA2 7AY, Bath, England

    J. H. Davenport

Authors
  1. J. H. Davenport
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Alfonso Miola

Rights and permissions

Reprints and permissions

Copyright information

© 1990 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Davenport, J.H. (1990). Current problems in computer algebra systems design. In: Miola, A. (eds) Design and Implementation of Symbolic Computation Systems. DISCO 1990. Lecture Notes in Computer Science, vol 429. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-52531-9_118

Download citation

  • DOI: https://doi.org/10.1007/3-540-52531-9_118

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-52531-8

  • Online ISBN: 978-3-540-47014-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation