Table of Contents
ISRN Computational Mathematics
Volume 2013 (2013), Article ID 352806, 12 pages
http://dx.doi.org/10.1155/2013/352806
Research Article

Approximate Gröbner Bases, Overdetermined Polynomial Systems, and Approximate GCDs

Wolfram Research, Kernal Development Group, 100 Trade Center Drive, Champaign, IL 61820, USA

Received 6 November 2012; Accepted 29 November 2012

Academic Editors: R. Joan Arinyo, M. Ogihara, and Y. Peng

Copyright © 2013 Daniel Lichtblau. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. K. Shirayanagi, “An algorithm to compute floating point Groebner bases,” in Mathematical Computation With Maple V, Ideas and Applications, T. Lee, Ed., pp. 95–106, Birkhauser, Boston, Mass, USA, 1993. View at Google Scholar
  2. M. Bodrato and A. Zanoni, “Numerical Gröbner bases and syzygies: an interval approach,” in Proceedings of the 6th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC '04), pp. 77–89, 2004.
  3. M. Bodrato and A. Zanoni, “Intervals, syzygies, numerical Gröbner bases: a mixed study approach,” in Proceedings of the 9th International Workshop on Computer Algebra in Scientific Computing (CASC '06), vol. LCNS 4194, pp. 64–76, Springer, 2006.
  4. D. Lichtblau, “Gröbner bases in Mathematica 3.0,” The Mathematica Journal, vol. 6, no. 4, pp. 81–88, 1996. View at Google Scholar
  5. T. Sasaki and F. Kako, “Computing floating-point Gröbner bases stably,” in Proceedings of the 2007 International Workshop on Symbolic-numeric Computation (SNC '07), pp. 180–189, ACM Press, July 2007. View at Publisher · View at Google Scholar · View at Scopus
  6. T. Sasaki and F. Kako, “Floating-point Gröbner basis computation with ill-conditionedness estimation,” in Computer Mathematics, D. Kapur, Ed., vol. 5081 of Lecture Notes In Artificial Intelligence, pp. 278–292, Springer-Verlag, Berlin, Germany, 2008. View at Google Scholar
  7. T. Sasaki and F. Kako, “Term cancellations in computing floatingpoint Gröbner bases,” in Proceedings of the 12th international conference on Computer algebra in scientific computing (CASC '10), V. P. Gerdt, W. Koepf, E. W. Mayr, and E. V. Vorozhtsov, Eds., pp. 220–231, Springer-Verlag, Berlin, Germany, 2010.
  8. K. Shirayanagi, “Floating point Gröbner bases,” Mathematics and Computers in Simulation, vol. 42, no. 4-6, pp. 509–528, 1996. View at Publisher · View at Google Scholar · View at Scopus
  9. H. J. Stetter, “Stabilization of polynomial systems solving with Groebner bases,” in Proceedings of the 1997 International Symposium on Symbolic and Algebraic Computation (ISSAC '97), W. Küchlin, Ed., pp. 117–124, ACM Press, July 1997. View at Scopus
  10. A. Zanoni, Numerical Gröbner bases [Ph.D. thesis], Università di Firenze, Florence, Italy, C. Traverso, advisor, 2003.
  11. C. Traverso and A. Zanoni, “Numerical stability and stabilization of Groebner basis computation,” in Proceedings of the 2002 International Symposium on Symbolic and Algebraic Computation (ISSAC '02), T. Mora, Ed., pp. 262–269, ACM Press, July 2002. View at Scopus
  12. J.-C. Faugere and Y. Liang, “Pivoting in extended rings for computing approximate Gröbner bases,” Mathematics in Computer Science, vol. 5, no. 2, pp. 179–194, 2011. View at Publisher · View at Google Scholar
  13. A. Kondratyev, Numerical computation of Gröbner bases [Ph.D. thesis], Johannes Kepler Universität, Linz, Austria, 2003.
  14. A. Kondratyev, H. Stetter, and F. Winkler, “Numerical computation of Gröbner bases,” in Proceedings of the 7th Workshop on Computer Algebra in Scientific Computing (CASC '04), V. G. Ghanza, E. W. Mayr, and E. V. Vorozhtov, Eds., pp. 295–306, Technical University Munich, St. Petersburg, Russia, 2004.
  15. J.-C. Faugere and Y. Liang, “Artificial discontinuities of single-parametric Gröbner bases,” Journal of Symbolic Computation, vol. 46, no. 4, pp. 459–466, 2011. View at Publisher · View at Google Scholar
  16. B. Mourrain and P. Trebuchet, “Generalized normal forms and polynomial system solving,” in Proceedings of the 2005 International Symposium on Symbolic and Algebraic Computation (ISSAC '05), pp. 253–260, July 2005. View at Scopus
  17. W. Auzinger and H. Stetter, “An elimination algorithm for the computation of all zeros of a system of multivariate polynomial equations,” R. P. Agarwal, Y. M. Chow, and S. J. Wilson, Eds., International Series of Numerical Mathematics 86, pp. 11–31, Birkhäuser Verlag, Berlin, Germany, 1988. View at Google Scholar
  18. R. Corless, “Editor's corner: Gröbner bases and matrix eigenproblems,” Communications in Computer Algebra, vol. 30, no. 4, pp. 26–32, 1996. View at Google Scholar
  19. D. Cox, “Introduction to Gröbner bases,” in Proceedings of Symposia in Applied Mathematics, D. Cox and B. Sturmfels, Eds., vol. 53, pp. 1–24, ACM Press, 1998.
  20. P. Gianni and T. Mora, “Algebraic solutions of systems of polynomial equations using Gröbner baseseditors,” in Applied Algebra, Algebraic Algorithms, and Error-Correcting Codes (AAECC 5), L. Hugeut and A. Poli, Eds., vol. LCNS 356, pp. 247–257, Springer, Berlin, Germany, 1988. View at Google Scholar
  21. D. Lichtblau, “Solving finite algebraic systems using numeric Gröbner bases and eigenvalues,” in Proceedings of the World Conference on Systemics, Cybernetics, and Informatics (SCI '00), vol. 10, pp. 555–560, 2000.
  22. D. Cox, J. Little, and D. O'Shea, Ideals, Varieties, and Algorithms: An Introduction to Computational Algebraic Geometry and Computer Algebra. Undergraduate Texts in Mathematics, Springer-Verlag, Berlin, Germany, 1992.
  23. B. Buchberger, “Gröbner bases: an algorithmic method in polynomial ideal theory,” in Multidimensional Systems Theory, N. K. Bose, Ed., chapter 6, D. Reidel Publishing Company, Dordrecht, The Netherlands, 1985. View at Google Scholar
  24. D. Lichtblau, “Polynomial GCD and factorization via approximate Gröbner bases,” in Proceedings of the 12th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC '10), pp. 29–36, 2010.
  25. J. Keiper, Numerical computation with Mathematica (tutorial notes), Electronic version: http://library.wolfram.com/infocenter/Conferences/4687/, 1992.
  26. M. Sofroniou and G. Spaletta, “Precise numerical computation,” Journal of Logic and Algebraic Programming, vol. 64, no. 1, pp. 113–134, 2005. View at Publisher · View at Google Scholar · View at Scopus
  27. G. Reid, J. Tang, and L. Zhi, “A complete symbolic-numeric linear method for camera pose determination,” in Proceedings of the 2003 International Symposium on Symbolic and Algebraic Computation (ISSAC '03), R. Sendra, Ed., pp. 215–223, ACM Press, August 2003. View at Scopus
  28. R. M. Corless, P. M. Gianni, B. M. Trager, and S. M. Watt, “Singular value decomposition for polynomial systems,” in Proceedings of the 1995 International Symposium on Symbolic and Algebraic Computation (ISSAC '95), H. M. Levelt, Ed., pp. 195–207, ACM Press, July 1995. View at Scopus
  29. V. Hribernig and H. J. Stetter, “Detection and validation of clusters of polynomial zeros,” Journal of Symbolic Computation, vol. 24, no. 6, pp. 667–682, 1997. View at Google Scholar · View at Scopus
  30. E. Kaltofen, Z. Yang, and L. Zhi, “Approximate greatest common divisors of several polynomials with linearly constrained coefficients and singular polynomials,” in Proceedings of the 2006 International Symposium on Symbolic and Algebraic Computation (ISSAC '06), J.-G. Dumas, Ed., pp. 169–176, ACM Press, July 2006. View at Scopus
  31. N. Karmarkar and Y. N. Lakshman, “Approximate polynomial greatest common divisors and nearest singular polynomials,” in Proceedings of the 1996 International Symposium on Symbolic and Algebraic Computation (ISSAC '96), Y. N. Lakshman, Ed., pp. 35–39, ACM Press, July 1996. View at Scopus
  32. M. Sanuki, “Computing approximate GCD of multivariate polynomials,” in Proceedings of the 2005 International Workshop on Symbolic-numeric Computation (SNC '05), Trends in Mathematics, pp. 55–68, Birkhauser, 2007.
  33. T. Sasaki and F. Sasaki, “Polynomial remainder sequence and approximate GCD,” Communications in Computer Algebra, vol. 31, no. 3, pp. 4–10, 1997. View at Google Scholar
  34. Y. Huang, W. Wu, H. J. Sletter, and L. Zhi, “Pseudofactors of multivariate polynomials,” in Proceedings of the 2000 International Symposium on Symbolic and Algebraic Computation (ISSAC '00), C. Traverso, Ed., pp. 161–168, ACM Press, August 2000. View at Scopus
  35. W. Adams and P. Loustaunau, An Introduction To Gröbner Bases. Graduate Studies in Mathematics, vol. 3, American Mathematical Society, Providence, RI, USA, 1994.
  36. T. Becker, W. Weispfenning, and H. Kredel, Gröbner Bases: A Computational Approach To Computer Algebra. Graduate Texts in Mathematics, vol. 141, Springer-Verlag, Berlin, Germany, 1993.
  37. Wolfram Research, Inc. Champaign, Illinois. Mathematica 8, http://www.wolfram.com/, 2010.
  38. J. Verschelde, Web site of polynomial systems, http://homepages.math.uic.edu/~jan/Demo/cassou.html, http://www.math.uic.edu/~jan/Demo/movestew.html, 2000.
  39. D. Lazard and F. Rouillier, “Solving parametric polynomial systems,” Journal of Symbolic Computation, vol. 42, no. 6, pp. 636–667, 2007. View at Publisher · View at Google Scholar · View at Scopus
  40. Z. Zeng and B. Dayton, “The approximate GCD of inexact polynomials,” in Proceedings of the 2004 International Symposium on Symbolic and Algebraic Computation (ISSAC '04), J. Gutierrez, Ed., pp. 320–327, ACM Press, 2004.