Skip to main content

On the parallelization of characteristic-set-based algorithms

  • Conference paper
  • First Online:
Parallel Computation (ACPC 1991)

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

Abstract

This paper presents a parallelized version of algorithms for computing characteristic sets, characteristic series and irreducible characteristic series of sets of multivariate polynomials, decomposing algebraic varieties into irreducible components and proving theorems mechanically in elementary geometries. These algorithms have been implemented with up to 12 processors in MAPLE system by utilizing distributed workstations connected by a local network. The timing statistics on a set of test problems with remarks is given. The encountered problems of using parallelism for these algorithms are discussed.

This work is supported by the Austrian Ministry of Science and Research under ESPRIT Basic Research Action 3125 (MEDLAR) and Project “Parallel Computation on Workstation Networks”.

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Chou, S. C. and Gao, X. S., Techniques for Ritt-Wu's Decomposition Algorithm, Technical Report TR-90-2, Department of Computer Sciences, University of Texas at Austin, 1990.

    Google Scholar 

  2. Hodge W. V. D. and Pedoe, D., Methods of Algebraic Geometry, Vol. I, II, Cambridge University Press, Cambridge, 1947/1952.

    Google Scholar 

  3. Ritt, J. F., Differential Equations from the Algebraic Standpoint, Amer. Math. Soc., New York, 1932.

    Google Scholar 

  4. Ritt, J. F., Differential Algebra, Amer. Math. Soc., New York, 1950.

    Google Scholar 

  5. Wang, D. M., Characteristic Sets and Zero Structure of Polynomial Sets, Lecture Notes, RISC-LINZ, Johannes Kepler University, Austria, 1989.

    Google Scholar 

  6. Wang, D. M., Some Notes on Algebraic Methods for Geometry Theorem Proving, Preprint, RISC-LINZ, Johannes Kepler University, November 1990.

    Google Scholar 

  7. Wang, D. M., An Implementation of Characteristic Sets Method in MAPLE, RISC-Linz Series no. 91-25.0, Johannes Kepler University, Austria, May 1991.

    Google Scholar 

  8. Wu, W. T., Basic Principles of Mechanical Theorem Proving in Elementary Geometries, J. Sys. Sci. & Math. Scis., 4(1984), 207–235; J. Automated Reasoning, 2 (1986), 221–252.

    Google Scholar 

  9. Wu, W. T., Basic Principles of Mechanical Theorem Proving in Geometries (Part on elementary geometries, in Chinese), Science Press, Beijing, 1984.

    Google Scholar 

  10. Wu, W. T., Some Recent Advances in Mechanical Theorem-Proving of Geometries, Automated Theorem Proving: After 25 years, Contemp. Math., 29(1984), AMS, 235–242.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Hans P. Zima

Rights and permissions

Reprints and permissions

Copyright information

© 1992 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Wang, D. (1992). On the parallelization of characteristic-set-based algorithms. In: Zima, H.P. (eds) Parallel Computation. ACPC 1991. Lecture Notes in Computer Science, vol 591. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-55437-8_90

Download citation

  • DOI: https://doi.org/10.1007/3-540-55437-8_90

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-47073-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics