Skip to main content

Exact solution of computational problems via parallel truncated p-adic Arithmetic

  • Chapter
Advances in the Design of Symbolic Computation Systems

Part of the book series: Texts and Monographs in Symbolic Computation ((TEXTSMONOGR))

Abstract

The aim of the paper is to show the effectiveness of the p-adic arithmetic in scientific computation by selecting and solving problems which manipulates “big” numbers.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  • Aho, A. V., Hopcroft, J. E., Ullman, J. D. (1975): The design and analysis of computer algorithms. Addison Wesley, Reading, MA.

    Google Scholar 

  • Buchberger, B. (1965): Ein Algorithmus zum Auffinden der Basiselemente des Restklassenringes nach einem nulldimensionalen Polynomideal. Ph.D. thesis, University of Innsbruck, Innsbruck, Austria.

    Google Scholar 

  • Buchberger, B., Loos, R. (1983): Algebraic simplification. In: Buchberger, B., Collins, G. E., Loos, R. (eds.): Computer algebra, symbolic and algebraic computation, 2nd edn. Springer, Wien New York, pp. 11–43.

    Google Scholar 

  • Buchberger, B., Collins, G. E., Encarnacion, M., Mandache, A. (1993): A SACLIB 1.1 user’s guide. Tech. Rep. 93–19, RISC Linz, Johannes Kepler University, Linz.

    Google Scholar 

  • Buhr, A., Stroobosscher, R. A. (1990): Providing light-weight concurrency on sharedmemory multiprocessors computers running unix. Software Pract. Exper. 20: 929–964.

    Article  Google Scholar 

  • Colagrossi, A., Limongelli, C. (1988): Big numbers p-adic arithmetic: a parallel approach. In: Mora, T. (ed.): Applied algebra, algebraic algorithms and error-correcting codes. Springer, Berlin Heidelberg New York Tokyo, pp. 169–180 (Lecture notes in computer science, vol. 357).

    Google Scholar 

  • Colagrossi, A., Limongelli, C., Miola, A. (1997): p-adic arithmetic as a tool to deal with power series. In: Miola, A., Temperini, M. (eds.): Advances in the design of symbolic computation systems. Springer, Wien New York, pp. 53–67 (this volume).

    Chapter  Google Scholar 

  • Collins, G. E. (1975): Quantifier elimination for real closed fields by cylindrical algebraic decomposition. In: Brakhage, H. (ed.): Automata theory and formal languages. Springer, Berlin Heidelberg New York, pp. 134–183 (Lecture notes in computer science, vol. 33).

    Google Scholar 

  • Collins, G. E., Encarnacion, M., Mandache, A., Buchberger, B. (1993): SACLIB user’s guide. RISC Linz, Johannes Kepler University, Linz.

    Google Scholar 

  • Dittenberger, K. (1987): An efficient method for exact numerical computation. Diploma thesis, Johannes Kepler University, Linz, Austria.

    Google Scholar 

  • Gregory, R., Krishnamurthy, E. (1984): Methods and applications of error-free computation. Springer, New York Berlin Heidelberg.

    Book  MATH  Google Scholar 

  • Jebelean, T. (1993): Improving the multiprecision euclidean algorithm. In: Miola, A. (ed.): Design and implementation of symbolic computation systems. Springer, Berlin Heidelberg New York Tokyo, pp. 45–58 (Lecture notes in computer science, vol. 722).

    Chapter  Google Scholar 

  • Knuth, D. E. (1981): The art of computer programming, vol. 2, seminumerical algorithms. 2nd edn. Addison-Wesley, Reading, MA.

    MATH  Google Scholar 

  • Koblitz, N. (1977): p-adic numbers, p-adic analysis and Zeta functions. Springer, New York Berlin Heidelberg.

    Book  Google Scholar 

  • Krishnamurthy, E. V. (1985): Error-free polynomial matrix computations. Springer, New York Berlin Heidelberg.

    Book  MATH  Google Scholar 

  • Limongelli, C. (1987): Aritmetiche non-standard: implementazione e confronti. Laurea thesis, University of Rome “La Sapienza”, Rome, Italy.

    Google Scholar 

  • Limongelli, C. (1993): On an efficient algorithm for big rational number computations by parallel p-adics. J. Symb. Comput. 15: 181–197.

    Article  MathSciNet  MATH  Google Scholar 

  • Loidl, H. W. (1993): A parallel Chinese remainder algorithm on a shared memory multiprocessors. Tech. Rep. 93–09, RISC Linz, Johannes Kepler University, Linz.

    Google Scholar 

  • Wang, D. (1991): On the parallelization of characteristic-set-based algorithms. Tech. Rep. 91–30, RISC Linz, Johannes Kepler University, Linz.

    Google Scholar 

Download references

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag Wien

About this chapter

Cite this chapter

Limongelli, C. (1997). Exact solution of computational problems via parallel truncated p-adic Arithmetic. In: Miola, A., Temperini, M. (eds) Advances in the Design of Symbolic Computation Systems. Texts and Monographs in Symbolic Computation. Springer, Vienna. https://doi.org/10.1007/978-3-7091-6531-7_5

Download citation

  • DOI: https://doi.org/10.1007/978-3-7091-6531-7_5

  • Publisher Name: Springer, Vienna

  • Print ISBN: 978-3-211-82844-1

  • Online ISBN: 978-3-7091-6531-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics