Previous Articles Next Articles
XIAO Shuijing, ZENG Guangxing
[1] Rouillier F, Solving zerodimensional systems through the rational univariate representation, AAECC, 1995, 9: 433–461. [2] Zeng G X and Xiao S J, Computing the rational univariate representations for zerodimensional systems by Wu’s method, Sci. Sin. Math., 2010, 40(10): 999–1016(in Chinese). [3] Xiao S J and Zeng G X, Algorithms for computing the global infimum and minimum of a polynomial function, Sci. Sin. Math., 2011, 41(9): 759–788(in Chinese). [4] Xiao S J and Zeng G X, Solving the equalityconstrained minimization problem of polynomial functions, J. Global Optimization, 2019, 75: 683–733. [5] Wu W T, Mathematics Mechanization: Mechanical Geometry TheoremProving, Mechanical Geometry ProblemSolving and Polynomial EquationsSolving, Science Press/Kluwer Academic Publishers, Beijing/ DordrechtBostonLondon, 2000. [6] Wang D K, The software wsolve: A Maple package for solving system of polynomial equations, available at http://www.mmrc.iss.ac.cn/ dwang/wsolve.html. [7] Nagata M, Field Theory, Marcel Dekker, Inc., New York, 1977. [8] Becker T, Weispfenning V, and Kredel H, Gröbner Bases: A Computational Approach to Commutative Algebra, SpringerVerlag, New YorkBerlinHeidelberg, 1993. [9] Atiyah M F and MacDonald J G, Introduction to Commutative Algebra, AddisonWesley, Reading, MA, 1969. [10] Jacobson N, Basic Algebra I, 2nd Edition, W. H. Freeman and Company, New York, 1985. [11] Mishra B, Algorithmic Algebra, Texts and Monographs in Computer Science, SpringerVerlag, New YorkBerlinHeidelberg, 1993. [12] GonzalesVega L, Rouillier F, and Roy M F, Symbolic recipes for polynomial system solving, Eds. by Cohen A M, Cuypers H, and Sterk H, Some Tapas of Computer Algebra, SpringerVerlag, New YorkBerlinHeidelberg, 1999, 34–65. 
[1]  WANG Qiuye,LI Yangjia,XIA Bican,ZHAN Naijun. Generating SemiAlgebraic Invariants for NonAutonomous Polynomial Hybrid Systems [J]. Journal of Systems Science and Complexity, 2017, 30(1): 234252. 
[2]  LIU Lanlan,ZHOU Meng. On Computing Uniform Gr¨obner Bases for Ideals Generated by Polynimials with Parametric Exponents [J]. Journal of Systems Science and Complexity, 2016, 29(3): 850864. 
[3]  LIU Jiang,XU Ming, ZHAN Naijun, ZHAO Hengjun. DISCOVERING NONTERMINATING INPUTS FOR MULTIPATH POLYNOMIAL PROGRAMS [J]. Journal of Systems Science and Complexity, 2014, 27(6): 12861304. 
[4]  XIAO Shuijing , ZENG Guangxing. SEMIALGEBRAICALLY CONNECTED COMPONENTS OF MINIMUM POINTS OF A POLYNOMIAL FUNCTION [J]. Journal of Systems Science and Complexity, 2013, 26(6): 10281046. 
[5]  Wu Wenjun. ON THE CONSTRUCTION OF GROEBNER BASIS OF A POLYNOMIAL IDEAL BASED ON RIQUIERJANET THEORY [J]. Journal of Systems Science and Complexity, 1991, 4(3): 193207. 
Viewed  
Full text 


Abstract 

