Skip to main content
SpringerLink
Log in

Parallel modular computation of Gröbner and involutive bases

  • Published:
Programming and Computer Software Aims and scope Submit manuscript

Abstract

An overview of an algorithm and an efficient implementation of parallel computing of involutive and Gröbner bases with the help of modular operations is presented. Difficulties arising in modulo calculations and in the reconstruction of a basis with coefficients in ℤ by its modular images are considered; Some ways to overcome these difficulties are indicated.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Buchberger, B., Gröbner Bases: An Algorithmic Method in Polynomial Ideal Theory, in Komp’yuternaya algebra. Simvol’nye i algebraicheskie vychisleniya (Computer Algebra: Symbolic and Algebraic Computations), Moscow: Mir, 1986, pp. 331–372.

    Google Scholar 

  2. Cox, D.A., Little, J., and O’Shea, D., Ideals, Varieties, and Algorithms: An Introduction to Computational Algebraic Geometry and Commutative Algebra, New York: Springer, 1998.

    Google Scholar 

  3. Gerdt, V.P. and Blinkov, Yu.A., Involutive Bases of Polynomial Ideals, Math. Comput. Simulation, 1998, vol. 45, pp. 519–542.

    Article  MathSciNet  MATH  Google Scholar 

  4. Gerdt, V. P. and Blinkov, Yu. A., Involutive Division of Monomials, Programming Comput. Software, 1998, vol. 24, no. 6, pp. 283–285.

    MathSciNet  MATH  Google Scholar 

  5. Arnold, E.A., Modular Algorithms for Computing Gröbner Bases, J. Symb. Comput., 2003, vol. 35, no. 4, pp. 403–419.

    Article  MATH  Google Scholar 

  6. Idrees, N., Pfister, G., and Steidel, S., Parallelization of Modular Algorithms, J. Symb. Comput., 2011, vol. 46, no. 6, pp. 672–684; arXiv:1005.5663.

    Article  MathSciNet  MATH  Google Scholar 

  7. Kornerup, P. and Gregory, R., Mapping Integers and Hensel Codes onto Farey Fractions, Bit, 1983, vol. 23, pp. 9–20.

    Article  MathSciNet  MATH  Google Scholar 

  8. http://en.wikipedia.org/wiki/MD5

  9. Bini, D. and Mourrain, B., Polynomial Test Suite. http://www-sop.inria.f-/saga/POL

  10. Verschelde, J., The Database with Test Examples. http://www.math.uic.edu/jan/demo.html

  11. Gerdt, V.P. and Yanovich, D. A., Parallel Computation of Janet and Gröbner Bases over Rational Numbers, Programming Comput. Software, 2005, vol. 31, no. 2, pp. 73–80.

    Article  MathSciNet  MATH  Google Scholar 

  12. Leykin A., On Parallel Computation of Gröbner Bases, Proc. of the ICPP 2004 Workshop High Performance Scientific and Engineering Computing, IEEE Comput. Soc., 2004, pp. 160–164.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Joint Institute for Nuclear Research, Dubna, Moscow oblast, 141980, Russia

    D. A. Yanovich

Authors
  1. D. A. Yanovich
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to D. A. Yanovich.

Additional information

Original Russian Text © D.A. Yanovich, 2013, published in Programmirovanie, 2013, Vol. 39, No. 2.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Yanovich, D.A. Parallel modular computation of Gröbner and involutive bases. Program Comput Soft 39, 110–113 (2013). https://doi.org/10.1134/S0361768813020084

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1134/S0361768813020084

Keywords

Search

Navigation