Computer Science – Symbolic Computation
Scientific paper
2009-12-22
Computer Science
Symbolic Computation
10 pages, 1 figures
Scientific paper
In this paper, we study the weighted difference substitutions from geometrical views. First, we give the geometric meanings of the weighted difference substitutions, and introduce the concept of convergence of the sequence of substitution sets. Then it is proven that the sequence of the successive weighted difference substitution sets is convergent. Based on the convergence of the sequence of the successive weighted difference sets, a new, simpler method to prove that if the form F is positive definite on T_n, then the sequence of sets {SDS^m(F)} is positively terminating is presented, which is different from the one given in [11]. That is, we can decide the nonnegativity of a positive definite form by successively running the weighted difference substitutions finite times. Finally, an algorithm for deciding an indefinite form with a counter-example is obtained, and some examples are listed by using the obtained algorithm.
Hou Xiaorong
Shao Junwei
Xu Song
No associations
LandOfFree
The weighted difference substitutions 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 The weighted difference substitutions and Nonnegativity Decision of Forms, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The weighted difference substitutions and Nonnegativity Decision of Forms will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-307509