An improved algorithm for deciding semi-definite polynomials

JOURNAL OF ALGEBRA

卷:417

Article

Xiao, Shuijing¹  Zeng, Xiaoning²  Zeng, Guangxing¹ 

[1] Nanchang Univ, Dept Math, Nanchang 330031, Peoples R China

[2] Guangdong Univ Educt, Dept Math, Guangzhou 510303, Guangdong, Peoples R China

关键词: Semi-definite polynomial;    Semi-algebraic subset;    Triangular decomposition;    Regular chain;    Transfer principle;   

DOI  :  10.1016/j.jalgebra.2014.06.021

来源: Elsevier

【 摘 要 】

In this paper, a new algorithm is presented for deciding the semi-definiteness of multivariate polynomials with coefficients in a computable ordered field, which admits an effective method of finding an isolating set for every non-zero univariate polynomial. This algorithm is an improvement of the method presented in Ref. [24]. The technique in this paper is to compute triangular decompositions of polynomial systems into regular chains. (C) 2014 Elsevier Inc. All rights reserved.

【 授权许可】

Free