Hans J. Stetter
- 1.BUCHBERGER, B. Groebner bases: An algorithmic method in polynomial ideal theory. In Progress, directions, and open problems in multidimensional systems theory, N. K. Bose, Ed. D. Reidel Publ. Co., 1985.Google Scholar
- 2.FRISCO. (framework for the integration of symbolic and numeric computation). European Project No. 21024, Work Package 3: Algorithms and Library.Google Scholar
- 3.MARINARI, M. G., MOELLER, H. M., AND MORA, T. Groebner bases of ideals given by dual bases. In Proceedings of ISSAC 91. pp. 55-63. Google ScholarDigital Library
- 4.MAaINArU, M. G., MOELLEa, H. M., AND MORA, T. Groebner duality and multiplicities in polynomial system solving. 7kans. AMS. To appear.Google Scholar
- 5.MOELLER, H. M., AND STETTER, H. J. Multivariate polynomial equations with multiple zeros solved by matrix eigenproblems. Numer. Math. 70 (1995), 311-329. Google ScholarDigital Library
- 6.STETTER, H. J. Zeros of polynomial systems with coefficients of limited accuracy, in preparation.Google Scholar
- 7.STETTER, H. J. Multivariate polynomial equations as eigenvalue problems. In Contributions in Numerical Mathematics, vol. 2 of Series in Applicable Analysis. World Scientific, 1993, pp. 355-371.Google ScholarCross Ref
- 8.STETTER, n. J. Analysis of zero clusters in multivariate polynomial systems. In Proceedings of ISSAC 96 (1996), pp. 127-136. Google ScholarDigital Library
- 9.STETTER, H. J. Eigenproblems are at the heart of polynomial systems solving. SIGSAM Bull. 30, 4 (1996). Google ScholarDigital Library
- 10.WEISPFENNING, V. Comprehensive groebner bases. J. Symb. Comp. 1J (1992), 1-29. Google ScholarDigital Library
Index Terms
- Stabilization of polynomial systems solving with Groebner bases
Recommendations
Solving systems of polynomial equations with symmetries using SAGBI-Gröbner bases
ISSAC '09: Proceedings of the 2009 international symposium on Symbolic and algebraic computationIn this paper, we propose an efficient method to solve polynomial systems whose equations are left invariant by the action of a finite group G. The idea is to simultaneously compute a truncated SAGBI-Gr¨obner bases (a generalisation of Gr¨obner bases to ...
A new incremental algorithm for computing Groebner bases
ISSAC '10: Proceedings of the 2010 International Symposium on Symbolic and Algebraic ComputationIn this paper, we present a new algorithm for computing Gröbner bases. Our algorithm is incremental in the same fashion as F5 and F5C. At a typical step, one is given a Gröbner basis G for an ideal I and any polynomial g, and it is desired to compute a ...
Comments