Skip to main content
SpringerLink
Log in
Book cover

International Workshop on Computer Algebra in Scientific Computing

CASC 2012: Computer Algebra in Scientific Computing pp 361–362Cite as

Usage of Modular Techniques for Efficient Computation of Ideal Operations

(Invited Talk)

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 7442))

Abstract

Modular techniques are widely applied to various algebraic computations. (See [5] for basic modular techniques applied to polynomial computations.) In this talk, we discuss how modular techniques are efficiently applied to computation of various ideal operations such as Gröbner base computation and ideal decompositions. Here, by modular techniques we mean techniques using certain projections for improving the efficiency of the total computation, and by modular computations, we mean corresponding computations applied to projected images.

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

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.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

Learn about institutional subscriptions

References

  1. Arnold, E.: Modular algorithms for computing Gröbner bases. J. Symb. Comp. 35, 403–419 (2003)

    Article  MATH  Google Scholar 

  2. Dahan, X., Kadri, A., Schost, É.: Bit-size estimates for triangular sets in positive dimension. J. Complexity 28, 109–135 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  3. Dahan, X., Moreno Maza, M., Schost, É., Wu, W., Xie, Y.: Lifting techniques for triangular decompositions. In: Proc. ISSAC 2005, pp. 108–115. ACM Press, New York (2005)

    Google Scholar 

  4. Dahan, X., Schost, É.: Sharp estimates for triangular sets. In: Proc. ISSAC 2004, pp. 103–110. ACM Press, New York (2004)

    Google Scholar 

  5. von zur Gathen, J., Gerhard, J.: Modern Computer Algebra. Cambridge University Press, Cambridge (1999)

    MATH  Google Scholar 

  6. Gräbe, H.: On lucky primes. J. Symb. Comp. 15, 199–209 (1993)

    Article  MATH  Google Scholar 

  7. Idrees, N., Pfister, G., Steidel, S.: Parallelization of modular algorithms. J. Symb. Comp. 46, 672–684 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  8. Orange, S., Renault, G., Yokoyama, K.: Efficient arithmetic in successive algebraic extension fields using symmetries. Math. Comput. Sci. (to appear)

    Google Scholar 

  9. Noro, M., Yokoyama, K.: A modular method to compute the rational univariate representation of zero-dimensional ideals. J. Symb. Comp. 28, 243–263 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  10. Noro, M., Yokoyama, K.: Implementation of prime decomposition of polynomial ideals over small finite fields. J. Symb. Comp. 38, 1227–1246 (2004)

    Article  MathSciNet  Google Scholar 

  11. Pauer, F.: On lucky ideals for Gröbner bases computations. J. Symb. Comp. 14, 471–482 (1992)

    Article  MathSciNet  MATH  Google Scholar 

  12. Renault, G., Yokoyama, K.: Multi-modular algorithm for computing the splitting field of a polynomial. In: Proceedings of ISSAC 2008, pp. 247–254. ACM Press, New York (2008)

    Google Scholar 

  13. Sasaki, T., Takeshima, T.: A modular method for Gröbner-bases construction over ℚ and solving system of algebraic equations. J. Inform. Process. 12, 371–379 (1989)

    MathSciNet  MATH  Google Scholar 

  14. Traverso, C.: Gröbner Trace Algorithms. In: Gianni, P. (ed.) ISSAC 1988. LNCS, vol. 358, pp. 125–138. Springer, Heidelberg (1989)

    Chapter  Google Scholar 

  15. Winkler, F.: A p-adic approach to the computation of Gröbner bases. J. Symb. Comp. 6, 287–304 (1988)

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, Rikkyo University, 3-34-1 Nishi Ikebukuro, Toshima-ku, Tokyo, 171-8501, Japan

    Kazuhiro Yokoyama

Authors
  1. Kazuhiro Yokoyama
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Laboratory of Information Technologies (LIT), Joint Institute for Nuclear Research (JINR), 141980, Dubna, Russia

    Vladimir P. Gerdt

  2. Institut für Mathematik, Universität Kassel, Heinrich-Plett-Straße 40, 34132, Kassel, Germany

    Wolfram Koepf

  3. Institut für Informatik, Lehrstuhl für Effiziente Algorithmen, Technische Universität München, Boltzmannstraße 3, 85748, Garching, Germany

    Ernst W. Mayr

  4. Institute of Theoretical and Applied Mechanics, Russian Academy of Sciences, 630090, Novosibirsk, Russia

    Evgenii V. Vorozhtsov

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Yokoyama, K. (2012). Usage of Modular Techniques for Efficient Computation of Ideal Operations. In: Gerdt, V.P., Koepf, W., Mayr, E.W., Vorozhtsov, E.V. (eds) Computer Algebra in Scientific Computing. CASC 2012. Lecture Notes in Computer Science, vol 7442. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-32973-9_30

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-32973-9_30

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-32972-2

  • Online ISBN: 978-3-642-32973-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation