Skip to main content
SpringerLink
Log in

On the uniform representation of mathematical data structures

  • Conference paper
  • First Online:
Design and Implementation of Symbolic Computation Systems (DISCO 1993)

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

Abstract

Topics about the integration of the numeric and symbolic computation paradigms are discussed. Mainly an approach through a uniform representation of numbers and symbols is presented, that allows for the application of algebraic algorithms to numeric problems. The p-adic construction is the basis of the unifying representation environment. An integrated version of the Hensel algorithm is presented, which is able to perform symbolic and numeric computations over instances of ground (concrete) and parametric structures, and symbolic computations over instances of abstract structures. Examples are provided to show how the approach outlined and the proposed implementation can treat both cases of symbolic and numeric computations. In the numeric case it is shown that the proposed extension of the Hensel Algorithm can allow for the exact manipulation of numbers. Moreover, such an extension avoids the use of simplification algorithms, since the computed results are already in simplified form.

This work has been partially supported by Progetto Finalizzato “Sistemi Informatici e Calcolo Parallelo” of CNR under grant n. 92.01604.69.

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. S.K. Abdali, G.W. Cherry, and N. Soiffer. An object-oriented approach to algebra system design. In B.W. Char, editor, ACM SYMSAC '86, 1986.

    Google Scholar 

  2. B. Caviness. Computer algebra: Past and future. Journal of Symbolic computation, 2, 1986.

    Google Scholar 

  3. B.W. Char, G.J. Fee, K.O. Geddes, G.H. Gonnet, B.W. Monagan, and S.M. Watt. A tutorial introduction to maple. Journal of Symbolic Computation, 2, n.2, 1986.

    Google Scholar 

  4. A. Colagrossi, C. Limongelli, and A. Miola. Scientific computation by error-free arithmetics. Journal of information Science and Technology, July–October 1993. to appear.

    Google Scholar 

  5. R.T. Gregory and E.V. Krishnamurthy. Methods and Applications of Error-Free Computation. Springer Verlag, 1984.

    Google Scholar 

  6. K. Hensel. Theorie der Algebraischen Zehlen. Teubner, Leipzig-Stuttgart, 1908.

    Google Scholar 

  7. R. Jenks and B. Trager. A language for computational algebra. Technical report, T.J.Watson Research Center, Yorktown, 1987.

    Google Scholar 

  8. C. Limongelli and A. Miola. Abstract specification of numeric and algebraic computation methods. Journal of information Science and Technology, July–October 1993. to appear.

    Google Scholar 

  9. C. Limongelli, A. Miola, and M. Temperini. Design and implementation of symbolic computation systems. In P.W. P.W. Gaffney and E. N. Houstis, editors, IFIP TC2/WG 2.5 Working Conference on Programming Environments For High Level Scientific Problem Solving. North-Holland, September 1991.

    Google Scholar 

  10. C. Limongelli and M. Temperini. Abstract specification of structures and methods in symbolic mathematical computation. Theoretical Computer Science, 104:89–107, October 1992. Elsevier Science Publisher.

    Google Scholar 

  11. J. D. Lipson. Newton s method: a great algebraic algorithm. In 1976 ACM Symposium on Symbolic and Algebraic Computation, 1976.

    Google Scholar 

  12. G. Mascari and A. Miola. On the integration on numeric and algebraic computations. In Proc. AAECC-5, volume 307 of LNCS, Karlsrhue, Germany, 1986. Springer Verlag.

    Google Scholar 

  13. A. Miola. Tasso: a system for mathematical problem solving. In B. Sushila E. Balagurusami, editor, Computer Systems and Applications, ICC Series. TaTa Mc Graw-Hill, 1990.

    Google Scholar 

  14. D. Y. Y. Yun. The Hensel Lemma in Algebraic manipulation. PhD thesis, Massachusetts Institute of Technology, November 1974.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dipartimento Informatica e Sistemistica, Università “La Sapienza”, Via Salaria 113, I-00198, Roma, Italy

    Carla Limongelli & Marco Temperini

Authors
  1. Carla Limongelli
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Marco Temperini
    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

© 1993 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Limongelli, C., Temperini, M. (1993). On the uniform representation of mathematical data structures. In: Miola, A. (eds) Design and Implementation of Symbolic Computation Systems. DISCO 1993. Lecture Notes in Computer Science, vol 722. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0013186

Download citation

  • DOI: https://doi.org/10.1007/BFb0013186

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-57235-0

  • Online ISBN: 978-3-540-47985-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation