Floating point Gröbner bases

Mathematics and Computers in Simulation

Volumn 42, Issue 4-6, 1996, Pages 509-528

  Shirayanagi, Kiyoshi ^a  

^a NTT Communication Science Laboratories   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CALCULATIONS; COMPUTATION THEORY; DIGITAL ARITHMETIC; POLES AND ZEROS; PROBLEM SOLVING;

BRACKET COEFFICIENTS; FLOATING POINT GROBNER BASES; INTERVAL ARITHMETIC; MONOMIALS;

POLYNOMIALS;

EID: 0030284171     PISSN: 03784754     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0378-4754(96)00027-4     Document Type: Article

References (14)

1. G. Alefeld and J. Herzberger, Introduction to Interval Computations, Computer Science and Applied Mathematics (Academic Press, New York, 1983).
2. W. Boege, R. Gebauer and H. Kredel, Some examples for solving systems of algebraic equations by calculating Groebner bases, J. Symbolic. Comput. 1 (1986) 83-98.
3. B. Buchberger, Gröbner bases: An algorithmic method in polynomial ideal theory, in: N.K. Bose, ed., Multidimensional Systems Theory (Reidel, Dordrecht, 1985) Chapter 6, 184-232.
4. B. Buchberger, An algorithmical criterion for the solvability of algebraic systems of equations (German), Aequationes Mathematicae 4 (3) (1970) 374-383.
5. B.W. Char, K.O. Geddes, G.H. Gonnet, B.L. Leong, M.B. Monagan and S. M. Watt, First Leaves: A Tutorial Introduction to Maple V (Springer, Berlin, 1992).
6. J.H. Davenport, Y. Siret and E. Tournier, Computer Algebra, Systems and Algorithms for Algebraic Computation (Academic Press, New York, 1993).
7. L.E. Dickson, Finiteness of the odd perfect and primitive abundant numbers with n distinct prime factors, Amer. J. Math. 35 (1913) 413-426.
8. D.E. Knuth, The Art of Computer Programming, Vol. 2 (Addison-Wesley, Reading, MA, 1969).
9. R.E. Moore, Interval arithmetic and automatic error analysis in digital computing, Ph.D. Thesis, Mathematics Dept., Stanford Univ., October 1962.
10. M. Petković, Iterative Methods for Simultaneous Inclusion of Polynomial Zeros, Lecture Notes in Mathematics, 1387 (Springer, Berlin, 1989).
11. T. Sasaki and T. Takeshima, A modular method for Gröbner-basis construction over Q and solving system of algebraic equations, J. Inform. Process. 12 (4) (1989) 371-379.
12. K. Shirayanagi, An algorithm to compute floating point Gröbner bases, in: T. Lee, ed., Mathematical Computation with Maple V: Ideas and Applications (Birkhäuser, Basel, 1993) 95-106.
13. W. Trinks, On improving approximate results of Buchberger's algorithm by Newton's method, SIGSAM Bull. 18 (3) (1984) 7-11.
14. F. Winkler, A p-adic approach to the computation of Gröbner bases, J. Symbolic. Comput. 6 (2-3) (1988) 287-304.