pith. sign in

arxiv: 0912.4438 · v1 · pith:IFN7N4UQnew · submitted 2009-12-22 · 💻 cs.SC · cs.NA· math.NA

The weighted difference substitutions and Nonnegativity Decision of Forms

classification 💻 cs.SC cs.NAmath.NA
keywords differenceweightedsequencesetssubstitutionsformalgorithmconvergence
0
0 comments X
read the original abstract

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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.