Simplex Subdivisions and Nonnegativity Decision of Forms

Details Simplex Subdivisions and Nonnegativity Decision of Forms Simplex Subdivisions and Nonnegativity Decision of Forms

2009-12-22

arxiv.org/abs/0912.4430v1

Computer Science

Symbolic Computation

10 pages, 9 figures

Scientific paper

This paper mainly studies nonnegativity decision of forms based on variable substitutions. Unlike existing research, the paper regards simplex subdivisions as new perspectives to study variable substitutions, gives some subdivisions of the simplex T_n, introduces the concept of convergence of the subdivision sequence, and presents a sufficient and necessary condition for the convergent self-similar subdivision sequence. Then the relationships between subdivisions and their corresponding substitutions are established. Moreover, it is proven that if the form F is indefinite on T_n and the sequence of the successive L-substitution sets is convergent, then the sequence of sets {SLS^(m)(F)} is negatively terminating, and an algorithm for deciding indefinite forms with a counter-example is obtained. Thus, various effective substitutions for deciding positive semi-definite forms and indefinite forms are gained, which are beyond the weighted difference substitutions characterized by "difference".

Affiliated with

Also associated with

No associations

Rating

Simplex Subdivisions and Nonnegativity Decision of Forms does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Simplex Subdivisions and Nonnegativity Decision of Forms, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Simplex Subdivisions and Nonnegativity Decision of Forms will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-307457